NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, (undef1 = undef1), par{hi^0 -> undef1}>
<l1, l2, (undef4 = undef4), par{lo^0 -> undef4}>
<l3, l4, ((0 + lo^0) <= (0 + hi^0))>
<l3, l1, ((1 + hi^0) <= (0 + lo^0))>
<l2, l3, true>
<l5, l2, true, par{hi^0 -> 0, lo^0 -> 99}>
<l6, l5, true>

Fresh variables:
undef1, undef4, 

Undef variables:
undef1, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (hi^0 = 0) /\ (lo^0 = 99)>
<l2, l4, ((0 + lo^0) <= (0 + hi^0))>
<l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef1 = undef1), par{hi^0 -> undef1}>
<l2, l2, ((1 + hi^0) <= (0 + lo^0)) /\ (undef4 = undef4), par{lo^0 -> undef4}>

Fresh variables:
undef1, undef4, 

Undef variables:
undef1, undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
Variables:
hi^0, lo^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>

Graph 2
<l2, l4, lo^0 <= hi^0, {all remain the same}>

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.003606

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000886s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003134s
Trying to remove transition: <l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007078s
Time used: 0.006858
Trying to remove transition: <l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006097s
Time used: 0.005643
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012320s
Time used: 0.011862
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104763s
Time used: 4.10429
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038775s
Time used: 1.00112
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014969s
Time used: 0.010849
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001294s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001388s
Cannot prove unreachability

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, rest remain the same}>
Variables:
hi^0, lo^0

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, lo^0 <= hi^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013870s
Time used: 0.013766

LOG: SAT solveNonLinear - Elapsed time: 0.013870s
Cost: 0; Total time: 0.013766
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.003114s
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + hi^0 <= lo^0
Constraint over undef '1 + undef1 <= lo^0' in transition:
<l2, l2, 1 + hi^0 <= lo^0, {hi^0 -> undef1, rest remain the same}>
Constraint over undef '1 + hi^0 <= undef4' in transition:
<l2, l2, 1 + hi^0 <= lo^0, {lo^0 -> undef4, 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): 
<l2, l2, 1 + hi^0 <= lo^0 /\ 1 + undef1 <= lo^0, {hi^0 -> undef1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + hi^0 <= lo^0 /\ 1 + hi^0 <= undef4, {lo^0 -> undef4, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 1 + hi^0 <= lo^0, 
OPEN EXITS: 
<l2, end, 1 + hi^0 <= lo^0, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l2, hi^0 = 0 /\ lo^0 = 99, {all remain the same}>
Conditions: 1 + hi^0 <= lo^0, 
OPEN EXITS: 
<l0, l2, 1 + hi^0 <= lo^0 /\ hi^0 = 0 /\ lo^0 = 99, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate