NO Solver Timeout: 4 Global Timeout: 60 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.110803 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.074078 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.00089 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032272s 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.005203s 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.003074s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.203507s 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.034629s Time used: 0.03267 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.037506s Time used: 0.034135 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.042441s Time used: 0.039064 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.036256s Time used: 0.032868 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047974s Time used: 0.044546 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044372s Time used: 0.040799 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.211393s Time used: 0.207306 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001450s Time used: 1.0014 LOG: SAT solveNonLinear - Elapsed time: 1.212844s Cost: 1; Total time: 1.2087 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.011357s Remaining time after improvement: 0.992431 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.001660s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001789s 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.007162s 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.006017s 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.003436s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.210211s 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.040796s Time used: 0.038363 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.039850s Time used: 0.036208 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.042988s Time used: 0.039146 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.039025s Time used: 0.034959 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049006s Time used: 0.045171 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044709s Time used: 0.04074 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.228477s Time used: 0.224218 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000985s Time used: 1.00093 LOG: SAT solveNonLinear - Elapsed time: 1.229462s Cost: 1; Total time: 1.22515 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.012464s Remaining time after improvement: 0.991731 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.001978s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022406s 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.001108s Time used: 4.00025 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.043378s Time used: 0.026168 Trying to remove transition: 1 + arg3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026142s Time used: 0.024863 LOG: SAT solveNonLinear - Elapsed time: 0.026142s Cost: 0; Total time: 0.024863 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.001608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012915s 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.000725s Time used: 4.00023 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.052329s Time used: 0.037118 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001176s Time used: 4.00006 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017414s Time used: 4.00002 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.018021s Time used: 1.00022 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.502322s Time used: 1.48241 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.121810s Time used: 0.121163 Improving Solution with cost 6 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.280436s Time used: 0.280404 LOG: SAT solveNonLinear - Elapsed time: 0.402246s Cost: 6; Total time: 0.401567 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.068039s Time used: 0.067508 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062776s Time used: 0.062767 LOG: SAT solveNonLinear - Elapsed time: 0.130815s Cost: 1; Total time: 0.130275 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.018761s Remaining time after improvement: 0.99512 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