NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 19), par{arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> undef8}> 10), par{arg1 -> (arg1 + 1), arg2 -> undef10}> 39), par{arg1 -> (arg1 + 1), arg2 -> undef12}> 28), par{arg2 -> undef14}> undef15, arg2 -> undef16}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef16 > ~(1))> 19) /\ (arg1 < 29) /\ (arg1 > 10), par{arg1 -> (arg1 + 1)}> 19) /\ (arg1 > 39), par{arg1 -> (arg1 + 1)}> 19) /\ (arg1 < 40) /\ (arg1 > 28)> 0) /\ ((arg1 - 1) < 30) /\ ((arg1 - 1) < 11), par{arg1 -> (arg1 - 1)}> 0) /\ ((arg1 - 1) < 29) /\ ((arg1 - 1) > 10), par{arg1 -> ((arg1 - 1) + 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, Undef variables: undef2, undef4, undef6, undef8, undef10, undef12, undef14, undef15, undef16, 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}> -1 + arg1, rest remain the same}> Variables: arg1 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.00782 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001286s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039415s Piecewise ranking function: min(370,-37 + 37*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001027s Ranking function: 98 - 2*arg1 New Graphs: Transitions: Variables: arg1 > No variable changes in termination graph. Checking conditional unfeasibility... Calling Safety with literal 40 <= arg1 and entry LOG: CALL check - Post:40 <= arg1 - Process 1 * Exit transition: * Postcondition : 40 <= arg1 Quasi-invariants: Location 2: 40 <= arg1 ; Postcondition: 40 <= arg1 LOG: CALL check - Post:40 <= arg1 - Process 2 * Exit transition: * Postcondition : 40 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000507s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000601s LOG: NarrowEntry size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> END GRAPH: EXIT: POST: 40 <= arg1 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009205s Time used: 0.009004 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000676s Time used: 1.00058 LOG: SAT solveNonLinear - Elapsed time: 1.009881s Cost: 51; Total time: 1.00959 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.007283s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001750s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001735s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001743s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001741s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001733s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001746s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001736s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001739s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001727s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001322s Remaining time after improvement: 0.982804 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 19 LOG: NEXT CALL check - disable LOG: CALL check - Post:arg1 <= 19 - Process 3 * Exit transition: * Postcondition : arg1 <= 19 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000658s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000761s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033366s Time used: 0.033079 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000518s Time used: 1.00042 LOG: SAT solveNonLinear - Elapsed time: 1.033884s Cost: 51; Total time: 1.0335 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.014074s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002510s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002361s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002354s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002363s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002339s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002349s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002347s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002325s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001788s Remaining time after improvement: 0.978352 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 9 LOG: NEXT CALL check - disable LOG: CALL check - Post:arg1 <= 9 - Process 4 * Exit transition: * Postcondition : arg1 <= 9 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000769s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000879s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086027s Time used: 0.085635 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.914932s Time used: 0.914835 LOG: SAT solveNonLinear - Elapsed time: 1.000960s Cost: 51; Total time: 1.00047 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: 0 <= arg1 Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034383s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003318s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003104s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003048s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003077s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003118s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003066s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003042s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003071s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002342s Remaining time after improvement: 0.971389 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg1 Quasi-invariant at l2: arg1 <= 9 LOG: NEXT CALL check - disable LOG: CALL check - Post:arg1 <= 9 - Process 5 * Exit transition: * Postcondition : arg1 <= 9 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000872s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000987s LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.186112s Proving non-termination of subgraph 1 Transitions: 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> -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.010455s Time used: 0.010233 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015339s Time used: 0.015331 LOG: SAT solveNonLinear - Elapsed time: 0.025794s Cost: 2; Total time: 0.025564 Failed at location 2: arg1 <= 1 Before Improving: Quasi-invariant at l2: arg1 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005676s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002386s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002370s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002349s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002337s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002332s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002333s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002339s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002321s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001598s Remaining time after improvement: 0.978794 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 19 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 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 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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): Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013739s Time used: 0.01355 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007439s Time used: 0.007433 LOG: SAT solveNonLinear - Elapsed time: 0.021179s Cost: 1; Total time: 0.020983 Failed at location 2: 12 <= arg1 Before Improving: Quasi-invariant at l2: 12 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001942s Remaining time after improvement: 0.999044 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 12 <= arg1 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 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): Calling reachability with... Transition: Conditions: arg1 <= 19, 12 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: arg1 <= 19, 12 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate