NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2), par{arg2 -> (arg3 - 1), arg3 -> (arg1 - 2), arg4 -> undef16}> 0) /\ (arg1 = arg3), par{arg2 -> (arg1 - 1), arg3 -> (arg1 - 2), arg4 -> undef20}> arg3), par{arg4 -> undef24}> undef28}> arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef32}> 0, arg3 -> arg2, arg4 -> undef36}> arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef40}> 0, arg3 -> arg2, arg4 -> undef44}> 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef48}> 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef52}> (arg1 - 1), arg4 -> undef56}> 0, arg2 -> 0, arg3 -> ~(1), arg4 -> undef60}> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef64}> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef68}> 2, arg2 -> 1, arg3 -> 1, arg4 -> undef72}> undef73, arg2 -> undef74, arg3 -> undef75, arg4 -> undef76}> Fresh variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Undef variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef74 > ~(1))> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg1 - 2) > (arg3 - 1)), par{arg2 -> 0, arg3 -> (arg3 - 1)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg3 - 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> (arg3 - 1)}> 0) /\ (arg1 = arg3) /\ ((arg1 - 2) < (arg1 - 1)), par{arg2 -> 0, arg3 -> (arg1 - 1)}> 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 0, arg2 -> 0, arg3 -> ~(1)}> 2, arg2 -> 1, arg3 -> 1}> Fresh variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Undef variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 0, arg2 -> 0, arg3 -> -1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 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.046995 Some transition disabled by a set of invariant(s): Invariant at l2: 1 <= arg1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 0, arg2 -> 0, arg3 -> -1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Checking unfeasibility... Time used: 0.031735 Some transition disabled by a set of invariant(s): Invariant at l2: 0 <= arg2 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Checking unfeasibility... Time used: 4.00055 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018373s Ranking function: -16 + 4*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002356s Ranking function: -6 + 3*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001426s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.087787s Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015411s Time used: 0.014493 Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016461s Time used: 0.014942 Trying to remove transition: 0, arg3 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018791s Time used: 0.01726 Trying to remove transition: 0, arg3 -> -1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016055s Time used: 0.014502 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018335s Time used: 0.016768 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019014s Time used: 0.017421 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080766s Time used: 0.078774 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.009565s Time used: 1.00956 LOG: SAT solveNonLinear - Elapsed time: 1.090331s Cost: 1; Total time: 1.08833 Failed at location 2: 1 + arg1 <= arg3 Before Improving: Quasi-invariant at l2: 1 + arg1 <= arg3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005480s Remaining time after improvement: 0.996585 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg1 <= arg3 [ 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 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg1 <= arg3 and entry LOG: CALL check - Post:1 + arg1 <= arg3 - Process 1 * Exit transition: * Postcondition : 1 + arg1 <= arg3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000933s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000984s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg3 , Narrowing transition: 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003259s Ranking function: -28 + 7*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002794s Ranking function: -6 + 3*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001589s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.088049s Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018865s Time used: 0.017798 Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017781s Time used: 0.015977 Trying to remove transition: 0, arg3 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018883s Time used: 0.017163 Trying to remove transition: 0, arg3 -> -1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017274s Time used: 0.015534 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021761s Time used: 0.020002 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019797s Time used: 0.017999 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105597s Time used: 0.103536 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000790s Time used: 1.00078 LOG: SAT solveNonLinear - Elapsed time: 1.106387s Cost: 1; Total time: 1.10432 Failed at location 2: arg1 <= 1 + arg3 Before Improving: Quasi-invariant at l2: arg1 <= 1 + arg3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007086s Remaining time after improvement: 0.99554 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 1 + arg3 [ 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 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> New Graphs: Transitions: 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000957s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009947s Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000466s Time used: 4.00003 Trying to remove transition: 0, arg3 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028556s Time used: 0.01267 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012251s Time used: 0.011652 LOG: SAT solveNonLinear - Elapsed time: 0.012251s Cost: 0; Total time: 0.011652 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg3 <= arg1 + arg2 Ranking function: 2*arg1 + 2*arg2 - 2*arg3 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005765s Trying to remove transition: 1, arg3 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000316s Time used: 4.00012 Trying to remove transition: 0, arg3 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030238s Time used: 0.017819 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000616s Time used: 4.00002 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013649s Time used: 4.00014 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016829s Time used: 1.00003 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.654164s Time used: 0.642668 Proving non-termination of subgraph 1 Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054989s Time used: 0.054619 Improving Solution with cost 6 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.118067s Time used: 0.118064 LOG: SAT solveNonLinear - Elapsed time: 0.173056s Cost: 6; Total time: 0.172683 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l2: 8 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 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030773s Time used: 0.030484 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028815s Time used: 0.028812 LOG: SAT solveNonLinear - Elapsed time: 0.059587s Cost: 1; Total time: 0.059296 Failed at location 2: arg3 <= arg1 Before Improving: Quasi-invariant at l2: arg3 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009271s Remaining time after improvement: 0.997727 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg3 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 4 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, 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, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= arg3, arg3 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg3 <= arg1, 0 <= arg3, OPEN EXITS: > Conditions are reachable! Program does NOT terminate