NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, true, par{r^0 -> (0 + p^0)}>
<l1, l2, true, par{q^0 -> (0 + p^0)}>
<l3, l4, ((0 + q^0) <= (1 + r^0))>
<l3, l1, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{p^0 -> undef14}>
<l2, l3, true>
<l5, l2, true, par{q^0 -> (0 + N^0), r^0 -> 1}>
<l6, l5, true>

Fresh variables:
undef14, 

Undef variables:
undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (q^0 = (0 + N^0)) /\ (r^0 = 1)>
<l2, l4, ((0 + q^0) <= (1 + r^0))>
<l2, l2, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{r^0 -> (0 + undef14)}>
<l2, l2, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{q^0 -> (0 + undef14)}>

Fresh variables:
undef14, 

Undef variables:
undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Variables:
q^0, r^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, N^0 = q^0 /\ r^0 = 1, {all remain the same}>

Graph 2
<l2, l4, q^0 <= 1 + r^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.003221

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000945s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003341s
Trying to remove transition: <l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007324s
Time used: 0.007115
Trying to remove transition: <l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040335s
Time used: 0.040327

LOG: SAT solveNonLinear - Elapsed time: 0.055399s
Cost: 1; Total time: 0.054825
Failed at location 2: q^0 <= 1 + r^0
Before Improving: 
Quasi-invariant at l2: q^0 <= 1 + r^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004737s
Remaining time after improvement: 0.998599
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: q^0 <= 1 + r^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: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, 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: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000673s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: q^0 <= 1 + r^0 , 
Narrowing transition: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Variables:
q^0, r^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000902s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003417s
Trying to remove transition: <l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006405s
Time used: 0.006237
Trying to remove transition: <l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021729s
Time used: 0.012846

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Variables:
q^0, r^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035878s
Time used: 0.03587

LOG: SAT solveNonLinear - Elapsed time: 0.065467s
Cost: 1; Total time: 0.065231
Failed at location 2: 2 + r^0 <= q^0
Before Improving: 
Quasi-invariant at l2: 2 + r^0 <= q^0
Optimizing invariants...

LOG: CALL solveLinear

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

LOG: CALL solveNonLinear

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

LOG: CALL solverLinear in Graph for feasibility

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

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

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

Calling reachability with...
Transition: <l0, l2, N^0 = q^0 /\ r^0 = 1, {all remain the same}>
Conditions: 2 + r^0 <= q^0, 
OPEN EXITS: 
<l0, l2, 2 + r^0 <= q^0 /\ N^0 = q^0 /\ r^0 = 1, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate