YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((101 + (~(1) * i_5^0)) <= 0) /\ (undef3 = 0) /\ (undef2 = (0 + undef3)), par{Result_4^0 -> (0 + undef2), ___cil_tmp4_8^0 -> undef2, ___retres3_7^0 -> undef3}>
<l1, l3, (0 <= (100 + (~(1) * i_5^0))) /\ (0 <= (~(1) + x_6^0)), par{i_5^0 -> (1 + i_5^0)}>
<l3, l1, true>
<l4, l5, true, par{i_5^0 -> 0}>
<l5, l2, (0 <= (100 + (~(1) * i_5^0))) /\ ((0 + x_6^0) <= 0) /\ (undef23 = 0) /\ (undef22 = (0 + undef23)), par{Result_4^0 -> (0 + undef22), ___cil_tmp4_8^0 -> undef22, ___retres3_7^0 -> undef23}>
<l5, l1, (0 <= (100 + (~(1) * i_5^0))) /\ (0 <= (~(1) + x_6^0)), par{i_5^0 -> (1 + i_5^0)}>
<l6, l4, true>

Fresh variables:
undef2, undef3, undef22, undef23, 

Undef variables:
undef2, undef3, undef22, undef23, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (0 <= (100 + (~(1) * 0))) /\ ((0 + x_6^0) <= 0) /\ (undef23 = 0) /\ (undef22 = (0 + undef23)), par{i_5^0 -> 0}>
<l0, l1, (0 <= (100 + (~(1) * 0))) /\ (0 <= (~(1) + x_6^0)), par{i_5^0 -> (1 + 0)}>
<l1, l2, ((101 + (~(1) * i_5^0)) <= 0) /\ (undef3 = 0) /\ (undef2 = (0 + undef3))>
<l1, l1, (0 <= (100 + (~(1) * i_5^0))) /\ (0 <= (~(1) + x_6^0)), par{i_5^0 -> (1 + i_5^0)}>

Fresh variables:
undef2, undef3, undef22, undef23, 

Undef variables:
undef2, undef3, undef22, undef23, 

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_6^0 /\ i_5^0 <= 100, {i_5^0 -> 1 + i_5^0, rest remain the same}>
Variables:
i_5^0, x_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= x_6^0, {i_5^0 -> 1, rest remain the same}>

Graph 2
<l0, l2, x_6^0 <= 0 /\ undef22 = undef23 /\ undef23 = 0, {i_5^0 -> 0, rest remain the same}>
<l1, l2, 101 <= i_5^0 /\ undef2 = undef3 /\ undef3 = 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.002368

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

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

Program Terminates