/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, l10, true>
<l1, l2, true>
<l3, l4, (1 <= (0 + choice^0)), par{walker^0 -> (1 + walker^0)}>
<l3, l4, ((0 + choice^0) <= 0), par{walker^0 -> (~(1) + walker^0)}>
<l5, l4, (undef26 = 1) /\ (undef28 = undef28) /\ (0 <= (0 + undef28)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 2) /\ (2 <= (0 + undef22)), par{N^0 -> undef22, i^0 -> (0 + undef26), pos^0 -> 0, seq^0 -> undef26, walker^0 -> 1, z^0 -> undef28}>
<l6, l3, ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)), par{i^0 -> (0 + undef33), seq^0 -> undef33, z^0 -> undef35}>
<l6, l3, (1 <= (0 + i^0)) /\ ((0 + choice^0) <= 0), par{i^0 -> (~(1) + i^0)}>
<l7, l3, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}>
<l7, l6, ((0 + z^0) <= 0)>
<l8, l1, ((1 + walker^0) <= 1)>
<l8, l7, (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1), par{choice^0 -> undef65}>
<l9, l1, ((1 + N^0) <= (0 + walker^0))>
<l9, l8, ((0 + walker^0) <= (0 + N^0))>
<l4, l9, true>
<l10, l5, true>

Fresh variables:
undef22, undef26, undef28, undef33, undef35, undef65, 

Undef variables:
undef22, undef26, undef28, undef33, undef35, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (N^0 = undef22) /\ (i^0 = (0 + undef26)) /\ (seq^0 = undef26) /\ (walker^0 = 1) /\ (z^0 = undef28) /\ (undef26 = 1) /\ (undef28 = undef28) /\ (0 <= (0 + undef28)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 2) /\ (2 <= (0 + undef22))>
<l4, l2, ((1 + N^0) <= (0 + walker^0))>
<l4, l2, ((0 + walker^0) <= (0 + N^0)) /\ ((1 + walker^0) <= 1)>
<l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ (1 <= (0 + z^0)) /\ (1 <= (0 + undef65)), par{walker^0 -> (1 + walker^0), z^0 -> (~(1) + z^0)}>
<l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ (1 <= (0 + z^0)) /\ ((0 + undef65) <= 0), par{walker^0 -> (~(1) + walker^0), z^0 -> (~(1) + z^0)}>
<l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ (1 <= (0 + undef65)), par{i^0 -> (0 + undef33), seq^0 -> undef33, walker^0 -> (1 + walker^0), z^0 -> undef35}>
<l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ ((0 + undef65) <= 0), par{i^0 -> (0 + undef33), seq^0 -> undef33, walker^0 -> (~(1) + walker^0), z^0 -> undef35}>
<l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + undef65) <= 0) /\ ((0 + undef65) <= 0), par{i^0 -> (~(1) + i^0), walker^0 -> (~(1) + walker^0)}>

Fresh variables:
undef22, undef26, undef28, undef33, undef35, undef65, 

Undef variables:
undef22, undef26, undef28, undef33, undef35, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 <= 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, walker^0, z^0, i^0, seq^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, 0 <= undef28 /\ N^0 = undef22 /\ i^0 = undef26 /\ seq^0 = undef26 /\ z^0 = undef28 /\ walker^0 = 1 /\ undef26 = 1 /\ undef22 = 2, {all remain the same}>

Graph 2
<l4, l2, 1 + N^0 <= walker^0, {all remain the same}>
<l4, l2, walker^0 <= N^0 /\ walker^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004944s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.130958s
[12933 : 13004]
[12933 : 13005]
Successful child: 13004
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
New Graphs: 
Transitions:
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003382s
Ranking function: -4 + 4*z^0
New Graphs: 
Transitions:
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001372s
Ranking function: -1 + i^0
New Graphs: 

LOG: CALL check - Post:walker^0 + z^0 <= i^0 - Process 1
* Exit transition: <l0, l4, 0 <= undef28 /\ N^0 = undef22 /\ i^0 = undef26 /\ seq^0 = undef26 /\ z^0 = undef28 /\ walker^0 = 1 /\ undef26 = 1 /\ undef22 = 2, {all remain the same}>
* Postcondition  : walker^0 + z^0 <= i^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001308s
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: walker^0 + z^0 <= i^0 , 0 <= z^0 , 
Narrowing transition: 
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 <= 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 <= 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, walker^0, z^0, i^0, seq^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008626s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.805677s
[12933 : 14634]
[12933 : 14635]
Successful child: 14634
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ walker^0 + z^0 <= i^0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ 1 + z^0 <= 0 /\ walker^0 <= N^0 /\ walker^0 + z^0 <= i^0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
New Graphs: 
Transitions:
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, seq^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004992s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.180398s
[12933 : 14931]
[12933 : 14932]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001008s
Time used: 1.00093

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^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): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Quasi-ranking function: 50000 - seq^0
New Graphs: 
Transitions:
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, seq^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006022s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 2.003877s
[12933 : 17358]
[12933 : 17360]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001251s
Time used: 1.00116

LOG: SAT solveNonLinear - Elapsed time: 1.248773s
Cost: 1; Total time: 1.24124
Termination implied by a set of invariant(s):
Invariant at l4: 1 <= N^0 + walker^0 + z^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^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): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Quasi-ranking function: 50000 + 50000*N^0 - seq^0
New Graphs: 
Transitions:
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, seq^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009751s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 2.006623s
[12933 : 19793]
[12933 : 19794]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001883s
Time used: 1.00178

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^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): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Quasi-ranking function: 50000 - N^0 - seq^0
New Graphs: 
Transitions:
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= N^0 + seq^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ 0 <= undef35 /\ 0 <= 1 + N^0 + walker^0 /\ 50001 <= N^0 + seq^0 /\ 50001 + 50000*N^0 <= seq^0 /\ 50001 <= seq^0 /\ 1 + seq^0 = undef33 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}>
<l4, l4, 1 <= N^0 + walker^0 + z^0 /\ 1 + i^0 <= walker^0 + z^0 /\ 1 <= i^0 /\ 1 <= seq^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ 0 <= 1 + N^0 + walker^0 /\ z^0 = 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}>
Variables:
N^0, i^0, seq^0, walker^0, z^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008219s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 2.016519s
[12933 : 22339]
[12933 : 22340]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.109659s
Time used: 4.10256

[12933 : 25034]
[12933 : 25074]
Successful child: 25034

Program does NOT terminate