NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> 5}> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> arg1) /\ (arg2 < 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> undef15, arg2 -> undef16}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef16 > ~(1))> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> 0) /\ (arg2 < (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) + 1)}> = (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> 0}> arg1) /\ (arg2 > 0) /\ (arg2 >= (0 - arg1)), par{arg1 -> (arg1 + 1), arg2 -> ((~(1) * arg2) - 1)}> Fresh variables: undef15, undef16, Undef variables: undef15, undef16, 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 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 0, rest remain the same}> 1 + arg1, arg2 -> 0, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 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.012622 Some transition disabled by a set of invariant(s): Invariant at l2: 0 <= 1 + arg1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 - arg2, 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, 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Checking unfeasibility... Time used: 0.009701 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002397s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.300488s Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017751s Time used: 0.016909 Trying to remove transition: 1 + arg1, arg2 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018266s Time used: 0.017063 Trying to remove transition: 1 + arg1, arg2 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018169s Time used: 0.017194 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014638s Time used: 0.013676 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.025062s Time used: 4.02426 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.142209s Time used: 0.121445 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001123s Time used: 1.00114 LOG: SAT solveNonLinear - Elapsed time: 1.143332s Cost: 1; Total time: 1.12259 Failed at location 2: arg2 <= 0 Before Improving: Quasi-invariant at l2: 0 <= arg2 Quasi-invariant at l2: arg2 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010049s Remaining time after improvement: 0.994532 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg2 Quasi-invariant at l2: arg2 <= 0 [ 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, arg2 -> 1 - arg2, 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, 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, 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 -> -1 - arg2, rest remain the same}> [ Termination 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, arg2 -> 1 - arg2, 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, 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, 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 -> -1 - arg2, rest remain the same}> New Graphs: Calling Safety with literal arg2 <= 0 and entry LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001308s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001412s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , 0 <= arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 1 + arg1, arg2 -> 0, rest remain the same}> It's unfeasible. Removing transition: 1 + arg1, arg2 -> 0, rest remain the same}> Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001218s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026402s Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010913s Time used: 0.010685 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011690s Time used: 0.011166 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001809s Time used: 4.00147 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070007s Time used: 0.058997 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000982s Time used: 1.00101 LOG: SAT solveNonLinear - Elapsed time: 1.070989s Cost: 1; Total time: 1.06001 Failed at location 2: 1 + arg2 <= arg1 Before Improving: Quasi-invariant at l2: 1 + arg2 <= arg1 Quasi-invariant at l2: 1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017856s Remaining time after improvement: 0.996847 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg2 <= arg1 Quasi-invariant at l2: 1 <= arg2 [ 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, arg2 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg2 <= arg1 and entry LOG: CALL check - Post:1 + arg2 <= arg1 - Process 2 * Exit transition: * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001148s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001263s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 <= arg1 , 1 <= arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002583s Ranking function: -arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001364s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036335s Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011855s Time used: 0.011625 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010203s Time used: 0.009655 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001990s Time used: 4.00127 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078276s Time used: 0.065921 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000609s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.078885s Cost: 1; Total time: 1.06658 Failed at location 2: arg2 <= arg1 Before Improving: Quasi-invariant at l2: 0 <= arg2 Quasi-invariant at l2: arg2 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024806s Remaining time after improvement: 0.996106 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg2 Quasi-invariant at l2: arg2 <= 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, arg2 -> 1 - arg2, 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 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 - arg2, 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 -> -1 - arg2, rest remain the same}> New Graphs: Calling Safety with literal arg2 <= arg1 and entry LOG: CALL check - Post:arg2 <= arg1 - Process 3 * Exit transition: * Postcondition : arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001370s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001495s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= arg1 , 0 <= arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002514s Ranking function: -arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001395s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036341s Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012146s Time used: 0.011906 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010484s Time used: 0.009852 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002439s Time used: 4.00166 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013977s Time used: 4.00114 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013786s Time used: 1.00085 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033192s Time used: 0.020188 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001092s Time used: 1.00114 LOG: SAT solveNonLinear - Elapsed time: 1.034284s Cost: 1; Total time: 1.02133 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + arg1 [ Invariant Graph ] 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 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg2, 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 + arg1, arg2 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001576s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.103994s Trying to remove transition: 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015096s Time used: 0.014855 Trying to remove transition: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015008s Time used: 0.014339 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.718322s Time used: 3.71755 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007147s Time used: 0.995319 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.033788s Time used: 1.02642 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.959481s Time used: 0.946783 Proving non-termination of subgraph 1 Transitions: 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> 1 - arg2, rest remain the same}> 1 + arg1, arg2 -> -1 - arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019898s Time used: 0.019635 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045772s Time used: 0.045768 LOG: SAT solveNonLinear - Elapsed time: 0.065671s Cost: 3; Total time: 0.065403 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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 - arg2, 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 -> 1 - arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> -1 - arg2, 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.017254s Time used: 0.017145 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001777s Time used: 5.00115 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.006110s Time used: 5.00093 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 0 <= arg1 + arg2, 0 <= arg2, arg1 <= arg2, 1 + arg1 <= arg2, 0 <= arg1, Transition: Conditions: 1 + arg1 + arg2 <= 0, 1 + arg2 <= 0, 1 + arg2 <= arg1, arg2 <= arg1, 0 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= arg1, 0 <= arg1 + arg2, 0 <= arg2, 1 + arg1 <= arg2, Transition: Conditions: 0 <= arg1, 1 + arg1 + arg2 <= 0, 1 + arg2 <= arg1, 1 + arg2 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate