YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, true>
<l1, l2, (undef3 = (0 + x0^0)) /\ (undef5 = undef5), par{oldX0^0 -> undef3, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef5, x0^0 -> (1 + undef3), x1^0 -> (0 + undef5)}>
<l3, l4, (undef11 = (0 + x0^0)) /\ (undef12 = (0 + x1^0)), par{oldX0^0 -> undef11, oldX1^0 -> undef12, x0^0 -> (0 + undef11), x1^0 -> (1 + undef12)}>
<l5, l6, (undef21 = undef21) /\ (undef22 = undef22), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l4, l1, (undef27 = (0 + x0^0)) /\ (undef28 = (0 + x1^0)) /\ ((1 + __const_11^0) <= (0 + undef28)), par{oldX0^0 -> undef27, oldX1^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l4, l3, (undef35 = (0 + x0^0)) /\ (undef36 = (0 + x1^0)) /\ ((0 + undef36) <= (0 + __const_11^0)), par{oldX0^0 -> undef35, oldX1^0 -> undef36, x0^0 -> (0 + undef35), x1^0 -> (0 + undef36)}>
<l2, l5, (undef43 = (0 + x0^0)) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)), par{oldX0^0 -> undef43, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, x0^0 -> (0 + undef43), x1^0 -> (0 + undef45)}>
<l2, l4, (undef51 = (0 + x0^0)) /\ ((0 + undef51) <= (0 + __const_9^0)), par{oldX0^0 -> undef51, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef51), x1^0 -> 3}>
<l7, l2, (undef61 = undef61), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef61, x0^0 -> 0, x1^0 -> (0 + undef61)}>
<l8, l7, (undef69 = undef69) /\ (undef70 = undef70), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef69, oldX3^0 -> undef70, x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l8, l6, true>
<l8, l1, true>
<l8, l3, true>
<l8, l5, true>
<l8, l4, true>
<l8, l2, true>
<l8, l7, true>
<l9, l8, true>

Fresh variables:
undef3, undef5, undef11, undef12, undef21, undef22, undef27, undef28, undef35, undef36, undef43, undef45, undef51, undef61, undef69, undef70, 

Undef variables:
undef3, undef5, undef11, undef12, undef21, undef22, undef27, undef28, undef35, undef36, undef43, undef45, undef51, undef61, undef69, undef70, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l6, (undef69 = undef69) /\ (undef70 = undef70) /\ (undef61 = undef61) /\ (undef43 = (0 + 0)) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l4, (undef69 = undef69) /\ (undef70 = undef70) /\ (undef61 = undef61) /\ (undef51 = (0 + 0)) /\ ((0 + undef51) <= (0 + __const_9^0)), par{x0^0 -> (0 + undef51), x1^0 -> 3}>
<l0, l6, true>
<l0, l6, (undef3 = (0 + x0^0)) /\ (undef5 = undef5) /\ (undef43 = (0 + (1 + undef3))) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l4, (undef3 = (0 + x0^0)) /\ (undef5 = undef5) /\ (undef51 = (0 + (1 + undef3))) /\ ((0 + undef51) <= (0 + __const_9^0)), par{x0^0 -> (0 + undef51), x1^0 -> 3}>
<l0, l4, (undef11 = (0 + x0^0)) /\ (undef12 = (0 + x1^0)), par{x0^0 -> (0 + undef11), x1^0 -> (1 + undef12)}>
<l0, l6, (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l4, true>
<l0, l6, (undef43 = (0 + x0^0)) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l4, (undef51 = (0 + x0^0)) /\ ((0 + undef51) <= (0 + __const_9^0)), par{x0^0 -> (0 + undef51), x1^0 -> 3}>
<l0, l6, (undef61 = undef61) /\ (undef43 = (0 + 0)) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l0, l4, (undef61 = undef61) /\ (undef51 = (0 + 0)) /\ ((0 + undef51) <= (0 + __const_9^0)), par{x0^0 -> (0 + undef51), x1^0 -> 3}>
<l4, l6, (undef27 = (0 + x0^0)) /\ (undef28 = (0 + x1^0)) /\ ((1 + __const_11^0) <= (0 + undef28)) /\ (undef3 = (0 + (0 + undef27))) /\ (undef5 = undef5) /\ (undef43 = (0 + (1 + undef3))) /\ (undef45 = undef45) /\ ((1 + __const_9^0) <= (0 + undef43)) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
<l4, l4, (undef27 = (0 + x0^0)) /\ (undef28 = (0 + x1^0)) /\ ((1 + __const_11^0) <= (0 + undef28)) /\ (undef3 = (0 + (0 + undef27))) /\ (undef5 = undef5) /\ (undef51 = (0 + (1 + undef3))) /\ ((0 + undef51) <= (0 + __const_9^0)), par{x0^0 -> (0 + undef51), x1^0 -> 3}>
<l4, l4, (undef35 = (0 + x0^0)) /\ (undef36 = (0 + x1^0)) /\ ((0 + undef36) <= (0 + __const_11^0)) /\ (undef11 = (0 + (0 + undef35))) /\ (undef12 = (0 + (0 + undef36))), par{x0^0 -> (0 + undef11), x1^0 -> (1 + undef12)}>

Fresh variables:
undef3, undef5, undef11, undef12, undef21, undef22, undef27, undef28, undef35, undef36, undef43, undef45, undef51, undef61, undef69, undef70, 

Undef variables:
undef3, undef5, undef11, undef12, undef21, undef22, undef27, undef28, undef35, undef36, undef43, undef45, undef51, undef61, undef69, undef70, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, undef51 <= __const_9^0 /\ 1 + __const_11^0 <= undef28 /\ x0^0 = undef27 /\ x1^0 = undef28 /\ undef3 = undef27 /\ 1 + undef3 = undef51, {x0^0 -> undef51, x1^0 -> 3, rest remain the same}>
<l4, l4, undef36 <= __const_11^0 /\ x0^0 = undef35 /\ x1^0 = undef36 /\ undef11 = undef35 /\ undef12 = undef36, {x0^0 -> undef11, x1^0 -> 1 + undef12, rest remain the same}>
Variables:
__const_11^0, __const_9^0, x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, undef51 <= __const_9^0 /\ undef51 = 0, {x0^0 -> undef51, x1^0 -> 3, rest remain the same}>
<l0, l4, undef51 <= __const_9^0 /\ x0^0 = undef3 /\ 1 + undef3 = undef51, {x0^0 -> undef51, x1^0 -> 3, rest remain the same}>
<l0, l4, x0^0 = undef11 /\ x1^0 = undef12, {x0^0 -> undef11, x1^0 -> 1 + undef12, rest remain the same}>
<l0, l4, true, {all remain the same}>
<l0, l4, undef51 <= __const_9^0 /\ x0^0 = undef51, {x0^0 -> undef51, x1^0 -> 3, rest remain the same}>
<l0, l4, undef51 <= __const_9^0 /\ undef51 = 0, {x0^0 -> undef51, x1^0 -> 3, rest remain the same}>

Graph 2
<l0, l6, 1 + __const_9^0 <= undef43 /\ undef43 = 0, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l6, true, {all remain the same}>
<l0, l6, 1 + __const_9^0 <= undef43 /\ x0^0 = undef3 /\ 1 + undef3 = undef43, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l6, true, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l6, 1 + __const_9^0 <= undef43 /\ x0^0 = undef43, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l0, l6, 1 + __const_9^0 <= undef43 /\ undef43 = 0, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
<l4, l6, 1 + __const_11^0 <= undef28 /\ 1 + __const_9^0 <= undef43 /\ x0^0 = undef27 /\ x1^0 = undef28 /\ undef3 = undef27 /\ 1 + undef3 = undef43, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 1 )
( 6 , 2 )

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001243s
Ranking function: -1 + 3*__const_9^0 - 3*x0^0
New Graphs: 
Transitions:
<l4, l4, undef36 <= __const_11^0 /\ x0^0 = undef35 /\ x1^0 = undef36 /\ undef11 = undef35 /\ undef12 = undef36, {x0^0 -> undef11, x1^0 -> 1 + undef12, rest remain the same}>
Variables:
__const_11^0, x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000536s
Ranking function: __const_11^0 - x1^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l6}...
No cycles found.

Program Terminates