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.002054 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000799s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001335s 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.002559s Time used: 0.002432 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003607s Time used: 0.003396 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007947s Time used: 0.007946 LOG: SAT solveNonLinear - Elapsed time: 0.011554s Cost: 1; Total time: 0.011342 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.001194s Remaining time after improvement: 0.999299 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.000174s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000202s 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.000360s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000666s 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.001724s Time used: 0.00166 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003086s Time used: 0.002953 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002270s Time used: 4.00183 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003481s Time used: 1.00031 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005701s Time used: 0.003515 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005854s Time used: 0.005853 LOG: SAT solveNonLinear - Elapsed time: 0.011555s Cost: 1; Total time: 0.009368 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.000260s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000914s 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.003080s Time used: 0.003006 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002657s Time used: 4.00223 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005071s Time used: 4.00097 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003441s Time used: 1.00051 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006471s Time used: 0.004277 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005580s Time used: 0.005578 LOG: SAT solveNonLinear - Elapsed time: 0.012051s Cost: 1; Total time: 0.009855 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.000316s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001176s 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.003833s Time used: 0.003749 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002694s Time used: 4.00226 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005730s Time used: 4.00131 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003611s Time used: 1.00066 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006830s Time used: 0.004691 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.005105s Time used: 0.005102 LOG: SAT solveNonLinear - Elapsed time: 0.011935s Cost: 1; Total time: 0.009793 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.000364s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001405s 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.003315s Time used: 0.003227 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002550s Time used: 4.00211 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006879s Time used: 4.00214 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003925s Time used: 1.0009 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006543s Time used: 0.004709 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.002522s Time used: 0.002446 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008240s Time used: 0.008052 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007455s Time used: 0.007454 LOG: SAT solveNonLinear - Elapsed time: 0.015696s Cost: 1; Total time: 0.015506 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.002053s Remaining time after improvement: 0.999165 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