YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef3 = undef3) /\ (undef6 = undef6), par{x_13^0 -> undef3, y_16^0 -> undef6}>
<l2, l3, (1 <= (0 + x_13^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef14}>
<l2, l4, ((0 + x_13^0) <= 0), par{result_11^0 -> (0 + temp0_14^0)}>
<l5, l3, (undef28 = undef28) /\ (undef31 = undef31) /\ (1 <= (0 + y_16^0)) /\ (undef27 = (~(1) + x_13^0)) /\ (undef30 = (~(1) + y_16^0)) /\ ((0 + undef27) <= (~(1) + undef28)) /\ ((~(1) + undef28) <= (0 + undef27)) /\ ((0 + undef30) <= (~(1) + undef31)) /\ ((~(1) + undef31) <= (0 + undef30)) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef31)), par{x_13^0 -> undef27, x_27^0 -> undef28, y_16^0 -> undef30, y_28^0 -> undef31}>
<l3, l2, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0)>
<l3, l6, (undef45 = undef45) /\ (undef48 = undef48) /\ (1 <= (0 + y_16^0)) /\ (undef43 = (~(1) + x_13^0)) /\ (undef46 = (~(1) + y_16^0)) /\ ((0 + undef43) <= (~(1) + undef45)) /\ ((~(1) + undef45) <= (0 + undef43)) /\ ((0 + undef46) <= (~(1) + undef48)) /\ ((~(1) + undef48) <= (0 + undef46)) /\ (1 <= (0 + undef48)), par{x_13^0 -> undef43, x_32^0 -> undef45, y_16^0 -> undef46, y_33^0 -> undef48}>
<l6, l3, true>
<l7, l1, true>

Fresh variables:
undef3, undef6, undef14, undef27, undef28, undef30, undef31, undef43, undef45, undef46, undef48, 

Undef variables:
undef3, undef6, undef14, undef27, undef28, undef30, undef31, undef43, undef45, undef46, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (x_13^0 = undef3) /\ (undef3 = undef3) /\ (undef6 = undef6) /\ (1 <= (0 + undef3)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)) /\ (1 <= (0 + undef3)), par{y_16^0 -> undef14}>
<l0, l4, (x_13^0 = undef3) /\ (undef3 = undef3) /\ (undef6 = undef6) /\ ((0 + undef3) <= 0), par{y_16^0 -> undef6}>
<l3, l3, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ (1 <= (0 + x_13^0)) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef14}>
<l3, l4, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ ((0 + x_13^0) <= 0)>
<l3, l3, (undef45 = undef45) /\ (undef48 = undef48) /\ (1 <= (0 + y_16^0)) /\ (undef43 = (~(1) + x_13^0)) /\ (undef46 = (~(1) + y_16^0)) /\ ((0 + undef43) <= (~(1) + undef45)) /\ ((~(1) + undef45) <= (0 + undef43)) /\ ((0 + undef46) <= (~(1) + undef48)) /\ ((~(1) + undef48) <= (0 + undef46)) /\ (1 <= (0 + undef48)), par{x_13^0 -> undef43, y_16^0 -> undef46}>

Fresh variables:
undef3, undef6, undef14, undef27, undef28, undef30, undef31, undef43, undef45, undef46, undef48, 

Undef variables:
undef3, undef6, undef14, undef27, undef28, undef30, undef31, undef43, undef45, undef46, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 <= x_13^0 /\ 1 <= undef14 /\ y_16^0 <= 0, {y_16^0 -> undef14, rest remain the same}>
<l3, l3, 1 <= y_16^0 /\ 1 <= undef48 /\ 1 + undef43 = undef45 /\ 1 + undef46 = undef48 /\ x_13^0 = 1 + undef43 /\ y_16^0 = 1 + undef46, {x_13^0 -> undef43, y_16^0 -> undef46, rest remain the same}>
Variables:
x_13^0, y_16^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef3 /\ 1 <= undef14 /\ x_13^0 = undef3, {y_16^0 -> undef14, rest remain the same}>

Graph 2
<l0, l4, undef3 <= 0 /\ x_13^0 = undef3, {y_16^0 -> undef6, rest remain the same}>
<l3, l4, x_13^0 <= 0 /\ y_16^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001750s
Ranking function: 1 + 2*x_13^0 - y_16^0
New Graphs: 
Transitions:
<l3, l3, 1 <= y_16^0 /\ 1 <= undef48 /\ 1 + undef43 = undef45 /\ 1 + undef46 = undef48 /\ x_13^0 = 1 + undef43 /\ y_16^0 = 1 + undef46, {x_13^0 -> undef43, y_16^0 -> undef46, rest remain the same}>
Variables:
x_13^0, y_16^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates