NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((0 + n^0) <= 0) /\ (undef5 = 0) /\ (undef3 = undef3), par{R^0 -> 0, dobreak^0 -> undef3}>
<l1, l3, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}>
<l3, l1, true>
<l2, l1, ((0 + dobreak^0) <= 0) /\ (undef18 = 1), par{A^0 -> 0}>
<l4, l2, (undef21 = undef21) /\ (undef22 = undef22), par{A^0 -> 0, R^0 -> 0, dobreak^0 -> undef21, n^0 -> undef22}>
<l5, l4, true>

Fresh variables:
undef3, undef5, undef18, undef21, undef22, 

Undef variables:
undef3, undef5, undef18, undef21, undef22, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (n^0 = undef22) /\ (undef21 = undef21) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef18 = 1)>
<l1, l1, ((0 + n^0) <= 0) /\ (undef5 = 0) /\ (undef3 = undef3) /\ ((0 + undef3) <= 0) /\ (undef18 = 1)>
<l1, l1, (1 <= (0 + n^0)), par{n^0 -> (~(1) + n^0)}>

Fresh variables:
undef3, undef5, undef18, undef21, undef22, 

Undef variables:
undef3, undef5, undef18, undef21, undef22, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, n^0 <= 0 /\ undef3 <= 0 /\ undef5 = 0 /\ undef18 = 1, {all remain the same}>
<l1, l1, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}>
Variables:
n^0

Precedence: 
Graph 0

Graph 1
<l0, l1, undef21 <= 0 /\ n^0 = undef22 /\ undef18 = 1, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000396s
Ranking function: -1 + n^0
New Graphs: 
Transitions:
<l1, l1, n^0 <= 0 /\ undef3 <= 0 /\ undef5 = 0 /\ undef18 = 1, {all remain the same}>
Variables:
n^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, undef21 <= 0 /\ n^0 = undef22 /\ undef18 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, undef21 <= 0 /\ n^0 = undef22 /\ undef18 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l1, l1, n^0 <= 0 /\ undef3 <= 0 /\ undef5 = 0 /\ undef18 = 1, {all remain the same}>
<l1, l1, 1 <= n^0, {n^0 -> -1 + n^0, rest remain the same}>
Variables:
n^0

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

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

Calling reachability with...
Transition: <l0, l1, undef21 <= 0 /\ n^0 = undef22 /\ undef18 = 1, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l1, undef21 <= 0 /\ n^0 = undef22 /\ undef18 = 1, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate