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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((0 + y^0) <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * z^0)), y^0 -> ((0 + y^0) + (~(2) * z^0)), z^0 -> (~(1) + z^0)}>
<l2, l1, true>
<l1, l3, ((0 + y^0) <= (0 + x^0)) /\ (undef7 = (1 + x^0)), par{x^0 -> undef7, y^0 -> ((0 + undef7) + y^0)}>
<l3, l1, true>
<l4, l1, true>
<l5, l4, true>

Fresh variables:
undef7, 

Undef variables:
undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, ((0 + y^0) <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * z^0)), y^0 -> ((0 + y^0) + (~(2) * z^0)), z^0 -> (~(1) + z^0)}>
<l1, l1, ((0 + y^0) <= (0 + x^0)) /\ (undef7 = (1 + x^0)), par{x^0 -> undef7, y^0 -> ((0 + undef7) + y^0)}>

Fresh variables:
undef7, 

Undef variables:
undef7, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001327s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003862s
[15699 : 15700]
[15699 : 15701]
Successful child: 15700
[ 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: 
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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: 
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + x^0 <= y^0 - Process 1
* Exit transition: <l0, l1, true, {all remain the same}>
* Postcondition  : 1 + x^0 <= y^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000411s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + x^0 <= y^0 , 
Narrowing transition: 
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001170s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004049s
[15699 : 15705]
[15699 : 15706]
Successful child: 15705
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: x^0 - y^0
New Graphs: 
Transitions:
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000711s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002775s
[15699 : 15710]
[15699 : 15711]
Successful child: 15710
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ x^0 <= 1 + y^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ x^0 <= 1 + y^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ x^0 <= 1 + y^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
Ranking function: 1 + z^0
New Graphs: 
[15699 : 15715]
[15699 : 15716]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 + z^0 <= y^0 , 1 <= x^0 + y^0 , 

LOG: CALL check - Post:x^0 <= 1 + y^0 + z^0 - Process 2
* Exit transition: <l0, l1, y^0 <= x^0, {all remain the same}>
* Postcondition  : x^0 <= 1 + y^0 + z^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000634s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 <= 1 + y^0 + z^0 , 
Narrowing transition: 
<l1, l1, y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 3
invGraph after Narrowing: 
Transitions:
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003842s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.226475s
[15699 : 15717]
[15699 : 15718]
Successful child: 15717
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: -3*x^0 - 2*z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002852s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.119460s
[15699 : 15722]
[15699 : 15723]
Successful child: 15723
Ranking function: 3*x^0 - 3*y^0 - z^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001489s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013515s
[15699 : 15727]
[15699 : 15728]
Successful child: 15727
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: -2 + x^0 - y^0
New Graphs: 
Transitions:
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000879s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003634s
[15699 : 15732]
[15699 : 15733]
Successful child: 15732
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 1 + z^0 <= 0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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: 
<l1, l1, 0 <= x^0 /\ y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
New Graphs: 
[15699 : 15737]
[15699 : 15738]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + z^0 <= 0 , 
[15699 : 15739]
[15699 : 15740]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 0 <= x^0 , 

LOG: CALL check - Post:x^0 + z^0 <= y^0 - Process 3
* Exit transition: <l0, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {all remain the same}>
* Postcondition  : x^0 + z^0 <= y^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001223s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 + z^0 <= y^0 , 
It's unfeasible. Removing transition: 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 2 + y^0 + z^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 3
It's unfeasible. Removing transition: 
<l1, l1, x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 <= x^0 + y^0 /\ 2 + y^0 + z^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 3
invGraph after Narrowing: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005453s
Ranking function: z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003306s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.153897s
[15699 : 15741]
[15699 : 15742]
Successful child: 15742
Ranking function: -x^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001995s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017865s
[15699 : 15746]
[15699 : 15747]
Successful child: 15746
[ 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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: 2 - x^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001537s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013386s
[15699 : 15751]
[15699 : 15752]
Successful child: 15751
[ 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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: -2 + 4*x^0 - 3*y^0 - z^0
New Graphs: 
[15699 : 15756]
[15699 : 15757]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + z^0 <= 0 , 
[15699 : 15758]
[15699 : 15759]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 0 <= x^0 + z^0 , 
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008558s
Ranking function: z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004725s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.154766s
Piecewise ranking function: min(-5*x^0,5 + 5*z^0)
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003861s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.209694s
[15699 : 15760]
[15699 : 15761]
Successful child: 15761
Ranking function: -x^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003309s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.095740s
[15699 : 15765]
[15699 : 15766]
Successful child: 15765
[ 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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003731s
Ranking function: 2 - 2*x^0 - z^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002734s
Ranking function: 3 - x^0 - z^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001723s
Ranking function: x^0 - y^0
New Graphs: 
[15699 : 15770]
[15699 : 15771]
[15699 : 15772]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + z^0 <= 0 , 
It's unfeasible. Removing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
It's unfeasible. Removing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006044s
Ranking function: z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004604s
Ranking function: -6*x^0 - 5*z^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000907s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003497s
[15699 : 15773]
[15699 : 15774]
Successful child: 15773
[ 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: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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): 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
New Graphs: 
[15699 : 15778]
[15699 : 15779]
[15699 : 15780]
[15699 : 15781]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 + z^0 <= y^0 , 0 <= x^0 + z^0 , 
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
It's unfeasible. Removing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ 0 <= x^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005171s
Ranking function: z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003870s
Ranking function: -x^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000910s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003546s
[15699 : 15782]
[15699 : 15783]
Successful child: 15782
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ x^0 + z^0 = 1 + y^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^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: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 1 + x^0 = undef7 /\ x^0 + z^0 = 1 + y^0, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, 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): 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 1 + x^0 = undef7 /\ x^0 + z^0 = 1 + y^0, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Ranking function: 2 + x^0 - y^0 + z^0
New Graphs: 
[15699 : 15787]
[15699 : 15788]
[15699 : 15789]
[15699 : 15790]
[15699 : 15791]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + z^0 <= x^0 , x^0 + z^0 <= 1 + y^0 , 
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l1, l1, y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 2 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0, {x^0 -> x^0 - z^0, y^0 -> y^0 - 2*z^0, z^0 -> -1 + z^0, rest remain the same}>
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 2 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009115s
Ranking function: z^0
New Graphs: 
Transitions:
<l1, l1, x^0 + y^0 <= 0 /\ x^0 + z^0 <= y^0 /\ x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 <= 0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 2 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= z^0 /\ 1 + x^0 + z^0 <= 0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005325s
Ranking function: -5 - 8*x^0 - 5*z^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 2 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
<l1, l1, x^0 <= z^0 /\ y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003160s
Ranking function: -x^0 + z^0
New Graphs: 
Transitions:
<l1, l1, y^0 <= x^0 /\ 0 <= x^0 + z^0 /\ 0 <= z^0 /\ 1 + z^0 <= x^0 /\ 2 + y^0 <= x^0 + z^0 /\ 1 + x^0 = undef7, {x^0 -> undef7, y^0 -> y^0 + undef7, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002015s
Ranking function: 2*x^0 - 2*y^0
New Graphs: 
Program Terminates