NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> undef4}> = 0), par{arg1 -> ((arg1 + 1) - (10 * undef7)), arg2 -> undef6}> undef8, arg2 -> undef9}> Fresh variables: undef2, undef4, undef6, undef7, undef8, undef9, Undef variables: undef2, undef4, undef6, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef9 > ~(1))> = 0), par{arg1 -> ((arg1 + 1) - (10 * undef7))}> Fresh variables: undef2, undef4, undef6, undef7, undef8, undef9, Undef variables: undef2, undef4, undef6, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1 - 10*undef7, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001641 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002235s Trying to remove transition: 1 + arg1 - 10*undef7, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003215s Time used: 0.003069 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059656s Time used: 0.059456 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013383s Time used: 0.013381 LOG: SAT solveNonLinear - Elapsed time: 0.073039s Cost: 1; Total time: 0.072837 Failed at location 2: 15 <= arg1 Before Improving: Quasi-invariant at l2: 15 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001928s Remaining time after improvement: 0.99941 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 15 <= arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 - 10*undef7, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1 - 10*undef7, rest remain the same}> New Graphs: Calling Safety with literal 15 <= arg1 and entry LOG: CALL check - Post:15 <= arg1 - Process 1 * Exit transition: * Postcondition : 15 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000258s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000295s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 15 <= arg1 , Narrowing transition: 1 + arg1 - 10*undef7, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1 - 10*undef7, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000294s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001117s Trying to remove transition: 1 + arg1 - 10*undef7, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001590s Time used: 0.001513 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.638006s Time used: 0.637857 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015444s Time used: 4.00051 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007461s Time used: 1.00033 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005126s Time used: 0.002662 Proving non-termination of subgraph 1 Transitions: 1 + arg1 - 10*undef7, rest remain the same}> Variables: arg1 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000297s Checking conditional non-termination of SCC {l2}... > No assignment for some undef value. > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: arg1 <= 14, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg1 <= 14, OPEN EXITS: > Conditions are reachable! Program does NOT terminate