NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (0 + undef10), ___cil_tmp4_8^0 -> undef10, ___retres3_7^0 -> undef12}> ((0 + (~(1) * d_6^0)) + i_5^0)}> (0 + undef31), ___cil_tmp4_8^0 -> undef31, ___retres3_7^0 -> undef33}> (0 + undef44), ___cil_tmp2_10^0 -> undef44, ___retres1_9^0 -> undef46}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + (~(1) * d_6^0)) + i_5^0)}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002065 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000626s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000931s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002636s Time used: 0.002546 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003889s Time used: 0.003662 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007642s Time used: 0.00764 LOG: SAT solveNonLinear - Elapsed time: 0.011531s Cost: 1; Total time: 0.011302 Failed at location 3: 1 + i_5^0 <= 0 Before Improving: Quasi-invariant at l3: 1 + i_5^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001191s Remaining time after improvement: 0.999297 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + i_5^0 <= 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: -d_6^0 + i_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -d_6^0 + i_5^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + i_5^0 <= 0 and entry LOG: CALL check - Post:1 + i_5^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + i_5^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000181s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000209s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + i_5^0 <= 0 , Narrowing transition: -d_6^0 + i_5^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000366s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001722s Time used: 0.001658 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003100s Time used: 0.002962 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001754s Time used: 4.00157 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003344s Time used: 1.00031 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005601s Time used: 0.003423 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005819s Time used: 0.005818 LOG: SAT solveNonLinear - Elapsed time: 0.011421s Cost: 1; Total time: 0.009241 Termination implied by a set of invariant(s): Invariant at l3: 1 + d_6^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000258s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000904s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003060s Time used: 0.002984 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003074s Time used: 4.00289 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005345s Time used: 4.00117 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003119s Time used: 1.0005 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006454s Time used: 0.00425 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005602s Time used: 0.0056 LOG: SAT solveNonLinear - Elapsed time: 0.012057s Cost: 1; Total time: 0.00985 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + i_5^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 - d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000312s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001177s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003788s Time used: 0.003699 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002355s Time used: 4.00217 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005661s Time used: 4.00117 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003551s Time used: 1.00067 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006848s Time used: 0.004729 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005096s Time used: 0.005095 LOG: SAT solveNonLinear - Elapsed time: 0.011944s Cost: 1; Total time: 0.009824 Quasi-ranking function: 50000 + d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000371s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001397s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003289s Time used: 0.003199 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002686s Time used: 4.0025 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006112s Time used: 4.0017 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003759s Time used: 1.00086 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006629s Time used: 0.004783 Proving non-termination of subgraph 1 Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002512s Time used: 0.002443 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008265s Time used: 0.008084 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007338s Time used: 0.007337 LOG: SAT solveNonLinear - Elapsed time: 0.015603s Cost: 1; Total time: 0.015421 Failed at location 3: 1 <= i_5^0 Before Improving: Quasi-invariant at l3: 1 <= i_5^0 Quasi-invariant at l3: d_6^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002041s Remaining time after improvement: 0.999181 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= i_5^0 Quasi-invariant at l3: d_6^0 <= 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): -d_6^0 + i_5^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= i_5^0, d_6^0 <= 0, OPEN EXITS: (condsUp: d_6^0 <= 0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= i_5^0, d_6^0 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate