YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l11, true>
<l1, l2, true>
<l3, l4, true>
<l5, l3, true>
<l5, l3, true>
<l6, l7, true, par{j^0 -> (1 + j^0)}>
<l7, l8, true>
<l9, l6, (undef33 = undef33), par{tmp5^0 -> undef33, x3^0 -> (0 + j^0), y4^0 -> (1 + j^0)}>
<l9, l6, true>
<l8, l1, ((0 + i^0) <= (0 + j^0)), par{i^0 -> (~(1) + i^0)}>
<l8, l9, ((1 + j^0) <= (0 + i^0))>
<l2, l5, ((1 + i^0) <= 0)>
<l2, l7, (0 <= (0 + i^0))>
<l10, l1, true, par{i^0 -> 4, j^0 -> 0}>
<l11, l10, true>

Fresh variables:
undef33, 

Undef variables:
undef33, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (i^0 = 4) /\ (j^0 = 0) /\ (0 <= (0 + 4))>
<l7, l4, ((0 + i^0) <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= 0), par{i^0 -> (~(1) + i^0)}>
<l7, l4, ((0 + i^0) <= (0 + j^0)) /\ ((1 + (~(1) + i^0)) <= 0), par{i^0 -> (~(1) + i^0)}>
<l7, l7, ((0 + i^0) <= (0 + j^0)) /\ (0 <= (0 + (~(1) + i^0))), par{i^0 -> (~(1) + i^0)}>
<l7, l7, ((1 + j^0) <= (0 + i^0)) /\ (undef33 = undef33), par{j^0 -> (1 + j^0)}>
<l7, l7, ((1 + j^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>

Fresh variables:
undef33, 

Undef variables:
undef33, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, 1 <= i^0 /\ i^0 <= j^0, {i^0 -> -1 + i^0, rest remain the same}>
<l7, l7, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
<l7, l7, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
i^0, j^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, j^0 = 0 /\ i^0 = 4, {all remain the same}>

Graph 2
<l7, l4, i^0 <= 0 /\ i^0 <= j^0, {i^0 -> -1 + i^0, rest remain the same}>
<l7, l4, i^0 <= 0 /\ i^0 <= j^0, {i^0 -> -1 + i^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 2 )
( 7 , 1 )

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000711s
Ranking function: i^0
New Graphs: 
Transitions:
<l7, l7, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
<l7, l7, 1 + j^0 <= i^0, {j^0 -> 1 + j^0, rest remain the same}>
Variables:
i^0, j^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000573s
Ranking function: -1 + i^0 - j^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l4}...
No cycles found.

Program Terminates