YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, true>
<l2, l3, ((0 + x_13^0) <= 0), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l4, (1 <= (0 + x_13^0)) /\ (undef22 = undef22) /\ (undef17 = (0 + undef22)) /\ (undef15 = undef15) /\ (0 <= (0 + undef17)) /\ ((0 + undef17) <= 0) /\ (undef21 = (~(1) + y_17^0)) /\ (undef19 = undef19) /\ (2 <= (0 + undef21)), par{nd_12^0 -> undef15, rv_15^0 -> undef17, st_16^0 -> undef19, y_17^0 -> undef21}>
<l4, l2, true>
<l2, l5, (1 <= (0 + x_13^0)) /\ (undef37 = undef37) /\ (undef30 = undef30), par{nd_12^0 -> undef30, rv_15^0 -> (0 + undef37)}>
<l5, l6, (1 <= (0 + rv_15^0))>
<l5, l6, ((1 + rv_15^0) <= 0)>
<l6, l7, (undef59 = undef59) /\ (undef52 = undef52), par{nd_12^0 -> undef52, x_13^0 -> (~(1) + x_13^0), y_17^0 -> (0 + undef59)}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef15, undef17, undef19, undef21, undef22, undef30, undef37, undef52, undef59, 

Undef variables:
undef15, undef17, undef19, undef21, undef22, undef30, undef37, undef52, undef59, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + x_13^0) <= 0)>
<l2, l2, (1 <= (0 + x_13^0)) /\ (undef22 = undef22) /\ (undef17 = (0 + undef22)) /\ (undef15 = undef15) /\ (0 <= (0 + undef17)) /\ ((0 + undef17) <= 0) /\ (undef21 = (~(1) + y_17^0)) /\ (undef19 = undef19) /\ (2 <= (0 + undef21)), par{y_17^0 -> undef21}>
<l2, l2, (1 <= (0 + x_13^0)) /\ (undef37 = undef37) /\ (undef30 = undef30) /\ (1 <= (0 + (0 + undef37))) /\ (undef59 = undef59) /\ (undef52 = undef52), par{x_13^0 -> (~(1) + x_13^0), y_17^0 -> (0 + undef59)}>
<l2, l2, (1 <= (0 + x_13^0)) /\ (undef37 = undef37) /\ (undef30 = undef30) /\ ((1 + (0 + undef37)) <= 0) /\ (undef59 = undef59) /\ (undef52 = undef52), par{x_13^0 -> (~(1) + x_13^0), y_17^0 -> (0 + undef59)}>

Fresh variables:
undef15, undef17, undef19, undef21, undef22, undef30, undef37, undef52, undef59, 

Undef variables:
undef15, undef17, undef19, undef21, undef22, undef30, undef37, undef52, undef59, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_13^0 /\ 2 <= undef21 /\ undef17 = 0 /\ undef17 = undef22 /\ y_17^0 = 1 + undef21, {y_17^0 -> undef21, rest remain the same}>
<l2, l2, 1 <= x_13^0 /\ 1 <= undef37, {x_13^0 -> -1 + x_13^0, y_17^0 -> undef59, rest remain the same}>
<l2, l2, 1 <= x_13^0 /\ 1 + undef37 <= 0, {x_13^0 -> -1 + x_13^0, y_17^0 -> undef59, rest remain the same}>
Variables:
x_13^0, y_17^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, x_13^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000901s
Ranking function: -1 + x_13^0
New Graphs: 
Transitions:
<l2, l2, 1 <= x_13^0 /\ 2 <= undef21 /\ undef17 = 0 /\ undef17 = undef22 /\ y_17^0 = 1 + undef21, {y_17^0 -> undef21, rest remain the same}>
Variables:
x_13^0, y_17^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000430s
Ranking function: -3 + y_17^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l3}...
No cycles found.

Program Terminates