NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef5}> undef11}> undef19}> undef22}> (~(1) + x_5^0)}> Fresh variables: undef5, undef11, undef19, undef22, Undef variables: undef5, undef11, undef19, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef22, x_5^0 -> (~(1) + x_5^0)}> Fresh variables: undef5, undef11, undef19, undef22, Undef variables: undef5, undef11, undef19, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef22, x_5^0 -> -1 + x_5^0, rest remain the same}> Variables: x_5^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003538 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000751s Ranking function: x_5^0 New Graphs: Transitions: Variables: x_5^0 > No variable changes in termination graph. Checking conditional unfeasibility... Calling Safety with literal 1 + x_5^0 <= 0 and entry LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + x_5^0 <= 0 Quasi-invariants: Location 2: 1 + x_5^0 <= 0 ; Postcondition: 1 + x_5^0 <= 0 LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 2 * Exit transition: * Postcondition : 1 + x_5^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000227s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000288s LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: undef22, x_5^0 -> -1 + x_5^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef22, x_5^0 -> -1 + x_5^0, rest remain the same}> END GRAPH: EXIT: POST: 1 + x_5^0 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007729s Time used: 0.007625 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000829s Time used: 4.00042 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004518s Time used: 1.00055 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.038840s Proving non-termination of subgraph 1 Transitions: undef22, x_5^0 -> -1 + x_5^0, rest remain the same}> Variables: x_5^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001176s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001704s Time used: 5.00143 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.009646s Time used: 5.00337 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.058133s Time used: 5.0001 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: Variables: x_5^0 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006665s Time used: 0.006503 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011734s Time used: 0.011727 LOG: SAT solveNonLinear - Elapsed time: 0.018400s Cost: 1; Total time: 0.01823 Failed at location 2: 1 <= x_5^0 Before Improving: Quasi-invariant at l2: 1 <= x_5^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003748s Remaining time after improvement: 0.998585 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.001877s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= x_5^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): Calling reachability with... Transition: Conditions: 1 <= x_5^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= x_5^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate