YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l28, true>
<l1, l2, true>
<l3, l4, true>
<l5, l3, true>
<l5, l3, true>
<l6, l7, true>
<l8, l9, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}>
<l8, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l11, l12, true>
<l13, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155), par{tau^0 -> undef155}>
<l13, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}>
<l15, l16, ((1 + n^0) <= (0 + j^0))>
<l15, l14, ((0 + j^0) <= (0 + n^0))>
<l17, l18, true>
<l19, l9, true>
<l20, l19, (undef269 = undef269) /\ (undef270 = undef270), par{sigma^0 -> (0 + (~(1) * undef270)), tmp___4^0 -> undef269, tmp___5^0 -> undef270}>
<l20, l19, (undef285 = undef285) /\ (undef286 = undef286), par{sigma^0 -> (0 + undef286), tmp___2^0 -> undef285, tmp___3^0 -> undef286}>
<l21, l22, (undef302 = undef302), par{tmp___1^0 -> undef302}>
<l9, l15, true>
<l22, l17, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}>
<l23, l21, (1 <= (0 + sqrarg^0))>
<l23, l21, ((1 + sqrarg^0) <= 0)>
<l23, l22, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}>
<l18, l20, ((1 + n^0) <= (0 + i^0))>
<l18, l23, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423), par{sqrarg^0 -> undef423}>
<l14, l13, true>
<l12, l17, ((1 + n^0) <= (0 + i^0))>
<l12, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l16, l1, true, par{k^0 -> (1 + k^0)}>
<l24, l11, (1 <= (0 + scale^0))>
<l24, l11, ((1 + scale^0) <= 0)>
<l24, l16, ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)), par{tmp___0^0 -> 0}>
<l25, l6, true, par{i^0 -> (1 + i^0)}>
<l10, l8, true>
<l26, l25, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{scale^0 -> (0 + maxarg2^0)}>
<l26, l25, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{scale^0 -> (0 + maxarg1^0)}>
<l7, l24, ((1 + n^0) <= (0 + i^0))>
<l7, l26, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660), par{maxarg1^0 -> (0 + scale^0), maxarg2^0 -> (0 + undef660), tmp^0 -> undef660}>
<l2, l5, ((0 + n^0) <= (0 + k^0))>
<l2, l6, ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}>
<l27, l1, (2 <= (0 + n^0))>
<l28, l27, true>

Fresh variables:
undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 

Undef variables:
undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))>
<l0, l4, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))>
<l0, l6, (2 <= (0 + n^0)) /\ ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}>
<l6, l11, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + scale^0))>
<l6, l11, ((1 + n^0) <= (0 + i^0)) /\ ((1 + scale^0) <= 0)>
<l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l6, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l6, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
<l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((0 + (0 + scale^0)) <= (0 + (0 + undef660))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + undef660))}>
<l6, l6, ((0 + i^0) <= (0 + n^0)) /\ (undef660 = undef660) /\ ((1 + (0 + undef660)) <= (0 + (0 + scale^0))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + scale^0))}>
<l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
<l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}>
<l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}>
<l10, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0)}>
<l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l11, l17, ((1 + n^0) <= (0 + i^0))>
<l11, l11, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l14, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef155 = undef155)>
<l14, l14, ((0 + i^0) <= (0 + n^0)) /\ (undef172 = undef172), par{i^0 -> (1 + i^0), sum^0 -> undef172}>
<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
<l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef269 = undef269) /\ (undef270 = undef270) /\ ((0 + j^0) <= (0 + n^0))>
<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l17, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}>
<l17, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}>
<l17, l14, ((1 + n^0) <= (0 + i^0)) /\ (undef285 = undef285) /\ (undef286 = undef286) /\ ((0 + j^0) <= (0 + n^0))>
<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ (1 <= (0 + undef423)) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}>
<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((1 + undef423) <= 0) /\ (undef302 = undef302), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + undef302)}>
<l17, l17, ((0 + i^0) <= (0 + n^0)) /\ (undef423 = undef423) /\ ((0 + undef423) <= 0) /\ (0 <= (0 + undef423)), par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + 0)}>

Fresh variables:
undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 

Undef variables:
undef155, undef172, undef269, undef270, undef285, undef286, undef302, undef423, undef660, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l11, 1 + n^0 <= i^0 /\ 1 <= scale^0, {all remain the same}>
<l6, l11, 1 + n^0 <= i^0 /\ 1 + scale^0 <= 0, {all remain the same}>
<l6, l6, 1 + n^0 <= i^0 /\ 2 + k^0 <= n^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
<l6, l6, i^0 <= n^0 /\ scale^0 <= undef660, {i^0 -> 1 + i^0, scale^0 -> undef660, rest remain the same}>
<l6, l6, 1 + undef660 <= scale^0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l10, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0, {j^0 -> 1 + j^0, rest remain the same}>
<l10, l10, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l11, l17, 1 + n^0 <= i^0, {all remain the same}>
<l11, l11, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
<l14, l10, 1 + n^0 <= i^0, {all remain the same}>
<l14, l14, i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> undef172, rest remain the same}>
<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
<l17, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>
<l17, l14, 1 + n^0 <= i^0 /\ j^0 <= n^0, {all remain the same}>
<l17, l17, 1 <= undef423 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
<l17, l17, 1 + undef423 <= 0 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
<l17, l17, i^0 <= n^0 /\ undef423 = 0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0, scale^0, k^0, j^0, sum^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l6, 1 + k^0 <= n^0 /\ 2 <= n^0, {scale^0 -> 0, rest remain the same}>

Graph 2
<l0, l4, n^0 <= k^0 /\ 2 <= n^0, {all remain the same}>
<l0, l4, n^0 <= k^0 /\ 2 <= n^0, {all remain the same}>
<l6, l4, 1 + n^0 <= i^0 /\ n^0 <= 1 + k^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, rest remain the same}>
<l6, l4, 1 + n^0 <= i^0 /\ n^0 <= 1 + k^0 /\ scale^0 = 0, {k^0 -> 1 + k^0, rest remain the same}>
<l10, l4, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ n^0 <= 1 + k^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
<l10, l4, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ n^0 <= 1 + k^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, rest remain the same}>
<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>
<l17, l4, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ n^0 <= 1 + k^0, {k^0 -> 1 + k^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 2 )
( 6 , 1 )
( 10 , 1 )
( 11 , 1 )
( 14 , 1 )
( 17 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.218446
Some transition disabled by a set of invariant(s):
Invariant at l6: 0 <= scale^0
Invariant at l10: j^0 <= 1 + i^0
Invariant at l11: 1 + n^0 <= i^0 + scale^0
Invariant at l14: j^0 <= 1 + i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l6, l11, 1 + n^0 <= i^0 /\ 1 + scale^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^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, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^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, l10, i^0 <= n^0 /\ j^0 <= 1 + i^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): 
<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, 1 + n^0 <= i^0 + scale^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): 
<l14, l10, 1 + n^0 <= i^0 /\ j^0 <= 1 + i^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 0.123424
Some transition disabled by a set of invariant(s):
Invariant at l6: 1 + k^0 <= n^0
Invariant at l10: 1 + n^0 <= i^0
Invariant at l11: 1 + k^0 <= n^0
Invariant at l17: 1 + k^0 <= n^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, i^0 <= n^0 /\ j^0 <= 1 + i^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): 
<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= scale^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^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, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^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): 
<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ 1 + k^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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^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): 
<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^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): 
<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^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, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^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): 
<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Checking unfeasibility...
Time used: 0.178673
Some transition disabled by a set of invariant(s):
Invariant at l6: k^0 <= n^0 + scale^0
Invariant at l10: k^0 <= 1 + n^0
Invariant at l11: 1 + n^0 <= i^0
Invariant at l14: k^0 <= 1 + n^0
Invariant at l17: k^0 <= i^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l11, l11, 1 + n^0 <= i^0 + scale^0 /\ 1 + k^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): 
<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 <= scale^0 /\ k^0 <= n^0 + scale^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + k^0 <= n^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ k^0 <= n^0 + scale^0 /\ 0 <= scale^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, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + 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): 
<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^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 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^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): 
<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^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): 
<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l17, l17, 1 + k^0 <= n^0 /\ i^0 <= n^0 /\ k^0 <= i^0 /\ undef423 = 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): 
<l6, l11, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 <= scale^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + k^0 <= n^0 /\ 1 + k^0 <= n^0 + scale^0 /\ 1 + undef660 <= scale^0 /\ i^0 <= n^0 /\ 0 <= scale^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, l6, 1 + n^0 <= i^0 /\ n^0 <= j^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ 2 + k^0 <= n^0, {j^0 -> 1 + j^0, k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ k^0 <= 1 + 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): 
<l11, l17, 1 + n^0 <= i^0 /\ 1 + n^0 <= i^0 + scale^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l14, 1 + n^0 <= i^0 /\ 1 + k^0 <= n^0 /\ k^0 <= i^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): 
<l17, l6, 1 + n^0 <= i^0 /\ 1 + n^0 <= j^0 /\ k^0 <= i^0 /\ 2 + k^0 <= n^0, {k^0 -> 1 + k^0, scale^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l17, 1 + k^0 <= n^0 /\ 1 <= undef423 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l17, 1 + k^0 <= n^0 /\ 1 + undef423 <= 0 /\ i^0 <= n^0 /\ k^0 <= i^0, {i^0 -> 1 + i^0, sum^0 -> sum^0 + undef302, rest remain the same}>
Checking unfeasibility...
Time used: 0.293937

Checking conditional termination of SCC {l6, l10, l11, l14, l17}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005814s
Ranking function: -2 + 3*i^0 - k^0 - 2*n^0
New Graphs: 
Transitions:
<l14, l14, 1 + n^0 <= i^0 /\ 1 + j^0 <= n^0 /\ j^0 <= 1 + i^0 /\ k^0 <= 1 + i^0 /\ k^0 <= 1 + n^0, {j^0 -> 1 + j^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.001833s
Ranking function: -1 - j^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l4}...
No cycles found.

Program Terminates