NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}> 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> undef9, arg2 -> undef10}> Fresh variables: undef1, undef2, undef9, undef10, Undef variables: undef1, undef2, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef10 > 1) /\ (undef2 > ~(1)) /\ (undef9 > 0)> 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}> 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> Fresh variables: undef1, undef2, undef9, undef10, Undef variables: undef1, undef2, undef9, undef10, 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}> arg2, rest remain the same}> arg2, arg2 -> arg1, 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.007027 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001460s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036921s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016758s Time used: 0.016348 Trying to remove transition: arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017261s Time used: 0.01655 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019475s Time used: 0.018769 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030379s Time used: 0.029505 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.087003s Time used: 0.086996 LOG: SAT solveNonLinear - Elapsed time: 0.117382s Cost: 1; Total time: 0.116501 Failed at location 2: arg2 <= 0 Before Improving: Quasi-invariant at l2: arg2 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008822s Remaining time after improvement: 0.997479 Termination implied by a set of quasi-invariant(s): 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, rest remain the same}> > It's unfeasible. Removing transition: arg2, arg2 -> 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 + arg1, 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.000829s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000948s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041065s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015132s Time used: 0.014626 Trying to remove transition: arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018739s Time used: 0.017973 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018560s Time used: 0.017818 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030611s Time used: 0.029681 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096626s Time used: 0.096619 LOG: SAT solveNonLinear - Elapsed time: 0.127238s Cost: 1; Total time: 0.1263 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009201s Remaining time after improvement: 0.997159 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 2 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000893s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001016s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001457s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040967s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015260s Time used: 0.014719 Trying to remove transition: arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019263s Time used: 0.018359 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019004s Time used: 0.018108 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084143s Time used: 0.083216 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.097365s Time used: 0.097359 LOG: SAT solveNonLinear - Elapsed time: 0.181507s Cost: 1; Total time: 0.180575 Failed at location 2: arg1 + arg2 <= 2 Before Improving: Quasi-invariant at l2: arg1 + arg2 <= 2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009576s Remaining time after improvement: 0.997216 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + arg2 <= 2 [ 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 It's unfeasible. Removing transition: arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> 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 It's unfeasible. Removing transition: arg2, rest remain the same}> New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001006s Ranking function: -arg1 + arg2 New Graphs: Calling Safety with literal arg1 + arg2 <= 2 and entry LOG: CALL check - Post:arg1 + arg2 <= 2 - Process 3 * Exit transition: * Postcondition : arg1 + arg2 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000822s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000963s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 2 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001735s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.055004s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017043s Time used: 0.016448 Trying to remove transition: arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023978s Time used: 0.023138 Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022404s Time used: 0.021553 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.134025s Time used: 0.133197 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004124s Time used: 4.00162 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017298s Time used: 1.00039 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052221s Time used: 0.039345 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> arg2, rest remain the same}> arg2, arg2 -> arg1, 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.018514s Time used: 0.018211 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000703s Time used: 1.00069 LOG: SAT solveNonLinear - Elapsed time: 1.019217s Cost: 4; Total time: 1.0189 Failed at location 2: 1 <= arg1 Before Improving: Quasi-invariant at l2: 1 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007688s Remaining time after improvement: 0.997657 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 3 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): arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, arg2 -> arg1, 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.016380s Time used: 0.01612 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000787s Time used: 1.00078 LOG: SAT solveNonLinear - Elapsed time: 1.017167s Cost: 2; Total time: 1.0169 Failed at location 2: 1 <= arg2 Before Improving: Quasi-invariant at l2: 1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006187s Remaining time after improvement: 0.997975 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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): arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg2, arg2 -> arg1, 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: 5.001945s Time used: 5.0018 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.040084s Time used: 5.00108 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.030947s Time used: 5.02631 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 1 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, 1 + arg2 <= arg1, arg2 <= arg1, Transition: Conditions: 1 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, arg1 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, 1 + arg2 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, Transition: Conditions: 1 <= arg1, 1 <= arg2, arg1 <= arg2, 3 <= arg1 + arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate