YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, (undef7 = (0 + s_17^0)) /\ (undef2 = (0 + s_16^0)), par{i_13^0 -> (0 + undef2), j_15^0 -> undef2}>
<l3, l4, (500 <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
<l3, l5, ((1 + i_13^0) <= 500), par{i_13^0 -> (1 + i_13^0)}>
<l5, l3, true>
<l2, l4, (500 <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l3, ((1 + i_13^0) <= 500), par{i_13^0 -> (1 + i_13^0)}>
<l6, l1, true>

Fresh variables:
undef2, undef7, 

Undef variables:
undef2, undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef7 = (0 + s_17^0)) /\ (undef2 = (0 + s_16^0)) /\ (500 <= (0 + (0 + undef2))), par{i_13^0 -> (0 + undef2)}>
<l0, l3, (undef7 = (0 + s_17^0)) /\ (undef2 = (0 + s_16^0)) /\ ((1 + (0 + undef2)) <= 500), par{i_13^0 -> (1 + (0 + undef2))}>
<l3, l4, (500 <= (0 + i_13^0))>
<l3, l3, ((1 + i_13^0) <= 500), par{i_13^0 -> (1 + i_13^0)}>

Fresh variables:
undef2, undef7, 

Undef variables:
undef2, undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, undef2 <= 499 /\ s_16^0 = undef2 /\ s_17^0 = undef7, {i_13^0 -> 1 + undef2, rest remain the same}>

Graph 2
<l0, l4, 500 <= undef2 /\ s_16^0 = undef2 /\ s_17^0 = undef7, {i_13^0 -> undef2, rest remain the same}>
<l3, l4, 500 <= i_13^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.001537

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates