NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef2, temp6_11^0 -> undef5, x_10^0 -> (0 + undef5)}> undef7, nondet_8^0 -> undef9, temp5_9^0 -> undef10}> undef15, temp5_9^0 -> (0 + undef15)}> (1 + x_10^0)}> undef37, nondet_8^0 -> undef39, temp5_9^0 -> undef40}> undef45, temp5_9^0 -> (0 + undef45)}> (1 + x_10^0)}> undef73, nondet_8^0 -> undef75, temp5_9^0 -> undef76}> undef81, temp5_9^0 -> (0 + undef81)}> (1 + x_10^0)}> Fresh variables: undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, Undef variables: undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef5)}> (1 + (0 + undef5))}> (1 + (0 + undef5))}> (1 + x_10^0)}> (1 + x_10^0)}> Fresh variables: undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, Undef variables: undef2, undef5, undef7, undef9, undef10, undef15, undef37, undef39, undef40, undef45, undef73, undef75, undef76, undef81, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + x_10^0, rest remain the same}> 1 + x_10^0, rest remain the same}> Variables: x_10^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 1 + undef5, rest remain the same}> 1 + undef5, rest remain the same}> Graph 2 undef5, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 2 ) ( 7 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00354 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000828s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003671s Trying to remove transition: 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005852s Time used: 0.005661 Trying to remove transition: 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005340s Time used: 0.004966 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001354s Time used: 4.00073 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006277s Time used: 4.0009 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010127s Time used: 1.00056 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019217s Time used: 0.013401 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031897s Time used: 0.03189 LOG: SAT solveNonLinear - Elapsed time: 0.051114s Cost: 1; Total time: 0.045291 Termination implied by a set of invariant(s): Invariant at l7: 1 <= x_10^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> Quasi-ranking function: 50000 - x_10^0 New Graphs: Transitions: 1 + x_10^0, rest remain the same}> 1 + x_10^0, rest remain the same}> Variables: x_10^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000867s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003960s Trying to remove transition: 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006054s Time used: 0.005888 Trying to remove transition: 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006086s Time used: 0.005692 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002812s Time used: 4.00202 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006671s Time used: 4.00115 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010537s Time used: 1.00059 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018419s Time used: 0.011603 Termination failed. Trying to show unreachability... Proving unreachability of entry: 1 + undef5, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 1 + undef5, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001634s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001735s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + x_10^0, rest remain the same}> 1 + x_10^0, rest remain the same}> Variables: x_10^0 Checking conditional non-termination of SCC {l7}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012620s Time used: 0.012517 LOG: SAT solveNonLinear - Elapsed time: 0.012620s Cost: 0; Total time: 0.012517 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003918s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l7: 1 <= x_10^0 Strengthening and disabling EXIT transitions... Closed exits from l7: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + x_10^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= x_10^0, Transition: Conditions: 1 <= x_10^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: 1 + undef5, rest remain the same}> Conditions: 1 <= x_10^0, Transition: 1 + undef5, rest remain the same}> Conditions: 1 <= x_10^0, Transition: 1 + undef5, rest remain the same}> Conditions: 1 <= x_10^0, Transition: 1 + undef5, rest remain the same}> Conditions: 1 <= x_10^0, OPEN EXITS: 1 + undef5, rest remain the same}> 1 + undef5, rest remain the same}> 1 + undef5, rest remain the same}> 1 + undef5, rest remain the same}> > Conditions are reachable! Program does NOT terminate