YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef4, oldX4^0 -> undef5, oldX5^0 -> undef6, x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l4, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> undef12, x0^0 -> (0 + undef10), x1^0 -> (1 + undef11), x2^0 -> (1 + undef12)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef20) <= (~(1) + undef19)) /\ ((1 + undef20) <= (0 + undef20)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef21)}>
<l4, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ ((0 + undef29) <= (~(1) + undef28)) /\ ((1 + undef29) <= (0 + undef29)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l4, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (undef39 = (0 + x2^0)) /\ ((0 + undef38) <= (~(1) + undef37)) /\ ((0 + undef38) <= (0 + undef38)) /\ ((0 + undef38) <= (0 + undef38)), par{oldX0^0 -> undef37, oldX1^0 -> undef38, oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l4, l1, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (undef48 = (0 + x2^0)) /\ ((0 + undef46) <= (0 + undef47)) /\ ((1 + undef47) <= (~(1) + undef46)), par{oldX0^0 -> undef46, oldX1^0 -> undef47, oldX2^0 -> undef48, x0^0 -> (0 + undef46), x1^0 -> (0 + undef47), x2^0 -> (0 + undef48)}>
<l4, l1, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef57 = (0 + x2^0)) /\ ((0 + undef55) <= (0 + undef56)) /\ ((0 + undef55) <= (0 + undef56)), par{oldX0^0 -> undef55, oldX1^0 -> undef56, oldX2^0 -> undef57, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef57)}>
<l4, l3, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef66 = (0 + x2^0)) /\ ((0 + undef64) <= (0 + undef65)) /\ ((~(1) + undef64) <= (0 + undef65)) /\ ((0 + undef65) <= (~(1) + undef64)), par{oldX0^0 -> undef64, oldX1^0 -> undef65, oldX2^0 -> undef66, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef66)}>
<l5, l4, (undef76 = undef76) /\ (undef77 = undef77), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef76, oldX4^0 -> undef77, x0^0 -> (0 + undef76), x1^0 -> (0 + undef77), x2^0 -> 0}>
<l6, l5, (undef85 = undef85) /\ (undef86 = undef86) /\ (undef87 = undef87), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef85, oldX4^0 -> undef86, oldX5^0 -> undef87, x0^0 -> (0 + undef85), x1^0 -> (0 + undef86), x2^0 -> (0 + undef87)}>
<l6, l2, true>
<l6, l1, true>
<l6, l3, true>
<l6, l4, true>
<l6, l5, true>
<l7, l6, true>

Fresh variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef37, undef38, undef39, undef46, undef47, undef48, undef55, undef56, undef57, undef64, undef65, undef66, undef76, undef77, undef85, undef86, undef87, 

Undef variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef37, undef38, undef39, undef46, undef47, undef48, undef55, undef56, undef57, undef64, undef65, undef66, undef76, undef77, undef85, undef86, undef87, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef85 = undef85) /\ (undef86 = undef86) /\ (undef87 = undef87) /\ (undef76 = undef76) /\ (undef77 = undef77) /\ (undef37 = (0 + (0 + undef76))) /\ (undef38 = (0 + (0 + undef77))) /\ (undef39 = (0 + 0)) /\ ((0 + undef38) <= (~(1) + undef37)) /\ ((0 + undef38) <= (0 + undef38)) /\ ((0 + undef38) <= (0 + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l0, l2, (undef85 = undef85) /\ (undef86 = undef86) /\ (undef87 = undef87) /\ (undef76 = undef76) /\ (undef77 = undef77) /\ (undef55 = (0 + (0 + undef76))) /\ (undef56 = (0 + (0 + undef77))) /\ (undef57 = (0 + 0)) /\ ((0 + undef55) <= (0 + undef56)) /\ ((0 + undef55) <= (0 + undef56)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l2, true>
<l0, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, true>
<l0, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (undef39 = (0 + x2^0)) /\ ((0 + undef38) <= (~(1) + undef37)) /\ ((0 + undef38) <= (0 + undef38)) /\ ((0 + undef38) <= (0 + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l0, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef57 = (0 + x2^0)) /\ ((0 + undef55) <= (0 + undef56)) /\ ((0 + undef55) <= (0 + undef56)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef76 = undef76) /\ (undef77 = undef77) /\ (undef37 = (0 + (0 + undef76))) /\ (undef38 = (0 + (0 + undef77))) /\ (undef39 = (0 + 0)) /\ ((0 + undef38) <= (~(1) + undef37)) /\ ((0 + undef38) <= (0 + undef38)) /\ ((0 + undef38) <= (0 + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l0, l2, (undef76 = undef76) /\ (undef77 = undef77) /\ (undef55 = (0 + (0 + undef76))) /\ (undef56 = (0 + (0 + undef77))) /\ (undef57 = (0 + 0)) /\ ((0 + undef55) <= (0 + undef56)) /\ ((0 + undef55) <= (0 + undef56)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef37 = (0 + (0 + undef10))) /\ (undef38 = (0 + (1 + undef11))) /\ (undef39 = (0 + (1 + undef12))) /\ ((0 + undef38) <= (~(1) + undef37)) /\ ((0 + undef38) <= (0 + undef38)) /\ ((0 + undef38) <= (0 + undef38)), par{x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l3, l2, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef55 = (0 + (0 + undef10))) /\ (undef56 = (0 + (1 + undef11))) /\ (undef57 = (0 + (1 + undef12))) /\ ((0 + undef55) <= (0 + undef56)) /\ ((0 + undef55) <= (0 + undef56)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>

Fresh variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef37, undef38, undef39, undef46, undef47, undef48, undef55, undef56, undef57, undef64, undef65, undef66, undef76, undef77, undef85, undef86, undef87, 

Undef variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef37, undef38, undef39, undef46, undef47, undef48, undef55, undef56, undef57, undef64, undef65, undef66, undef76, undef77, undef85, undef86, undef87, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + undef38 <= undef37 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef37 /\ 1 + undef11 = undef38 /\ 1 + undef12 = undef39, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> undef39, rest remain the same}>
Variables:
x0^0, x1^0, x2^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + undef38 <= undef37 /\ undef37 = undef76 /\ undef38 = undef77 /\ undef39 = 0, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> undef39, rest remain the same}>
<l0, l3, true, {all remain the same}>
<l0, l3, 1 + undef38 <= undef37 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ x2^0 = undef39, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> undef39, rest remain the same}>
<l0, l3, 1 + undef38 <= undef37 /\ undef37 = undef76 /\ undef38 = undef77 /\ undef39 = 0, {x0^0 -> undef37, x1^0 -> undef38, x2^0 -> undef39, rest remain the same}>

Graph 2
<l0, l2, undef55 <= undef56 /\ undef55 = undef76 /\ undef56 = undef77 /\ undef57 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef55 <= undef56 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ x2^0 = undef57, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef55 <= undef56 /\ undef55 = undef76 /\ undef56 = undef77 /\ undef57 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l3, l2, undef55 <= undef56 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef55 /\ 1 + undef11 = undef56 /\ 1 + undef12 = undef57, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates