YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, true>
<l3, l4, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)), par{Result_4^0 -> (0 + undef10), __cil_tmp4_8^0 -> undef10, __retres3_7^0 -> undef12}>
<l3, l5, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + d_6^0) + i_5^0)}>
<l5, l3, true>
<l2, l4, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)), par{Result_4^0 -> (0 + undef31), __cil_tmp4_8^0 -> undef31, __retres3_7^0 -> undef33}>
<l2, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
<l4, l6, (undef46 = 0) /\ (undef44 = (0 + undef46)), par{Result_4^0 -> (0 + undef44), __cil_tmp2_10^0 -> undef44, __retres1_9^0 -> undef46}>
<l7, l1, true>

Fresh variables:
undef10, undef12, undef31, undef33, undef44, undef46, 

Undef variables:
undef10, undef12, undef31, undef33, undef44, undef46, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l6, ((0 + (~(1) * d_6^0)) <= 0) /\ (undef33 = 0) /\ (undef31 = (0 + undef33)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
<l0, l3, (0 <= (~(1) + (~(1) * d_6^0)))>
<l3, l6, ((1 + i_5^0) <= 0) /\ (undef12 = 0) /\ (undef10 = (0 + undef12)) /\ (undef46 = 0) /\ (undef44 = (0 + undef46))>
<l3, l3, (0 <= (0 + i_5^0)), par{i_5^0 -> ((0 + d_6^0) + i_5^0)}>

Fresh variables:
undef10, undef12, undef31, undef33, undef44, undef46, 

Undef variables:
undef10, undef12, undef31, undef33, undef44, undef46, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 0 <= i_5^0, {i_5^0 -> d_6^0 + i_5^0, rest remain the same}>
Variables:
d_6^0, i_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + d_6^0 <= 0, {all remain the same}>

Graph 2
<l0, l6, 0 <= d_6^0 /\ undef31 = undef33 /\ undef33 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>
<l3, l6, 1 + i_5^0 <= 0 /\ undef10 = undef12 /\ undef12 = 0 /\ undef44 = undef46 /\ undef46 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000436s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000721s
Trying to remove transition: <l3, l3, 0 <= i_5^0, {i_5^0 -> d_6^0 + i_5^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002050s
Time used: 0.00198
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002729s
Time used: 0.002581

LOG: SAT solveNonLinear - Elapsed time: 0.002729s
Cost: 0; Total time: 0.002581
Termination implied by a set of invariant(s):
Invariant at l3: 1 + d_6^0 <= 0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> d_6^0 + i_5^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + d_6^0 <= 0 /\ 0 <= i_5^0, {i_5^0 -> d_6^0 + i_5^0, rest remain the same}>
Ranking function: i_5^0
New Graphs: 
INVARIANTS: 
3: 1 + d_6^0 <= 0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
Proving termination of subgraph 2
Analyzing SCC {l6}...
No cycles found.

Program Terminates