NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef4 - undef5), arg2 -> undef2, arg3 -> undef3}> 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> undef10, arg3 -> undef11}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> undef15, arg2 -> undef16, arg3 -> undef17}> Fresh variables: undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, Undef variables: undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef16 > 1) /\ (undef5 > ~(1)) /\ (undef15 > 0) /\ ((undef4 - undef5) > 0)> 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> Fresh variables: undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, Undef variables: undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.031998 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001205s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009114s Trying to remove transition: -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020925s Time used: 0.020706 Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000674s Time used: 4.00003 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014166s Time used: 4.00026 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015935s Time used: 4.00007 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020811s Time used: 1.00008 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011377s Time used: 4.00025 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019790s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.019989s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135287s Time used: 0.13477 Improving Solution with cost 9 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000702s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.135989s Cost: 9; Total time: 1.13543 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l3: 10 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.094749s Time used: 0.09434 Improving Solution with cost 5 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000608s Time used: 1.00055 LOG: SAT solveNonLinear - Elapsed time: 1.095357s Cost: 5; Total time: 1.09489 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg2 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l3: 4 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025335s Time used: 0.025014 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033735s Time used: 0.033729 LOG: SAT solveNonLinear - Elapsed time: 0.059070s Cost: 1; Total time: 0.058743 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg3 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l3: 4 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008839s Time used: 0.008734 LOG: SAT solveNonLinear - Elapsed time: 0.008839s Cost: 0; Total time: 0.008734 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 0 <= arg2 + arg3 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, arg2 <= arg3, arg3 <= arg2, 0 <= arg2 + arg3, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, 0 <= arg2 + arg3, arg2 = arg3, OPEN EXITS: > Conditions are reachable! Program does NOT terminate