YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((0 + (~(1) * x^0)) <= (0 + y^0)) /\ ((1 + x^0) <= (0 + y^0)), par{x^0 -> (1 + x^0)}>
<l1, l2, ((0 + x^0) <= (0 + y^0)) /\ ((1 + x^0) <= (0 + (~(1) * y^0))), par{y^0 -> (1 + y^0)}>
<l1, l2, ((0 + y^0) <= (1 + (~(1) * x^0))) /\ ((1 + y^0) <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}>
<l1, l2, ((0 + y^0) <= (0 + x^0)) /\ ((2 + (~(1) * y^0)) <= (0 + x^0)), par{y^0 -> (~(1) + y^0)}>
<l2, l3, ((1 + x^0) <= 0)>
<l2, l3, (1 <= (0 + x^0))>
<l3, l1, ((1 + y^0) <= 0)>
<l3, l1, (1 <= (0 + y^0))>
<l4, l2, true>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 + y^0 <= 0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 + x^0 <= 0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 <= x^0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 <= y^0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004976s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.864031s
Trying to remove transition: <l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 <= y^0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.034150s
Time used: 0.032115

LOG: SAT solveNonLinear - Elapsed time: 0.034150s
Cost: 0; Total time: 0.032115
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 0 <= x^0
Ranking function: y^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 + y^0 <= 0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 + x^0 <= 0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 <= x^0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003616s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.546564s
Trying to remove transition: <l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.122047s
Time used: 0.120285
Trying to remove transition: <l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.179460s
Time used: 0.176244
Trying to remove transition: <l2, l2, 1 <= x^0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031256s
Time used: 0.027628

LOG: SAT solveNonLinear - Elapsed time: 0.031256s
Cost: 0; Total time: 0.027628
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: y^0 <= 0
Ranking function: x^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 + y^0 <= 0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 + x^0 <= 0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003206s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.383470s
Trying to remove transition: <l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027476s
Time used: 0.025385

LOG: SAT solveNonLinear - Elapsed time: 0.027476s
Cost: 0; Total time: 0.025385
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 0 <= x^0
Ranking function: -x^0 + 2*y^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 + y^0 <= 0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 + x^0 <= 0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002801s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.300765s
Trying to remove transition: <l2, l2, y^0 <= x^0 /\ 1 <= x^0 /\ 1 + y^0 <= 0 /\ 2 <= x^0 + y^0, {y^0 -> -1 + y^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019016s
Time used: 0.017971

LOG: SAT solveNonLinear - Elapsed time: 0.019016s
Cost: 0; Total time: 0.017971
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 0 <= x^0
Ranking function: 2*x^0 + y^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 + y^0 <= 0, {y^0 -> 1 + y^0, rest remain the same}>
<l2, l2, 1 + x^0 <= 0 /\ 1 + y^0 <= x^0 /\ 1 + y^0 <= 0 /\ x^0 + y^0 <= 1, {x^0 -> -1 + x^0, rest remain the same}>
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001729s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010992s
Piecewise ranking function: min(2 + x^0 - 4*y^0,2 - 3*x^0 - 8*y^0)
New Graphs: 
Transitions:
<l2, l2, 0 <= x^0 + y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 <= y^0 /\ 1 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l2, l2, x^0 <= y^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + y^0 <= 0 /\ 1 <= y^0, {y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001301s
Ranking function: -1 - x^0
New Graphs: 
Program Terminates