YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, ((0 + (~(1) * x^0)) <= 0) /\ (undef1 = undef1), par{Result^0 -> undef1}>
<l1, l3, (0 <= (~(1) + (~(1) * x^0)))>
<l3, l4, (undef13 = __disjvr_0^0) /\ (__disjvr_0^0 = undef13), par{__disjvr_0^0 -> undef13}>
<l4, l5, true, par{x^0 -> (1 + x^0), y^0 -> (1 + y^0)}>
<l5, l1, true>
<l1, l6, (0 <= (~(1) + (~(1) * x^0))) /\ ((0 + y^0) <= ~(1)) /\ (~(1) <= (0 + y^0)), par{x^0 -> ((0 + (~(1) * __const_99^0)) + x^0), y^0 -> (1 + y^0)}>
<l6, l1, true>
<l7, l1, true>
<l8, l7, true>

Fresh variables:
undef1, undef13, 

Undef variables:
undef1, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l2, ((0 + (~(1) * x^0)) <= 0) /\ (undef1 = undef1)>
<l1, l1, (0 <= (~(1) + (~(1) * x^0))) /\ (undef13 = __disjvr_0^0) /\ (__disjvr_0^0 = undef13), par{__disjvr_0^0 -> undef13, x^0 -> (1 + x^0), y^0 -> (1 + y^0)}>
<l1, l1, (0 <= (~(1) + (~(1) * x^0))) /\ ((0 + y^0) <= ~(1)) /\ (~(1) <= (0 + y^0)), par{x^0 -> ((0 + (~(1) * __const_99^0)) + x^0), y^0 -> (1 + y^0)}>

Fresh variables:
undef1, undef13, 

Undef variables:
undef1, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + x^0 <= 0 /\ __disjvr_0^0 = undef13, {__disjvr_0^0 -> undef13, x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
<l1, l1, 1 + x^0 <= 0 /\ 1 + y^0 = 0, {x^0 -> -__const_99^0 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
__disjvr_0^0, x^0, y^0, __const_99^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l2, 0 <= x^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000989s
Ranking function: -y^0
New Graphs: 
Transitions:
<l1, l1, 1 + x^0 <= 0 /\ __disjvr_0^0 = undef13, {__disjvr_0^0 -> undef13, x^0 -> 1 + x^0, y^0 -> 1 + y^0, rest remain the same}>
Variables:
__disjvr_0^0, x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

Program Terminates