NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) > 0), par{arg1 -> (arg1 - 1)}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) = 0) /\ ((2 * arg1) >= 0), par{arg1 -> ((2 * arg1) + 1), arg2 -> (arg2 + 1)}> undef7, arg2 -> undef8}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) > 0), par{arg1 -> (arg1 - 1)}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) = 0) /\ ((2 * arg1) >= 0), par{arg1 -> ((2 * arg1) + 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> 1 + 2*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.004881 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001057s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004618s Trying to remove transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034256s Time used: 0.034006 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041457s Time used: 0.040841 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029867s Time used: 0.029043 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046727s Time used: 0.046722 LOG: SAT solveNonLinear - Elapsed time: 0.076594s Cost: 1; Total time: 0.075765 Failed at location 2: 1 + arg1 <= arg2 Before Improving: Quasi-invariant at l2: 1 + arg1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006108s Remaining time after improvement: 0.998066 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg1 <= 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -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 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg1 <= arg2 and entry LOG: CALL check - Post:1 + arg1 <= arg2 - Process 1 * Exit transition: * Postcondition : 1 + arg1 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000772s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000912s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg2 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + 2*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.000928s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004690s Trying to remove transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032601s Time used: 0.0324 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041335s Time used: 0.040626 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003827s Time used: 4.00322 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006654s Time used: 4.00092 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008307s Time used: 1.00064 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031122s Time used: 0.019286 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037033s Time used: 0.037027 LOG: SAT solveNonLinear - Elapsed time: 0.068155s Cost: 1; Total time: 0.056313 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + 2*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.001064s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014264s Trying to remove transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078136s Time used: 0.077918 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050466s Time used: 0.049744 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015747s Time used: 4.01512 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006737s Time used: 4.00096 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008188s Time used: 1.00062 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067499s Time used: 0.055638 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> 1 + 2*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.017529s Time used: 0.017282 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021516s Time used: 0.021502 LOG: SAT solveNonLinear - Elapsed time: 0.039045s Cost: 2; Total time: 0.038784 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*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.012520s Time used: 0.012292 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011369s Time used: 0.011363 LOG: SAT solveNonLinear - Elapsed time: 0.023889s Cost: 1; Total time: 0.023655 Failed at location 2: arg2 <= arg1 Before Improving: Quasi-invariant at l2: arg2 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003402s Remaining time after improvement: 0.998317 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg2 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= arg2, arg2 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg2 <= arg1, 0 <= arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate