NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef3}> 1}> (0 + ret_f19^0)}> (0 + ret28^0)}> 0}> (0 + ret17^0)}> (~(1) + i6^0)}> (0 + undef164), ret17^0 -> (0 + undef161), ret_f212^0 -> undef161, val10^0 -> undef164}> (0 + undef176), ret28^0 -> (0 + undef173), ret_f215^0 -> undef173, val13^0 -> undef176}> Fresh variables: undef3, undef161, undef164, undef173, undef176, Undef variables: undef3, undef161, undef164, undef173, undef176, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef3}> (~(1) + i6^0)}> (~(1) + i6^0)}> Fresh variables: undef3, undef161, undef164, undef173, undef176, Undef variables: undef3, undef161, undef164, undef173, undef176, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + i6^0, rest remain the same}> -1 + i6^0, rest remain the same}> Variables: i6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef3, rest remain the same}> Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002494 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001022s Ranking function: 1 + i6^0 New Graphs: Transitions: -1 + i6^0, rest remain the same}> Variables: i6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000426s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001511s Trying to remove transition: -1 + i6^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003855s Time used: 0.003723 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005872s Time used: 0.00561 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015864s Time used: 0.015859 LOG: SAT solveNonLinear - Elapsed time: 0.021736s Cost: 1; Total time: 0.021469 Failed at location 2: 0 <= i6^0 Before Improving: Quasi-invariant at l2: 0 <= i6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002108s Remaining time after improvement: 0.999096 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= i6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + i6^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + i6^0, rest remain the same}> New Graphs: Calling Safety with literal 0 <= i6^0 and entry undef3, rest remain the same}> LOG: CALL check - Post:0 <= i6^0 - Process 1 * Exit transition: undef3, rest remain the same}> * Postcondition : 0 <= i6^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000344s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000412s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= i6^0 , It's unfeasible. Removing transition: -1 + i6^0, rest remain the same}> Narrowing transition: -1 + i6^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + i6^0, rest remain the same}> Variables: i6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000429s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001521s Trying to remove transition: -1 + i6^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003638s Time used: 0.00351 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001130s Time used: 4.0008 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005433s Time used: 4.00077 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005694s Time used: 1.00062 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008443s Time used: 0.005636 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013550s Time used: 0.013545 LOG: SAT solveNonLinear - Elapsed time: 0.021994s Cost: 1; Total time: 0.019181 Quasi-ranking function: 50000 + i6^0 New Graphs: Transitions: -1 + i6^0, rest remain the same}> Variables: i6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000463s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001619s Trying to remove transition: -1 + i6^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004223s Time used: 0.00409 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001288s Time used: 4.001 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004916s Time used: 4.00078 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006034s Time used: 1.00076 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008310s Time used: 0.0053 Proving non-termination of subgraph 1 Transitions: -1 + i6^0, rest remain the same}> Variables: i6^0 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006471s Time used: 0.006303 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011438s Time used: 0.011432 LOG: SAT solveNonLinear - Elapsed time: 0.017909s Cost: 1; Total time: 0.017735 Failed at location 2: 1 + i6^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + i6^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002988s Remaining time after improvement: 0.999112 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002122s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + i6^0 <= 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 + i6^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + i6^0 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef3, rest remain the same}> Conditions: 1 + i6^0 <= 0, OPEN EXITS: undef3, rest remain the same}> > Conditions are reachable! Program does NOT terminate