YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((0 + __const_20^0) <= (0 + j^0))>
<l1, l3, ((1 + j^0) <= (0 + __const_20^0))>
<l3, l1, (undef9 = (2 + j^0)), par{i^0 -> (2 + undef9), j^0 -> undef9}>
<l4, l3, true, par{j^0 -> 0}>
<l5, l4, true>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (j^0 = 0)>
<l3, l2, (undef9 = (2 + j^0)) /\ ((0 + __const_20^0) <= (0 + undef9)), par{j^0 -> undef9}>
<l3, l3, (undef9 = (2 + j^0)) /\ ((1 + undef9) <= (0 + __const_20^0)), par{j^0 -> undef9}>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + undef9 <= __const_20^0 /\ 2 + j^0 = undef9, {j^0 -> undef9, rest remain the same}>
Variables:
__const_20^0, j^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l3, l2, __const_20^0 <= undef9 /\ 2 + j^0 = undef9, {j^0 -> undef9, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000705s
Ranking function: (~(3) / 2) + (1 / 2)*__const_20^0 + (~(1) / 2)*j^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates