NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > 4), par{arg1 -> arg2, arg2 -> undef2}> (~(1) * arg2)) /\ (arg2 > ~(1)) /\ (arg2 < 5) /\ (arg1 > 0), par{arg1 -> (~(1) * arg2), arg2 -> undef4}> (arg1 - 1), arg2 -> undef6}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > 4), par{arg1 -> undef10}> (~(1) * undef10)) /\ (undef10 > ~(1)) /\ (undef10 < 5) /\ (undef9 > 0), par{arg1 -> (~(1) * undef10)}> (arg1 - 1)}> 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, 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}> -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef10, rest remain the same}> -undef10, rest remain the same}> 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.003063 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000796s Ranking function: -1 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000378s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001117s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003674s Time used: 0.003551 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009828s Time used: 0.009523 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000367s Time used: 1.00027 LOG: SAT solveNonLinear - Elapsed time: 1.010194s Cost: 1; Total time: 1.00979 Failed at location 2: 0 <= arg1 Before Improving: Quasi-invariant at l2: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005911s Remaining time after improvement: 0.99895 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= 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, 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}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 0 <= arg1 and entry -undef10, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 1 * Exit transition: -undef10, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000395s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000491s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000383s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001133s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003514s Time used: 0.00339 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003160s Time used: 4.00163 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007369s Time used: 4.00127 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.042788s Time used: 1.00063 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008795s Time used: 0.005151 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002584s Time used: 1.00061 LOG: SAT solveNonLinear - Elapsed time: 1.011380s Cost: 1; Total time: 1.00576 Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000437s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001312s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003778s Time used: 0.003651 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012642s Time used: 4.00343 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007294s Time used: 4.00141 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.042976s Time used: 1.00085 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012161s Time used: 4.00178 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003910s Time used: 0.003749 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004510s Time used: 0.004504 LOG: SAT solveNonLinear - Elapsed time: 0.008420s Cost: 2; Total time: 0.008253 Failed at location 2: 1 + arg1 <= 0 Failed at location 2: 1 + arg1 <= 0 Before Improving: Quasi-invariant at l2: 1 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001371s Remaining time after improvement: 0.999041 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg1 <= 0 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, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef10, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef10, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef10, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef10, rest remain the same}> Conditions: 1 + arg1 <= 0, OPEN EXITS: -undef10, rest remain the same}> -undef10, rest remain the same}> > Conditions are reachable! Program does NOT terminate