NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, ((1 + o^0) <= (0 + n^0))>
<l1, l3, ((0 + n^0) <= (0 + o^0))>
<l4, l1, ((0 + n^0) <= (0 + n^0))>
<l4, l1, true, par{L^0 -> 0, n^0 -> (1 + n^0)}>
<l2, l5, ((0 + L^0) <= 1) /\ (1 <= (0 + L^0))>
<l2, l4, true, par{L^0 -> 1, o^0 -> (0 + n^0)}>
<l6, l2, true, par{L^0 -> 0}>
<l7, l6, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (L^0 = 0)>
<l2, l5, ((0 + L^0) <= 1) /\ (1 <= (0 + L^0))>
<l2, l3, ((0 + n^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + (0 + n^0))), par{L^0 -> 1}>
<l2, l2, ((1 + (0 + n^0)) <= (0 + (1 + n^0))), par{L^0 -> 0, n^0 -> (1 + n^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, true, {L^0 -> 0, n^0 -> 1 + n^0, rest remain the same}>
Variables:
n^0

Graph 2:
Transitions:
Variables:

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, L^0 = 0, {all remain the same}>

Graph 2
<l2, l3, true, {L^0 -> 1, rest remain the same}>

Graph 3
<l2, l5, L^0 = 1, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 3 , 2 )
( 5 , 3 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.001278

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000457s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000833s
Trying to remove transition: <l2, l2, true, {L^0 -> 0, n^0 -> 1 + n^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004433s
Time used: 0.004432

LOG: SAT solveNonLinear - Elapsed time: 0.008138s
Cost: 1; Total time: 0.006682
Quasi-ranking function: 50000 - n^0
New Graphs: 
Transitions:
<l2, l2, 50001 <= n^0, {L^0 -> 0, n^0 -> 1 + n^0, rest remain the same}>
Variables:
n^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000201s

LOG: CALL solveLinear

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, true, {L^0 -> 0, n^0 -> 1 + n^0, rest remain the same}>
Variables:
n^0

Checking conditional non-termination of SCC {l2}...
> No exit transition to close.
Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l2, end, true, {all remain the same}>

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

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

> Conditions are reachable!

Program does NOT terminate