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, (6 <= (0 + i^0))>
<l4, l1, ((1 + i^0) <= 5)>
<l4, l2, ((0 + i^0) <= 5) /\ (5 <= (0 + i^0)) /\ (undef9 = undef9), par{i^0 -> undef9}>
<l5, l6, (10 <= (0 + i^0))>
<l5, l4, ((1 + i^0) <= 10)>
<l3, l5, true>
<l7, l3, true, par{i^0 -> 0}>
<l8, l7, true>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 0)>
<l3, l6, (10 <= (0 + i^0))>
<l3, l3, ((1 + i^0) <= 10) /\ (6 <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= 10) /\ ((1 + i^0) <= 5), par{i^0 -> (1 + i^0)}>
<l3, l3, ((1 + i^0) <= 10) /\ ((0 + i^0) <= 5) /\ (5 <= (0 + i^0)) /\ (undef9 = undef9), par{i^0 -> (1 + undef9)}>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 6 <= i^0 /\ i^0 <= 9, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
Variables:
i^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l3, l6, 10 <= 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.010117

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001062s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003979s
Piecewise ranking function: min(117 - 13*i^0,52)
New Graphs: 
Transitions:
<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
Variables:
i^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000612s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002471s
Trying to remove transition: <l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041516s
Time used: 0.029479
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, i^0 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l3, l3, 6 <= i^0 /\ i^0 <= 9, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, i^0 <= 4, {i^0 -> 1 + i^0, rest remain the same}>
<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>
Variables:
i^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020368s
Time used: 0.020266

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

LOG: CALL solveNonLinear

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

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: i^0 <= 5
Constraint over undef 'undef9 <= 0' in transition:
<l3, l3, i^0 = 5, {i^0 -> 1 + undef9, 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
It's unfeasible. Removing transition: 
<l3, l3, 6 <= i^0 /\ i^0 <= 9, {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, i^0 <= 4, {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, undef9 <= 0 /\ i^0 = 5, {i^0 -> 1 + undef9, rest remain the same}>

Calling reachability with...
Transition: <l3, end, true, {all remain the same}>
Conditions: i^0 <= 5, 
OPEN EXITS: 
<l3, end, i^0 <= 5, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l3, i^0 = 0, {all remain the same}>
Conditions: i^0 <= 5, 
OPEN EXITS: 
<l0, l3, i^0 = 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate