YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l33, true>
<l1, l2, ((1 + n^0) <= (0 + j^0))>
<l1, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21), par{temp^0 -> (0 + undef21), tmp^0 -> undef21}>
<l4, l1, true>
<l5, l6, true, par{j^0 -> (1 + j^0)}>
<l7, l5, ((1 + n^0) <= (0 + i^0))>
<l7, l8, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l8, l7, true>
<l9, l8, (undef79 = undef79), par{dum^0 -> undef79}>
<l10, l5, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0))>
<l10, l9, ((1 + n^0) <= (0 + j^0))>
<l10, l9, ((1 + j^0) <= (0 + n^0))>
<l11, l10, true>
<l11, l10, true>
<l11, l10, true>
<l12, l11, true>
<l13, l12, ((1 + n^0) <= (0 + k^0))>
<l13, l14, ((0 + k^0) <= (0 + n^0)) /\ (undef178 = undef178), par{dum^0 -> undef178, k^0 -> (1 + k^0)}>
<l14, l13, true>
<l15, l12, ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0))>
<l15, l14, ((1 + imax^0) <= (0 + j^0))>
<l15, l14, ((1 + j^0) <= (0 + imax^0))>
<l16, l17, true, par{i^0 -> (1 + i^0)}>
<l18, l16, ((1 + dum^0) <= (0 + big^0))>
<l18, l16, ((0 + big^0) <= (0 + dum^0)), par{big^0 -> (0 + dum^0), imax^0 -> (0 + i^0)}>
<l19, l6, ((1 + n^0) <= (0 + i^0))>
<l19, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}>
<l20, l18, ((0 + j^0) <= (0 + k^0)) /\ (undef297 = undef297) /\ (undef288 = undef288), par{dum^0 -> undef288, tmp___0^0 -> undef297}>
<l20, l21, ((1 + k^0) <= (0 + j^0)) /\ (undef305 = undef305), par{k^0 -> (1 + k^0), sum^0 -> undef305}>
<l21, l20, true>
<l22, l15, ((1 + n^0) <= (0 + i^0))>
<l22, l21, ((0 + i^0) <= (0 + n^0)) /\ (undef338 = undef338), par{sum^0 -> undef338}>
<l23, l19, true>
<l17, l22, true>
<l24, l25, ((0 + i^0) <= (0 + k^0)), par{i^0 -> (1 + i^0)}>
<l24, l26, ((1 + k^0) <= (0 + i^0)) /\ (undef382 = undef382), par{k^0 -> (1 + k^0), sum^0 -> undef382}>
<l26, l24, true>
<l27, l17, ((0 + j^0) <= (0 + i^0)), par{big^0 -> 0}>
<l27, l26, ((1 + i^0) <= (0 + j^0)) /\ (undef415 = undef415), par{sum^0 -> undef415}>
<l25, l27, true>
<l28, l29, ((1 + n^0) <= (0 + j^0))>
<l28, l25, ((0 + j^0) <= (0 + n^0))>
<l6, l28, true>
<l30, l23, true>
<l31, l23, true, par{i^0 -> (1 + i^0)}>
<l2, l31, (1 <= (0 + big^0))>
<l2, l31, ((1 + big^0) <= 0)>
<l2, l31, ((0 + big^0) <= 0) /\ (0 <= (0 + big^0))>
<l32, l4, true, par{j^0 -> (1 + j^0)}>
<l3, l32, ((0 + temp^0) <= (0 + big^0))>
<l3, l32, ((1 + big^0) <= (0 + temp^0)), par{big^0 -> (0 + temp^0)}>
<l33, l30, true>

Fresh variables:
undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 

Undef variables:
undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + j^0))>
<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
<l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
<l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + j^0)), par{big^0 -> 0}>
<l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + j^0) <= (0 + imax^0)), par{big^0 -> 0}>
<l0, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}>
<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
<l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
<l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}>
<l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((0 + (0 + undef21)) <= (0 + big^0)), par{j^0 -> (1 + j^0)}>
<l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((1 + big^0) <= (0 + (0 + undef21))), par{big^0 -> (0 + (0 + undef21)), j^0 -> (1 + j^0)}>
<l8, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0)}>
<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
<l8, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
<l8, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + (1 + j^0))), par{big^0 -> 0, j^0 -> (1 + j^0)}>
<l8, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)) /\ ((0 + (1 + j^0)) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + (1 + j^0)) <= (0 + imax^0)), par{big^0 -> 0, j^0 -> (1 + j^0)}>
<l8, l8, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l10, l29, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0)}>
<l10, l8, ((1 + n^0) <= (0 + j^0)) /\ (undef79 = undef79)>
<l10, l8, ((1 + j^0) <= (0 + n^0)) /\ (undef79 = undef79)>
<l14, l10, ((1 + n^0) <= (0 + k^0))>
<l14, l10, ((1 + n^0) <= (0 + k^0))>
<l14, l10, ((1 + n^0) <= (0 + k^0))>
<l14, l14, ((0 + k^0) <= (0 + n^0)) /\ (undef178 = undef178), par{k^0 -> (1 + k^0)}>

Fresh variables:
undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 

Undef variables:
undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l8, l8, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l8, 1 + n^0 <= j^0, {all remain the same}>
<l10, l8, 1 + j^0 <= n^0, {all remain the same}>
<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
<l14, l10, 1 + n^0 <= k^0, {all remain the same}>
<l14, l14, k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
Variables:
i^0, imax^0, j^0, n^0, k^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, i^0 <= n^0, {big^0 -> 0, rest remain the same}>

Graph 2
<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
<l0, l10, 1 + n^0 <= i^0 /\ j^0 <= i^0 /\ j^0 <= n^0 /\ imax^0 = j^0, {big^0 -> 0, rest remain the same}>
<l0, l14, 1 + n^0 <= i^0 /\ 1 + imax^0 <= j^0 /\ j^0 <= i^0 /\ j^0 <= n^0, {big^0 -> 0, rest remain the same}>
<l0, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= imax^0 /\ j^0 <= i^0 /\ j^0 <= n^0, {big^0 -> 0, rest remain the same}>

Graph 3
<l0, l29, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0, {all remain the same}>
<l4, l29, 1 <= big^0 /\ 1 + n^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l4, l29, 1 + big^0 <= 0 /\ 1 + n^0 <= j^0 /\ n^0 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l4, l29, 1 + n^0 <= j^0 /\ n^0 <= i^0 /\ big^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
<l8, l29, 1 + n^0 <= i^0 /\ n^0 <= j^0, {j^0 -> 1 + j^0, rest remain the same}>
<l10, l29, j^0 = n^0, {j^0 -> 1 + j^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 1 )
( 8 , 2 )
( 10 , 2 )
( 14 , 2 )
( 29 , 3 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.020185
Some transition disabled by a set of invariant(s):
Invariant at l4: 0 <= big^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l4, l4, 1 + big^0 <= 0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= big^0 /\ 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= n^0 /\ 1 + n^0 <= j^0 /\ big^0 = 0, {big^0 -> 0, i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= big^0 /\ undef21 <= big^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + big^0 <= undef21 /\ 0 <= big^0 /\ j^0 <= n^0, {big^0 -> undef21, j^0 -> 1 + j^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.011355

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003358s
Ranking function: -2 - 2*i^0 + 2*n^0
New Graphs: 
Transitions:
<l4, l4, 0 <= big^0 /\ undef21 <= big^0 /\ j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
<l4, l4, 1 + big^0 <= undef21 /\ 0 <= big^0 /\ j^0 <= n^0, {big^0 -> undef21, j^0 -> 1 + j^0, rest remain the same}>
Variables:
big^0, j^0, n^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001635s
Ranking function: -j^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.102308
Some transition disabled by a set of invariant(s):
Invariant at l8: 1 + j^0 <= n^0
Invariant at l10: j^0 <= n^0
Invariant at l14: j^0 <= n^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l8, 1 + n^0 <= j^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l8, 1 + j^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l8, 1 + j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.073493
Some transition disabled by a set of invariant(s):
Invariant at l8: 1 + n^0 <= i^0
Invariant at l10: 1 + n^0 <= i^0
Invariant at l14: 1 + n^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l8, l8, 1 + j^0 <= n^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l10, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 = 1 + j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ imax^0 <= j^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l10, 1 + n^0 <= i^0 /\ 1 + n^0 <= k^0 /\ j^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.079041

Checking conditional termination of SCC {l8, l10, l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010145s
Ranking function: 1 + 4*i^0 - 2*imax^0 - j^0 - n^0
New Graphs: 
Transitions:
<l8, l14, 1 + j^0 <= i^0 /\ 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 2 + j^0 <= imax^0, {big^0 -> 0, j^0 -> 1 + j^0, rest remain the same}>
<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
<l14, l8, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ 1 + n^0 <= k^0, {all remain the same}>
<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
Variables:
i^0, imax^0, j^0, k^0, n^0
Checking conditional termination of SCC {l8, l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002155s
Ranking function: -2 + 4*imax^0 - 4*j^0
New Graphs: 
Transitions:
<l14, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0 /\ k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
Variables:
i^0, j^0, k^0, n^0
Checking conditional termination of SCC {l14}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001565s
Ranking function: -k^0 + n^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l29}...
No cycles found.

Program Terminates