NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> (arg1 - 1), arg2 -> undef12}> undef13, arg2 -> undef14}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef14 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef13 > 0) /\ (undef8 > ~(1)) /\ (undef14 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef13 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)> (arg1 - 1)}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, 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, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002025 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000424s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001123s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003846s Time used: 0.003724 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005129s Time used: 0.004863 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015420s Time used: 0.015414 LOG: SAT solveNonLinear - Elapsed time: 0.020549s Cost: 1; Total time: 0.020277 Failed at location 3: 0 <= arg1 Before Improving: Quasi-invariant at l3: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001562s Remaining time after improvement: 0.999243 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 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}> [ 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 LOG: CALL check - Post:0 <= arg1 - Process 1 * Exit transition: * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000609s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000759s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 0 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000382s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001122s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003466s Time used: 0.003336 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001323s Time used: 4.00094 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005790s Time used: 4.0007 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005767s Time used: 1.00049 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008808s Time used: 0.005638 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009149s Time used: 0.009107 LOG: SAT solveNonLinear - Elapsed time: 0.017957s Cost: 1; Total time: 0.014745 Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000400s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001231s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003598s Time used: 0.003471 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001453s Time used: 4.00106 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005936s Time used: 4.00071 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006042s Time used: 1.00079 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008714s Time used: 0.005544 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003783s Time used: 0.003613 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004856s Time used: 0.004851 LOG: SAT solveNonLinear - Elapsed time: 0.008639s Cost: 1; Total time: 0.008464 Failed at location 3: 1 + arg1 <= 0 Before Improving: Quasi-invariant at l3: 1 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001653s Remaining time after improvement: 0.998919 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + arg1 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l3: 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, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + arg1 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate