NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, true, par{j^0 -> (0 + i^0)}>
<l2, l3, true, par{i^0 -> (1 + i^0)}>
<l4, l1, ((1 + __const_5^0) <= (0 + i^0))>
<l4, l1, ((1 + i^0) <= (0 + __const_5^0))>
<l4, l2, ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> undef19}>
<l5, l6, ((0 + __const_10^0) <= (0 + i^0))>
<l5, l4, ((1 + i^0) <= (0 + __const_10^0))>
<l3, l5, true>
<l7, l3, true, par{i^0 -> 0}>
<l8, l7, true>

Fresh variables:
undef19, 

Undef variables:
undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 0)>
<l3, l6, ((0 + __const_10^0) <= (0 + i^0))>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + __const_5^0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((1 + i^0) <= (0 + __const_5^0)), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= (0 + __const_10^0)) /\ ((0 + i^0) <= (0 + __const_5^0)) /\ ((0 + __const_5^0) <= (0 + i^0)) /\ (undef19 = undef19), par{i^0 -> (1 + undef19)}>

Fresh variables:
undef19, 

Undef variables:
undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i^0 = 0, {all remain the same}>

Graph 2
<l3, l6, __const_10^0 <= i^0, {all remain the same}>

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001474s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009044s
Piecewise ranking function: min(-5 + 6*__const_10^0 - 2*__const_5^0 - 4*i^0,-5 + 6*__const_10^0 - 6*__const_5^0)
New Graphs: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000930s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004465s
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009415s
Time used: 0.009143
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020542s
Time used: 0.019806
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043597s
Time used: 0.043595

LOG: SAT solveNonLinear - Elapsed time: 0.064139s
Cost: 1; Total time: 0.063401
Failed at location 3: 1 + __const_5^0 <= i^0
Before Improving: 
Quasi-invariant at l3: 1 + __const_5^0 <= i^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007173s
Remaining time after improvement: 0.997884
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + __const_5^0 <= i^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + __const_5^0 <= i^0 and entry <l0, l3, i^0 = 0, {all remain the same}>

LOG: CALL check - Post:1 + __const_5^0 <= i^0 - Process 1
* Exit transition: <l0, l3, i^0 = 0, {all remain the same}>
* Postcondition  : 1 + __const_5^0 <= i^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000552s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + __const_5^0 <= i^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000979s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004541s
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008598s
Time used: 0.008326
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018358s
Time used: 0.017514
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030795s
Time used: 0.030791

LOG: SAT solveNonLinear - Elapsed time: 0.049154s
Cost: 1; Total time: 0.048305
Failed at location 3: __const_10^0 <= i^0
Before Improving: 
Quasi-invariant at l3: __const_10^0 <= i^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006084s
Remaining time after improvement: 0.998041
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: __const_10^0 <= i^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: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
New Graphs: 
Calling Safety with literal __const_10^0 <= i^0 and entry <l0, l3, i^0 <= __const_5^0 /\ i^0 = 0, {all remain the same}>

LOG: CALL check - Post:__const_10^0 <= i^0 - Process 2
* Exit transition: <l0, l3, i^0 <= __const_5^0 /\ i^0 = 0, {all remain the same}>
* Postcondition  : __const_10^0 <= i^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000761s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: __const_10^0 <= i^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001016s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004570s
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008647s
Time used: 0.008443
Trying to remove transition: <l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020184s
Time used: 0.019295
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041258s
Time used: 0.041256

LOG: SAT solveNonLinear - Elapsed time: 0.061442s
Cost: 1; Total time: 0.060551
Failed at location 3: __const_10^0 <= __const_5^0
Before Improving: 
Quasi-invariant at l3: __const_10^0 <= __const_5^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006242s
Remaining time after improvement: 0.997963
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: __const_10^0 <= __const_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): 
<l3, l3, __const_10^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, 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): 
<l3, l3, __const_10^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
New Graphs: 
Transitions:
<l3, l3, __const_10^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001001s
Ranking function: -1 + __const_10^0 - i^0
New Graphs: 
Calling Safety with literal __const_10^0 <= __const_5^0 and entry <l0, l3, i^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ i^0 = 0, {all remain the same}>

LOG: CALL check - Post:__const_10^0 <= __const_5^0 - Process 3
* Exit transition: <l0, l3, i^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ i^0 = 0, {all remain the same}>
* Postcondition  : __const_10^0 <= __const_5^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000716s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: __const_10^0 <= __const_5^0 , 
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001182s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005153s
Trying to remove transition: <l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008823s
Time used: 0.008572
Trying to remove transition: <l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026658s
Time used: 0.015772

Proving non-termination of subgraph 1
Transitions:
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>
Variables:
__const_10^0, __const_5^0, i^0

Checking conditional non-termination of SCC {l3}...
EXIT TRANSITIONS:
<l3, end, 1 + __const_5^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {all remain the same}>
<l3, end, __const_10^0 <= __const_5^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {all remain the same}>
<l3, end, __const_10^0 <= __const_5^0 /\ __const_10^0 <= i^0 /\ 1 + i^0 <= __const_5^0, {all remain the same}>
<l3, end, __const_10^0 <= __const_5^0 /\ __const_10^0 <= i^0 /\ __const_5^0 <= i^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026121s
Time used: 0.025846
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033702s
Time used: 0.033698

LOG: SAT solveNonLinear - Elapsed time: 0.059823s
Cost: 3; Total time: 0.059544
Failed at location 3: 1 + __const_5^0 <= __const_10^0
Before Improving: 
Quasi-invariant at l3: 1 + __const_5^0 <= __const_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008316s
Remaining time after improvement: 0.997996
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.004305s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + __const_5^0 <= __const_10^0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 3
Strengthening exit transition (result): 
<l3, end, 1 + __const_5^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

Checking conditional non-termination of SCC {l3}...
EXIT TRANSITIONS:
<l3, end, 1 + __const_5^0 <= __const_10^0 /\ 1 + __const_5^0 <= i^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013835s
Time used: 0.013609
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018137s
Time used: 0.018132

LOG: SAT solveNonLinear - Elapsed time: 0.031972s
Cost: 1; Total time: 0.031741
Failed at location 3: i^0 <= __const_5^0
Before Improving: 
Quasi-invariant at l3: i^0 <= __const_5^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006149s
Remaining time after improvement: 0.998376
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.003594s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: i^0 <= __const_5^0
Constraint over undef '1 + undef19 <= __const_5^0' in transition:
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

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): 
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + i^0 <= __const_5^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + __const_5^0 <= __const_10^0 /\ 1 + i^0 <= __const_10^0 /\ 1 + undef19 <= __const_5^0 /\ __const_5^0 = i^0, {i^0 -> 1 + undef19, rest remain the same}>

Calling reachability with...
Transition: <l3, end, true, {all remain the same}>
Conditions: 1 + __const_5^0 <= __const_10^0, i^0 <= __const_5^0, 
OPEN EXITS: 
<l3, end, i^0 <= __const_5^0, {all remain the same}> (condsUp: 1 + __const_5^0 <= __const_10^0)

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

Calling reachability with...
Transition: <l0, l3, i^0 = 0, {all remain the same}>
Conditions: i^0 <= __const_5^0, 1 + __const_5^0 <= __const_10^0, 
OPEN EXITS: 
<l0, l3, i^0 <= __const_5^0 /\ 1 + __const_5^0 <= __const_10^0 /\ i^0 = 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate