YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (~(1) + undef8)}>
<l4, l1, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((1 + undef14) <= 0), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}>
<l4, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (0 <= (0 + undef20)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l6, (undef25 = (0 + x0^0)) /\ (undef27 = undef27), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef27, x0^0 -> (~(1) + undef25), x1^0 -> (0 + undef27)}>
<l6, l4, (undef31 = (0 + x0^0)) /\ ((1 + undef31) <= 0), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> 7}>
<l6, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (0 <= (0 + undef37)), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l7, l6, (undef45 = undef45), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, x0^0 -> 7, x1^0 -> (0 + undef45)}>
<l8, l9, (undef51 = undef51) /\ (undef52 = undef52), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef51, oldX3^0 -> undef52, x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
<l10, l11, (undef55 = (0 + x0^0)) /\ (undef57 = undef57), par{oldX0^0 -> undef55, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef57, x0^0 -> (1 + undef55), x1^0 -> (0 + undef57)}>
<l11, l8, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (64 <= (0 + undef61)), par{oldX0^0 -> undef61, oldX1^0 -> undef62, x0^0 -> (0 + undef61), x1^0 -> (0 + undef62)}>
<l11, l10, (undef67 = (0 + x0^0)) /\ (undef68 = (0 + x1^0)) /\ ((0 + undef67) <= 63), par{oldX0^0 -> undef67, oldX1^0 -> undef68, x0^0 -> (0 + undef67), x1^0 -> (0 + undef68)}>
<l12, l11, true, par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), x0^0 -> 0, x1^0 -> 0}>
<l13, l12, (undef81 = undef81) /\ (undef82 = undef82), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef81, oldX3^0 -> undef82, x0^0 -> (0 + undef81), x1^0 -> (0 + undef82)}>
<l13, l7, (undef87 = undef87) /\ (undef88 = undef88), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef87, oldX3^0 -> undef88, x0^0 -> (0 + undef87), x1^0 -> (0 + undef88)}>
<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:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, undef55, undef57, undef61, undef62, undef67, undef68, undef81, undef82, undef87, undef88, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, undef55, undef57, undef61, undef62, undef67, undef68, undef81, undef82, undef87, undef88, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l10, (undef81 = undef81) /\ (undef82 = undef82) /\ (undef67 = (0 + 0)) /\ (undef68 = (0 + 0)) /\ ((0 + undef67) <= 63), par{x0^0 -> (0 + undef67), x1^0 -> (0 + undef68)}>
<l0, l5, (undef87 = undef87) /\ (undef88 = undef88) /\ (undef45 = undef45) /\ (undef37 = (0 + 7)) /\ (undef39 = undef39) /\ (0 <= (0 + undef37)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l0, l2, true>
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, true>
<l0, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((1 + undef14) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (0 <= (0 + undef20)), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l0, l5, true>
<l0, l3, (undef31 = (0 + x0^0)) /\ ((1 + undef31) <= 0) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 7)) /\ (0 <= (0 + undef20)), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l0, l5, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (0 <= (0 + undef37)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l0, l5, (undef45 = undef45) /\ (undef37 = (0 + 7)) /\ (undef39 = undef39) /\ (0 <= (0 + undef37)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l0, l9, true>
<l0, l9, (undef51 = undef51) /\ (undef52 = undef52), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
<l0, l10, true>
<l0, l9, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (64 <= (0 + undef61)) /\ (undef51 = undef51) /\ (undef52 = undef52), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
<l0, l10, (undef67 = (0 + x0^0)) /\ (undef68 = (0 + x1^0)) /\ ((0 + undef67) <= 63), par{x0^0 -> (0 + undef67), x1^0 -> (0 + undef68)}>
<l0, l10, (undef67 = (0 + 0)) /\ (undef68 = (0 + 0)) /\ ((0 + undef67) <= 63), par{x0^0 -> (0 + undef67), x1^0 -> (0 + undef68)}>
<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef13 = (0 + (0 + undef7))) /\ (undef14 = (0 + (~(1) + undef8))) /\ ((1 + undef14) <= 0) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (~(1) + undef8))) /\ (0 <= (0 + undef20)), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l3, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef31 = (0 + (~(1) + undef25))) /\ ((1 + undef31) <= 0) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 7)) /\ (0 <= (0 + undef20)), par{x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l5, (undef25 = (0 + x0^0)) /\ (undef27 = undef27) /\ (undef37 = (0 + (~(1) + undef25))) /\ (undef39 = undef39) /\ (0 <= (0 + undef37)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
<l10, l9, (undef55 = (0 + x0^0)) /\ (undef57 = undef57) /\ (undef61 = (0 + (1 + undef55))) /\ (undef62 = (0 + (0 + undef57))) /\ (64 <= (0 + undef61)) /\ (undef51 = undef51) /\ (undef52 = undef52), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52)}>
<l10, l10, (undef55 = (0 + x0^0)) /\ (undef57 = undef57) /\ (undef67 = (0 + (1 + undef55))) /\ (undef68 = (0 + (0 + undef57))) /\ ((0 + undef67) <= 63), par{x0^0 -> (0 + undef67), x1^0 -> (0 + undef68)}>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, undef55, undef57, undef61, undef62, undef67, undef68, undef81, undef82, undef87, undef88, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef27, undef31, undef37, undef39, undef45, undef51, undef52, undef55, undef57, undef61, undef62, undef67, undef68, undef81, undef82, undef87, undef88, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
<l3, l3, 0 <= undef20 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef19 /\ undef8 = 1 + undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
Variables:
x0^0, x1^0

Graph 3:
Transitions:
Variables:

Graph 4:
Transitions:
<l10, l10, undef67 <= 63 /\ x0^0 = undef55 /\ undef57 = undef68 /\ 1 + undef55 = undef67, {x0^0 -> undef67, x1^0 -> undef68, rest remain the same}>
Variables:
x0^0, x1^0

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, undef37 = 7, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
<l0, l5, true, {all remain the same}>
<l0, l5, 0 <= undef37 /\ x0^0 = undef37, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>
<l0, l5, undef37 = 7, {x0^0 -> undef37, x1^0 -> undef39, rest remain the same}>

Graph 2
<l0, l3, true, {all remain the same}>
<l0, l3, 0 <= undef20 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
<l0, l3, 1 + undef31 <= 0 /\ x0^0 = undef31 /\ undef19 = undef31 /\ undef20 = 7, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>
<l5, l3, 1 + undef31 <= 0 /\ x0^0 = undef25 /\ undef19 = undef31 /\ undef25 = 1 + undef31 /\ undef20 = 7, {x0^0 -> undef19, x1^0 -> undef20, rest remain the same}>

Graph 3
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 1 + undef14 <= 0 /\ x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, 1 + undef14 <= 0 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef13 /\ undef8 = 1 + undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>

Graph 4
<l0, l10, undef67 = 0 /\ undef68 = 0, {x0^0 -> undef67, x1^0 -> undef68, rest remain the same}>
<l0, l10, true, {all remain the same}>
<l0, l10, undef67 <= 63 /\ x0^0 = undef67 /\ x1^0 = undef68, {x0^0 -> undef67, x1^0 -> undef68, rest remain the same}>
<l0, l10, undef67 = 0 /\ undef68 = 0, {x0^0 -> undef67, x1^0 -> undef68, rest remain the same}>

Graph 5
<l0, l9, true, {all remain the same}>
<l0, l9, true, {x0^0 -> undef51, x1^0 -> undef52, rest remain the same}>
<l0, l9, 64 <= undef61 /\ x0^0 = undef61 /\ x1^0 = undef62, {x0^0 -> undef51, x1^0 -> undef52, rest remain the same}>
<l10, l9, 64 <= undef61 /\ x0^0 = undef55 /\ undef57 = undef62 /\ 1 + undef55 = undef61, {x0^0 -> undef51, x1^0 -> undef52, 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.002203

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001109s
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.002308

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

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

Program Terminates