NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2}> 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}> 1) /\ ((arg2 + 1) >= (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}> 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> undef13, arg2 -> undef14}> Fresh variables: undef13, undef14, Undef variables: undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1))> 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}> 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}> 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef13, undef14, Undef variables: undef13, undef14, 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}> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> 1 + arg1, 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.012803 Some transition disabled by a set of invariant(s): Invariant at l2: arg2 <= 1 + arg1 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 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): 2 + 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 unfeasibility... Time used: 0.045611 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002100s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.312339s 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.255309s Time used: 0.254759 Trying to remove transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.040674s Time used: 1.03895 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: 2.271016s Time used: 2.26667 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059285s Time used: 0.054108 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.208389s Time used: 0.208357 LOG: SAT solveNonLinear - Elapsed time: 0.267674s Cost: 1; Total time: 0.262465 Failed at location 2: arg1 + arg2 <= 0 Before Improving: Quasi-invariant at l2: arg1 + arg2 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011721s Remaining time after improvement: 0.99658 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + 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: 2 + 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... 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: 2 + 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 arg1 + arg2 <= 0 and entry LOG: CALL check - Post:arg1 + arg2 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 + arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000856s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000966s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 2 + 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.002007s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.295306s 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.243475s Time used: 0.24284 Trying to remove transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.938873s Time used: 0.936708 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: 2.335972s Time used: 2.33142 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.604038s Time used: 0.598655 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.319915s Time used: 0.31987 LOG: SAT solveNonLinear - Elapsed time: 0.923953s Cost: 1; Total time: 0.918525 Failed at location 2: arg1 + 2*arg2 <= 3 Before Improving: Quasi-invariant at l2: arg1 + 2*arg2 <= 3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013937s Remaining time after improvement: 0.996063 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + 2*arg2 <= 3 [ 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 Strengthening transition (result): 2 + 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... 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): 2 + 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}> Ranking function: arg1 + 3*arg2 New Graphs: Calling Safety with literal arg1 + 2*arg2 <= 3 and entry LOG: CALL check - Post:arg1 + 2*arg2 <= 3 - Process 2 * Exit transition: * Postcondition : arg1 + 2*arg2 <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000687s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000804s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + 2*arg2 <= 3 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 2 + 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.002411s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.430181s 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.279817s Time used: 0.278605 Trying to remove transition: 2 + arg1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.041023s Time used: 2.03867 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: 2.514059s Time used: 2.50886 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005220s Time used: 4.00084 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010590s Time used: 4.00079 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010405s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.054842s Time used: 1.03555 Proving non-termination of subgraph 1 Transitions: -1 + arg1, arg2 -> -1 + arg2, rest remain the same}> 2 + 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.040669s Time used: 0.040139 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001140s Time used: 1.00101 LOG: SAT solveNonLinear - Elapsed time: 1.041810s Cost: 3; Total time: 1.04115 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.013512s Remaining time after improvement: 0.995642 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: 9 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 Strengthening transition (result): 2 + 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.052894s Time used: 0.052583 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015129s Time used: 0.015121 LOG: SAT solveNonLinear - Elapsed time: 0.068023s Cost: 1; Total time: 0.067704 Failed at location 2: 3 <= arg1 + arg2 Before Improving: Quasi-invariant at l2: 3 <= arg1 + arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005207s Remaining time after improvement: 0.997218 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 3 <= arg1 + arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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): 2 + 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}> Calling reachability with... Transition: Conditions: 1 <= arg2, 3 <= arg1 + arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg2, 3 <= arg1 + arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate