YES

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

Fresh variables:
undef12, 

Undef variables:
undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef12 = undef12)>
<l0, l3, (undef12 = undef12)>

Fresh variables:
undef12, 

Undef variables:
undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, true, {all remain the same}>
<l0, l3, true, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Analyzing SCC {l3}...
No cycles found.

Program Terminates