/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, ((0 + conditional^0) <= 1) /\ (undef10 = undef10), par{conditional^0 -> undef10}>
<l1, l2, (2 <= (0 + conditional^0)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{INCREASE^0 -> undef15, conditional^0 -> undef23, j_min^0 -> ((0 + undef15) + j_min^0)}>
<l3, l1, ((0 + conditional^0) <= 1) /\ (undef36 = undef36), par{P^0 -> 1, conditional^0 -> undef36}>
<l3, l2, (2 <= (0 + conditional^0)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{INCREASE^0 -> undef41, MAX_MIN^0 -> ((0 + MAX^0) + (~(1) * MIN^0)), MIN^0 -> ((0 + undef41) + MIN^0), NUM_MIN^0 -> undef46, Q^0 -> 1, conditional^0 -> undef49, j_min^0 -> undef50}>
<l4, l3, ((0 + conditional^0) <= 1) /\ (undef62 = undef62), par{conditional^0 -> undef62}>
<l4, l3, (2 <= (0 + conditional^0)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75), par{INCREASE^0 -> undef67, MAX^0 -> ((0 + undef67) + MAX^0), conditional^0 -> undef75}>
<l2, l4, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88), par{conditional^0 -> undef88}>
<l2, l5, ((0 + pid^0) <= (0 + j_min^0)), par{CRITICAL^0 -> 0, P^0 -> 0, Q^0 -> 0}>
<l2, l5, ((1 + num^0) <= (0 + MIN^0)), par{CRITICAL^0 -> 0, P^0 -> 0, Q^0 -> 0}>
<l5, l2, true, par{CRITICAL^0 -> 0, MAX^0 -> (1 + MAX^0), NONCRITICAL^0 -> 1, num^0 -> (1 + MAX^0)}>
<l6, l5, (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133)), par{CRITICAL^0 -> 0, MAX^0 -> undef133, MIN^0 -> undef135, NONCRITICAL^0 -> 1, P^0 -> 0, Q^0 -> 0, j_min^0 -> undef141, pid^0 -> undef143}>
<l7, l6, true>

Fresh variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Undef variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (MAX^0 = (1 + undef133)) /\ (MIN^0 = undef135) /\ (j_min^0 = undef141) /\ (num^0 = (1 + undef133)) /\ (pid^0 = undef143) /\ (undef143 = undef143) /\ (1 <= (0 + undef143)) /\ (undef141 = undef141) /\ (1 <= (0 + undef141)) /\ (undef135 = undef135) /\ (1 <= (0 + undef135)) /\ (undef133 = undef133) /\ ((0 + undef135) <= (0 + undef133))>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10)>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ ((0 + undef62) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{j_min^0 -> ((0 + undef15) + j_min^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ ((0 + undef88) <= 1) /\ (undef62 = undef62) /\ (2 <= (0 + undef62)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + MAX^0) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ ((0 + undef36) <= 1) /\ (undef10 = undef10), par{MAX^0 -> ((0 + undef67) + MAX^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 1) /\ (undef36 = undef36) /\ (2 <= (0 + undef36)) /\ (undef15 = undef15) /\ (1 <= (0 + undef15)) /\ (undef23 = undef23), par{MAX^0 -> ((0 + undef67) + MAX^0), j_min^0 -> ((0 + undef15) + j_min^0)}>
<l2, l2, ((0 + MIN^0) <= (0 + num^0)) /\ ((1 + j_min^0) <= (0 + pid^0)) /\ (undef88 = undef88) /\ (2 <= (0 + undef88)) /\ (undef67 = undef67) /\ (1 <= (0 + undef67)) /\ (undef75 = undef75) /\ (2 <= (0 + undef75)) /\ (undef41 = undef41) /\ (undef46 = ((0 + (~(1) * MIN^0)) + num^0)) /\ ((0 + num^0) <= (0 + undef41)) /\ ((0 + undef41) <= ((0 + ((0 + undef67) + MAX^0)) + (~(1) * MIN^0))) /\ ((0 + undef41) <= (0 + undef46)) /\ (undef50 = undef50) /\ (1 <= (0 + undef50)) /\ (undef49 = undef49), par{MAX^0 -> ((0 + undef67) + MAX^0), MIN^0 -> ((0 + undef41) + MIN^0), j_min^0 -> undef50}>
<l2, l2, ((0 + pid^0) <= (0 + j_min^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}>
<l2, l2, ((1 + num^0) <= (0 + MIN^0)), par{MAX^0 -> (1 + MAX^0), num^0 -> (1 + MAX^0)}>

Fresh variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Undef variables:
undef10, undef15, undef23, undef36, undef41, undef46, undef49, undef50, undef62, undef67, undef75, undef88, undef133, undef135, undef141, undef143, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>
<l2, l2, MIN^0 + undef41 <= MAX^0 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 2 <= undef62 /\ undef88 <= 1 /\ MIN^0 + undef46 = num^0, {MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>
<l2, l2, MIN^0 + undef41 <= MAX^0 + undef67 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 1 <= undef67 /\ 2 <= undef75 /\ 2 <= undef88 /\ MIN^0 + undef46 = num^0, {MAX^0 -> MAX^0 + undef67, MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>
<l2, l2, pid^0 <= j_min^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
<l2, l2, 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MIN^0, j_min^0, num^0, pid^0, MAX^0

Precedence: 
Graph 0

Graph 1
<l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>

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

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

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

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, MIN^0 + undef41 <= MAX^0 + undef67 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 1 <= undef67 /\ 2 <= undef75 /\ 2 <= undef88 /\ MIN^0 + undef46 = num^0, {MAX^0 -> MAX^0 + undef67, MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, MIN^0 + undef41 <= MAX^0 /\ MIN^0 <= num^0 /\ num^0 <= undef41 /\ undef41 <= undef46 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef50 /\ 2 <= undef62 /\ undef88 <= 1 /\ MIN^0 + undef46 = num^0, {MIN^0 -> MIN^0 + undef41, j_min^0 -> undef50, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.050056

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006755s
Ranking function: -2 - 2*j_min^0 + 2*pid^0
New Graphs: 
Transitions:
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
<l2, l2, 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001870s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011282s
[31504 : 31569]
[31504 : 31570]
Successful child: 31569
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Ranking function: MIN^0 - num^0
New Graphs: 
Transitions:
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001793s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009682s
[31504 : 31626]
[31504 : 31627]
Successful child: 31626
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 2 <= undef36 /\ undef62 <= 1 /\ undef88 <= 1, {j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef15 /\ 1 <= undef67 /\ 2 <= undef36 /\ 2 <= undef88 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, j_min^0 -> j_min^0 + undef15, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ undef36 <= 1 /\ undef62 <= 1 /\ undef88 <= 1, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, num^0 <= MAX^0 /\ MIN^0 <= num^0 /\ 1 <= MIN^0 /\ 1 + j_min^0 <= pid^0 /\ 1 <= undef67 /\ 2 <= undef88 /\ undef36 <= 1 /\ undef75 <= 1, {MAX^0 -> MAX^0 + undef67, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, num^0 <= MAX^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000896s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003827s
[31504 : 31770]
[31504 : 31771]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022762s
Time used: 0.022018
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043065s
Time used: 0.043058

LOG: SAT solveNonLinear - Elapsed time: 0.065827s
Cost: 1; Total time: 0.065076
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - num^0
New Graphs: 
Transitions:
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000949s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004353s
[31504 : 33121]
[31504 : 33122]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029195s
Time used: 0.028202
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044974s
Time used: 0.044967

LOG: SAT solveNonLinear - Elapsed time: 0.074169s
Cost: 1; Total time: 0.073169
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= 1 + MIN^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + 50000*MIN^0 + j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001104s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007387s
[31504 : 34533]
[31504 : 34534]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026088s
Time used: 0.025288
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045970s
Time used: 0.045963

LOG: SAT solveNonLinear - Elapsed time: 0.072058s
Cost: 1; Total time: 0.071251
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= j_min^0 + num^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + MIN^0 + 100003*j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001339s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009936s
[31504 : 35965]
[31504 : 35966]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039853s
Time used: 0.039006
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048847s
Time used: 0.04884

LOG: SAT solveNonLinear - Elapsed time: 0.088700s
Cost: 1; Total time: 0.087846
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 + 100007*j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001475s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007629s
[31504 : 37364]
[31504 : 37365]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036724s
Time used: 0.035488
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.055873s
Time used: 0.055866

LOG: SAT solveNonLinear - Elapsed time: 0.092597s
Cost: 1; Total time: 0.091354
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + 100003*MIN^0 - j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001618s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007954s
[31504 : 38785]
[31504 : 38786]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039069s
Time used: 0.038119
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.069360s
Time used: 0.069353

LOG: SAT solveNonLinear - Elapsed time: 0.108430s
Cost: 1; Total time: 0.107472
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 - j_min^0 + num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001746s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010399s
[31504 : 40102]
[31504 : 40103]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050635s
Time used: 0.049581
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049213s
Time used: 0.049205

LOG: SAT solveNonLinear - Elapsed time: 0.099848s
Cost: 1; Total time: 0.098786
Termination implied by a set of invariant(s):
Invariant at l2: 1 + num^0 <= MAX^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 + MIN^0 - j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002118s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.057634s
[31504 : 40268]
[31504 : 40269]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040749s
Time used: 0.039045
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.051213s
Time used: 0.051205

LOG: SAT solveNonLinear - Elapsed time: 0.091962s
Cost: 1; Total time: 0.09025
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 - j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002256s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.077814s
[31504 : 40273]
[31504 : 40274]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039562s
Time used: 0.037815
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.056120s
Time used: 0.056112

LOG: SAT solveNonLinear - Elapsed time: 0.095682s
Cost: 1; Total time: 0.093927
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - 2*MAX^0 - MIN^0 + j_min^0 + num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002506s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022476s
[31504 : 40278]
[31504 : 40279]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050546s
Time used: 0.048737
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.058057s
Time used: 0.058049

LOG: SAT solveNonLinear - Elapsed time: 0.108603s
Cost: 1; Total time: 0.106786
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= 1 + MAX^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 + j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002543s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.118078s
[31504 : 40283]
[31504 : 40284]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041908s
Time used: 0.040021
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054403s
Time used: 0.054395

LOG: SAT solveNonLinear - Elapsed time: 0.096311s
Cost: 1; Total time: 0.094416
Termination implied by a set of invariant(s):
Invariant at l2: 1 <= MAX^0 + j_min^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002738s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.068271s
[31504 : 40683]
[31504 : 40684]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043327s
Time used: 0.04135
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.064950s
Time used: 0.064942

LOG: SAT solveNonLinear - Elapsed time: 0.108276s
Cost: 1; Total time: 0.106292
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= 1 + MAX^0 + MIN^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 + j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002932s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.038155s
[31504 : 40688]
[31504 : 40689]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037532s
Time used: 0.035488
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067169s
Time used: 0.067159

LOG: SAT solveNonLinear - Elapsed time: 0.104701s
Cost: 1; Total time: 0.102647
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003085s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.138519s
[31504 : 40693]
[31504 : 40694]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041962s
Time used: 0.039782
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080946s
Time used: 0.080938

LOG: SAT solveNonLinear - Elapsed time: 0.122908s
Cost: 1; Total time: 0.12072
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= 1 + MIN^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 - j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003290s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.147553s
[31504 : 40844]
[31504 : 40845]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050462s
Time used: 0.048177
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.078655s
Time used: 0.078647

LOG: SAT solveNonLinear - Elapsed time: 0.129117s
Cost: 1; Total time: 0.126824
Quasi-ranking function: 50000 - MAX^0 + MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003338s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.021825s
[31504 : 41104]
[31504 : 41105]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045291s
Time used: 0.042897
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061939s
Time used: 0.06193

LOG: SAT solveNonLinear - Elapsed time: 0.107230s
Cost: 1; Total time: 0.104827
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= MAX^0 + MIN^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 + MIN^0 - j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003588s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.418100s
[31504 : 41113]
[31504 : 41114]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052457s
Time used: 0.050233
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079083s
Time used: 0.079075

LOG: SAT solveNonLinear - Elapsed time: 0.131541s
Cost: 1; Total time: 0.129308
Quasi-ranking function: 50000 - MAX^0 + MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003777s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.071525s
[31504 : 41118]
[31504 : 41119]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043695s
Time used: 0.041197
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.075363s
Time used: 0.075354

LOG: SAT solveNonLinear - Elapsed time: 0.119058s
Cost: 1; Total time: 0.116551
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= MIN^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 + j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003920s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.170368s
[31504 : 41133]
[31504 : 41134]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064943s
Time used: 0.062474
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.070706s
Time used: 0.070698

LOG: SAT solveNonLinear - Elapsed time: 0.135649s
Cost: 1; Total time: 0.133172
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 + 2*MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004149s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.148673s
[31504 : 41138]
[31504 : 41139]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054578s
Time used: 0.051947
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068552s
Time used: 0.068545

LOG: SAT solveNonLinear - Elapsed time: 0.123130s
Cost: 1; Total time: 0.120492
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004301s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.025384s
[31504 : 41143]
[31504 : 41144]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061414s
Time used: 0.058596
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082884s
Time used: 0.082875

LOG: SAT solveNonLinear - Elapsed time: 0.144297s
Cost: 1; Total time: 0.141471
Termination implied by a set of invariant(s):
Invariant at l2: 1 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 - j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004434s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.276479s
[31504 : 41159]
[31504 : 41160]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051560s
Time used: 0.048992
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.079002s
Time used: 0.078993

LOG: SAT solveNonLinear - Elapsed time: 0.130562s
Cost: 1; Total time: 0.127985
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004558s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026785s
[31504 : 41184]
[31504 : 41185]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077200s
Time used: 0.074237
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.116503s
Time used: 0.116494

LOG: SAT solveNonLinear - Elapsed time: 0.193703s
Cost: 1; Total time: 0.190731
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004681s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.094852s
[31504 : 41195]
[31504 : 41196]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053759s
Time used: 0.050712
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080886s
Time used: 0.080878

LOG: SAT solveNonLinear - Elapsed time: 0.134644s
Cost: 1; Total time: 0.13159
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004832s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.110322s
[31504 : 41201]
[31504 : 41202]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.063918s
Time used: 0.061364
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072599s
Time used: 0.072591

LOG: SAT solveNonLinear - Elapsed time: 0.136517s
Cost: 1; Total time: 0.133955
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 + j_min^0 - 2*num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004975s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.057960s
[31504 : 41206]
[31504 : 41207]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.071213s
Time used: 0.069016
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.088306s
Time used: 0.088298

LOG: SAT solveNonLinear - Elapsed time: 0.159519s
Cost: 1; Total time: 0.157314
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= 1 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MAX^0 - MIN^0 - j_min^0 - 2*num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005088s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029598s
[31504 : 41211]
[31504 : 41212]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065032s
Time used: 0.061976
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.110326s
Time used: 0.110317

LOG: SAT solveNonLinear - Elapsed time: 0.175358s
Cost: 1; Total time: 0.172293
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= 1 + MAX^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 - j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005297s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.032875s
[31504 : 41222]
[31504 : 41223]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.069566s
Time used: 0.067155
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.078768s
Time used: 0.07876

LOG: SAT solveNonLinear - Elapsed time: 0.148333s
Cost: 1; Total time: 0.145915
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= 1 + j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0 - num^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005490s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.032373s
[31504 : 41329]
[31504 : 41330]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067401s
Time used: 0.064398
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.095626s
Time used: 0.095617

LOG: SAT solveNonLinear - Elapsed time: 0.163027s
Cost: 1; Total time: 0.160015
Termination implied by a set of invariant(s):
Invariant at l2: MIN^0 <= j_min^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005634s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.059761s
[31504 : 41334]
[31504 : 41335]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070869s
Time used: 0.067846
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.096114s
Time used: 0.096105

LOG: SAT solveNonLinear - Elapsed time: 0.166983s
Cost: 1; Total time: 0.163951
Termination implied by a set of invariant(s):
Invariant at l2: 1 <= MIN^0 + num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MIN^0 - j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005892s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.189621s
[31504 : 41339]
[31504 : 41340]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074078s
Time used: 0.071744
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074287s
Time used: 0.074279

LOG: SAT solveNonLinear - Elapsed time: 0.148365s
Cost: 1; Total time: 0.146023
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= MIN^0 + num^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 + j_min^0 - num^0 - pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006083s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.068819s
[31504 : 41344]
[31504 : 41345]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104328s
Time used: 0.101442
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.107480s
Time used: 0.107471

LOG: SAT solveNonLinear - Elapsed time: 0.211809s
Cost: 1; Total time: 0.208913
Termination implied by a set of invariant(s):
Invariant at l2: num^0 <= 1 + MAX^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 + MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006233s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.472870s
[31504 : 41349]
[31504 : 41350]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070926s
Time used: 0.06749
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.085040s
Time used: 0.085032

LOG: SAT solveNonLinear - Elapsed time: 0.155966s
Cost: 1; Total time: 0.152522
Termination implied by a set of invariant(s):
Invariant at l2: MAX^0 <= num^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MIN^0 + j_min^0 - num^0 + pid^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006318s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.048467s
[31504 : 41354]
[31504 : 41355]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083313s
Time used: 0.080067
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.088769s
Time used: 0.08876

LOG: SAT solveNonLinear - Elapsed time: 0.172082s
Cost: 1; Total time: 0.168827
Termination implied by a set of invariant(s):
Invariant at l2: 1 <= MIN^0 + pid^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 + num^0 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ 1 <= num^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Quasi-ranking function: 50000 - MAX^0 - MIN^0 - j_min^0
New Graphs: 
Transitions:
<l2, l2, MAX^0 <= MIN^0 + num^0 /\ MAX^0 <= MIN^0 + num^0 + pid^0 /\ MAX^0 <= j_min^0 + num^0 + pid^0 /\ 0 <= MAX^0 + MIN^0 + num^0 /\ MIN^0 <= j_min^0 + num^0 /\ pid^0 <= j_min^0 /\ 0 <= pid^0 /\ 1 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 1 <= MAX^0 + j_min^0 /\ 1 + num^0 <= MAX^0 + pid^0 /\ 1 <= MIN^0 /\ 1 <= MIN^0 + num^0 /\ 1 <= MIN^0 + pid^0 /\ MAX^0 <= 1 + j_min^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + num^0 /\ MIN^0 <= 1 + MAX^0 + pid^0 /\ 0 <= 1 + MAX^0 + MIN^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 + pid^0 <= 2*num^0 /\ 50001 + MAX^0 + MIN^0 + j_min^0 <= 2*num^0 + pid^0 /\ 50001 + MAX^0 + MIN^0 + pid^0 <= j_min^0 + 2*num^0 /\ 50001 + MAX^0 + MIN^0 <= j_min^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + j_min^0 + pid^0 <= MIN^0 + 2*num^0 /\ 50001 + MAX^0 + j_min^0 <= MIN^0 + 2*num^0 + pid^0 /\ 50001 + MAX^0 + pid^0 <= MIN^0 + j_min^0 + 2*num^0 /\ 50001 + MAX^0 <= MIN^0 + j_min^0 + 2*num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= MAX^0 + num^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + num^0 + pid^0 /\ 50001 + MIN^0 + j_min^0 <= MAX^0 + pid^0 /\ 50001 + MIN^0 <= MAX^0 + j_min^0 + num^0 + pid^0 /\ 50001 + 2*MIN^0 + pid^0 <= MAX^0 + j_min^0 + num^0 /\ 50001 + j_min^0 + pid^0 <= MAX^0 + MIN^0 + num^0 /\ 50001 + j_min^0 <= MAX^0 + MIN^0 + num^0 + pid^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 + pid^0 <= MAX^0 + MIN^0 + j_min^0 + num^0 /\ 50001 <= MAX^0 + MIN^0 + j_min^0 + num^0 + pid^0 /\ 50001 + MIN^0 + num^0 <= 2*MAX^0 + j_min^0 + pid^0 /\ 50001 + MIN^0 + 100003*j_min^0 + num^0 + pid^0 <= 2*MAX^0 /\ 50001 + j_min^0 + num^0 <= 2*MAX^0 + MIN^0 + pid^0 /\ 50001 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 + j_min^0 /\ 50001 + num^0 <= 2*MAX^0 + MIN^0 + j_min^0 + pid^0 /\ 50001 + 100007*j_min^0 + num^0 + pid^0 <= 2*MAX^0 + MIN^0 /\ 50001 + 50000*MIN^0 + j_min^0 + num^0 <= 2*MAX^0 + pid^0 /\ 50001 + 100003*MIN^0 + num^0 + pid^0 <= 2*MAX^0 + j_min^0 /\ 50001 + MIN^0 + j_min^0 + pid^0 <= num^0 /\ 50001 + MIN^0 + j_min^0 <= num^0 + pid^0 /\ 50001 + MIN^0 + pid^0 <= j_min^0 + num^0 /\ 50001 + MIN^0 <= j_min^0 + num^0 + pid^0 /\ 50001 + j_min^0 + pid^0 <= MIN^0 + num^0 /\ 50001 + pid^0 <= MIN^0 + j_min^0 + num^0 /\ 50001 <= num^0 /\ MAX^0 = num^0, {MAX^0 -> 1 + MAX^0, num^0 -> 1 + MAX^0, rest remain the same}>
Variables:
MAX^0, MIN^0, j_min^0, num^0, pid^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006511s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.561324s
[31504 : 41359]
[31504 : 41360]
Timeout expired!
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, undef135 <= undef133 /\ 1 <= undef135 /\ 1 <= undef141 /\ 1 <= undef143 /\ MIN^0 = undef135 /\ j_min^0 = undef141 /\ pid^0 = undef143 /\ MAX^0 = 1 + undef133 /\ num^0 = 1 + undef133, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005355s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.005542s
Cannot prove unreachability

[31504 : 41364]
[31504 : 41365]
Successful child: 41364

Program does NOT terminate