NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef2}> undef6}> 0, lo^0 -> (0 + __const_99^0)}> Fresh variables: undef2, undef6, Undef variables: undef2, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef2}> undef6}> Fresh variables: undef2, undef6, Undef variables: undef2, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef2, rest remain the same}> undef6, rest remain the same}> Variables: hi^0, lo^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 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.003541 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000892s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003162s Trying to remove transition: undef6, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007138s Time used: 0.006916 Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006128s Time used: 0.005677 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013627s Time used: 0.013102 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041427s Time used: 0.04142 LOG: SAT solveNonLinear - Elapsed time: 0.055054s Cost: 1; Total time: 0.054522 Failed at location 2: lo^0 <= hi^0 Before Improving: Quasi-invariant at l2: lo^0 <= hi^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004730s Remaining time after improvement: 0.998531 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: lo^0 <= hi^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: undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef6, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef6, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef2, rest remain the same}> New Graphs: Calling Safety with literal lo^0 <= hi^0 and entry LOG: CALL check - Post:lo^0 <= hi^0 - Process 1 * Exit transition: * Postcondition : lo^0 <= hi^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000565s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000659s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: lo^0 <= hi^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef6, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> undef6, rest remain the same}> Variables: hi^0, lo^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000808s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003228s Trying to remove transition: undef6, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006124s Time used: 0.005957 Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006242s Time used: 0.00574 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011005s Time used: 0.010498 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001603s Time used: 4.00101 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021705s Time used: 1.006 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018980s Time used: 0.010253 Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> undef6, rest remain the same}> Variables: hi^0, lo^0 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014102s Time used: 0.013893 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022319s Time used: 0.022311 LOG: SAT solveNonLinear - Elapsed time: 0.036421s Cost: 1; Total time: 0.036204 Failed at location 2: 1 + hi^0 <= lo^0 Before Improving: Quasi-invariant at l2: 1 + hi^0 <= lo^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007583s Remaining time after improvement: 0.99857 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002744s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + hi^0 <= lo^0 Constraint over undef '1 + undef2 <= lo^0' in transition: undef2, rest remain the same}> Constraint over undef 'lo^0 <= undef6' in transition: undef6, rest remain the same}> 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): undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef6, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + hi^0 <= lo^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + hi^0 <= lo^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate