YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef5, oldX3^0 -> undef6, x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<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)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l4, l3, (undef27 = (0 + x0^0)) /\ (undef28 = (0 + x1^0)) /\ (0 <= (0 + undef28)), par{oldX0^0 -> undef27, oldX1^0 -> undef28, x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l5, l6, (undef35 = (0 + x0^0)) /\ (undef37 = undef37), par{oldX0^0 -> undef35, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef37, x0^0 -> (~(1) + undef35), x1^0 -> (0 + undef37)}>
<l6, l4, (undef43 = (0 + x0^0)) /\ ((1 + undef43) <= 0), par{oldX0^0 -> undef43, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef43), x1^0 -> (0 + __const_7^0)}>
<l6, l5, (undef51 = (0 + x0^0)) /\ (undef53 = undef53) /\ (0 <= (0 + undef51)), par{oldX0^0 -> undef51, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef53, x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}>
<l7, l6, (undef61 = undef61), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef61, x0^0 -> (0 + __const_7^0), x1^0 -> (0 + undef61)}>
<l8, l9, (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)}>
<l10, l11, (undef75 = (0 + x0^0)) /\ (undef77 = undef77), par{oldX0^0 -> undef75, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef77, x0^0 -> (1 + undef75), x1^0 -> (0 + undef77)}>
<l11, l8, (undef83 = (0 + x0^0)) /\ (undef84 = (0 + x1^0)) /\ ((1 + __const_63^0) <= (0 + undef83)), par{oldX0^0 -> undef83, oldX1^0 -> undef84, x0^0 -> (0 + undef83), x1^0 -> (0 + undef84)}>
<l11, l10, (undef91 = (0 + x0^0)) /\ (undef92 = (0 + x1^0)) /\ ((0 + undef91) <= (0 + __const_63^0)), par{oldX0^0 -> undef91, oldX1^0 -> undef92, x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}>
<l12, l11, true, par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), x0^0 -> 0, x1^0 -> 0}>
<l13, l12, (undef109 = undef109) /\ (undef110 = undef110), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef109, oldX3^0 -> undef110, x0^0 -> (0 + undef109), x1^0 -> (0 + undef110)}>
<l13, l7, (undef117 = undef117) /\ (undef118 = undef118), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef117, oldX3^0 -> undef118, x0^0 -> (0 + undef117), x1^0 -> (0 + undef118)}>
<l13, l2, true>
<l13, l1, true>
<l13, l3, true>
<l13, l4, true>
<l13, l5, true>
<l13, l6, true>
<l13, l7, true>
<l13, l9, true>
<l13, l8, true>
<l13, l10, true>
<l13, l11, true>
<l13, l12, true>
<l14, l13, true>

Fresh variables:
undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, 

Undef variables:
undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l9, (undef109 = undef109) /\ (undef110 = undef110) /\ (undef83 = (0 + 0)) /\ (undef84 = (0 + 0)) /\ ((1 + __const_63^0) <= (0 + undef83)) /\ (undef69 = undef69) /\ (undef70 = undef70), par{x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l0, l10, (undef109 = undef109) /\ (undef110 = undef110) /\ (undef91 = (0 + 0)) /\ (undef92 = (0 + 0)) /\ ((0 + undef91) <= (0 + __const_63^0)), par{x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}>
<l0, l2, (undef117 = undef117) /\ (undef118 = undef118) /\ (undef61 = undef61) /\ (undef43 = (0 + (0 + __const_7^0))) /\ ((1 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + __const_7^0))) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l0, l5, (undef117 = undef117) /\ (undef118 = undef118) /\ (undef61 = undef61) /\ (undef51 = (0 + (0 + __const_7^0))) /\ (undef53 = undef53) /\ (0 <= (0 + undef51)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}>
<l0, l2, true>
<l0, l2, (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l0, l3, true>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l0, l3, (undef27 = (0 + x0^0)) /\ (undef28 = (0 + x1^0)) /\ (0 <= (0 + undef28)), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l5, true>
<l0, l2, (undef43 = (0 + x0^0)) /\ ((1 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + __const_7^0))) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l0, l3, (undef43 = (0 + x0^0)) /\ ((1 + undef43) <= 0) /\ (undef27 = (0 + (0 + undef43))) /\ (undef28 = (0 + (0 + __const_7^0))) /\ (0 <= (0 + undef28)), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l0, l5, (undef51 = (0 + x0^0)) /\ (undef53 = undef53) /\ (0 <= (0 + undef51)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}>
<l0, l2, (undef61 = undef61) /\ (undef43 = (0 + (0 + __const_7^0))) /\ ((1 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + __const_7^0))) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l0, l5, (undef61 = undef61) /\ (undef51 = (0 + (0 + __const_7^0))) /\ (undef53 = undef53) /\ (0 <= (0 + undef51)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}>
<l0, l9, true>
<l0, l9, (undef69 = undef69) /\ (undef70 = undef70), par{x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l0, l10, true>
<l0, l9, (undef83 = (0 + x0^0)) /\ (undef84 = (0 + x1^0)) /\ ((1 + __const_63^0) <= (0 + undef83)) /\ (undef69 = undef69) /\ (undef70 = undef70), par{x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l0, l10, (undef91 = (0 + x0^0)) /\ (undef92 = (0 + x1^0)) /\ ((0 + undef91) <= (0 + __const_63^0)), par{x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}>
<l0, l9, (undef83 = (0 + 0)) /\ (undef84 = (0 + 0)) /\ ((1 + __const_63^0) <= (0 + undef83)) /\ (undef69 = undef69) /\ (undef70 = undef70), par{x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l0, l10, (undef91 = (0 + 0)) /\ (undef92 = (0 + 0)) /\ ((0 + undef91) <= (0 + __const_63^0)), par{x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}>
<l3, l2, (undef11 = (0 + x0^0)) /\ (undef12 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef11))) /\ (undef20 = (0 + (~(1) + undef12))) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l3, l3, (undef11 = (0 + x0^0)) /\ (undef12 = (0 + x1^0)) /\ (undef27 = (0 + (0 + undef11))) /\ (undef28 = (0 + (~(1) + undef12))) /\ (0 <= (0 + undef28)), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l5, l2, (undef35 = (0 + x0^0)) /\ (undef37 = undef37) /\ (undef43 = (0 + (~(1) + undef35))) /\ ((1 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + __const_7^0))) /\ ((1 + undef20) <= 0) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef5), x1^0 -> (0 + undef6)}>
<l5, l3, (undef35 = (0 + x0^0)) /\ (undef37 = undef37) /\ (undef43 = (0 + (~(1) + undef35))) /\ ((1 + undef43) <= 0) /\ (undef27 = (0 + (0 + undef43))) /\ (undef28 = (0 + (0 + __const_7^0))) /\ (0 <= (0 + undef28)), par{x0^0 -> (0 + undef27), x1^0 -> (0 + undef28)}>
<l5, l5, (undef35 = (0 + x0^0)) /\ (undef37 = undef37) /\ (undef51 = (0 + (~(1) + undef35))) /\ (undef53 = undef53) /\ (0 <= (0 + undef51)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef53)}>
<l10, l9, (undef75 = (0 + x0^0)) /\ (undef77 = undef77) /\ (undef83 = (0 + (1 + undef75))) /\ (undef84 = (0 + (0 + undef77))) /\ ((1 + __const_63^0) <= (0 + undef83)) /\ (undef69 = undef69) /\ (undef70 = undef70), par{x0^0 -> (0 + undef69), x1^0 -> (0 + undef70)}>
<l10, l10, (undef75 = (0 + x0^0)) /\ (undef77 = undef77) /\ (undef91 = (0 + (1 + undef75))) /\ (undef92 = (0 + (0 + undef77))) /\ ((0 + undef91) <= (0 + __const_63^0)), par{x0^0 -> (0 + undef91), x1^0 -> (0 + undef92)}>

Fresh variables:
undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, 

Undef variables:
undef5, undef6, undef11, undef12, undef19, undef20, undef27, undef28, undef35, undef37, undef43, undef51, undef53, undef61, undef69, undef70, undef75, undef77, undef83, undef84, undef91, undef92, undef109, undef110, undef117, undef118, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 0 <= undef51 /\ x0^0 = undef35 /\ undef35 = 1 + undef51, {x0^0 -> undef51, x1^0 -> undef53, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
<l3, l3, 0 <= undef28 /\ x0^0 = undef11 /\ x1^0 = undef12 /\ undef11 = undef27 /\ undef12 = 1 + undef28, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
Variables:
x0^0, x1^0

Graph 3:
Transitions:
Variables:

Graph 4:
Transitions:
<l10, l10, undef91 <= __const_63^0 /\ x0^0 = undef75 /\ undef77 = undef92 /\ 1 + undef75 = undef91, {x0^0 -> undef91, x1^0 -> undef92, rest remain the same}>
Variables:
__const_63^0, x0^0, x1^0

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, 0 <= undef51 /\ __const_7^0 = undef51, {x0^0 -> undef51, x1^0 -> undef53, rest remain the same}>
<l0, l5, true, {all remain the same}>
<l0, l5, 0 <= undef51 /\ x0^0 = undef51, {x0^0 -> undef51, x1^0 -> undef53, rest remain the same}>
<l0, l5, 0 <= undef51 /\ __const_7^0 = undef51, {x0^0 -> undef51, x1^0 -> undef53, rest remain the same}>

Graph 2
<l0, l3, true, {all remain the same}>
<l0, l3, 0 <= undef28 /\ x0^0 = undef27 /\ x1^0 = undef28, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l0, l3, 0 <= undef28 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef28 /\ x0^0 = undef43 /\ undef27 = undef43, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>
<l5, l3, 0 <= undef28 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef28 /\ x0^0 = undef35 /\ undef27 = undef43 /\ undef35 = 1 + undef43, {x0^0 -> undef27, x1^0 -> undef28, rest remain the same}>

Graph 3
<l0, l2, 1 + undef20 <= 0 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef20 /\ __const_7^0 = undef43 /\ undef19 = undef43, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef20 /\ x0^0 = undef43 /\ undef19 = undef43, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l0, l2, 1 + undef20 <= 0 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef20 /\ __const_7^0 = undef43 /\ undef19 = undef43, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l3, l2, 1 + undef20 <= 0 /\ x0^0 = undef11 /\ x1^0 = undef12 /\ undef11 = undef19 /\ undef12 = 1 + undef20, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>
<l5, l2, 1 + undef20 <= 0 /\ 1 + undef43 <= 0 /\ __const_7^0 = undef20 /\ x0^0 = undef35 /\ undef19 = undef43 /\ undef35 = 1 + undef43, {x0^0 -> undef5, x1^0 -> undef6, rest remain the same}>

Graph 4
<l0, l10, undef91 <= __const_63^0 /\ undef91 = 0 /\ undef92 = 0, {x0^0 -> undef91, x1^0 -> undef92, rest remain the same}>
<l0, l10, true, {all remain the same}>
<l0, l10, undef91 <= __const_63^0 /\ x0^0 = undef91 /\ x1^0 = undef92, {x0^0 -> undef91, x1^0 -> undef92, rest remain the same}>
<l0, l10, undef91 <= __const_63^0 /\ undef91 = 0 /\ undef92 = 0, {x0^0 -> undef91, x1^0 -> undef92, rest remain the same}>

Graph 5
<l0, l9, 1 + __const_63^0 <= undef83 /\ undef83 = 0 /\ undef84 = 0, {x0^0 -> undef69, x1^0 -> undef70, rest remain the same}>
<l0, l9, true, {all remain the same}>
<l0, l9, true, {x0^0 -> undef69, x1^0 -> undef70, rest remain the same}>
<l0, l9, 1 + __const_63^0 <= undef83 /\ x0^0 = undef83 /\ x1^0 = undef84, {x0^0 -> undef69, x1^0 -> undef70, rest remain the same}>
<l0, l9, 1 + __const_63^0 <= undef83 /\ undef83 = 0 /\ undef84 = 0, {x0^0 -> undef69, x1^0 -> undef70, rest remain the same}>
<l10, l9, 1 + __const_63^0 <= undef83 /\ x0^0 = undef75 /\ undef77 = undef84 /\ 1 + undef75 = undef83, {x0^0 -> undef69, x1^0 -> undef70, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000449s
Ranking function: -1 + x0^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001327

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000553s
Ranking function: -1 + x1^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l2}...
No cycles found.

Proving termination of subgraph 4
Checking unfeasibility...
Time used: 0.001256

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000590s
Ranking function: -1 + __const_63^0 - x0^0
New Graphs: 
Proving termination of subgraph 5
Analyzing SCC {l9}...
No cycles found.

Program Terminates