/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, l13, true>
<l1, l2, (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, __cil_tmp2_7^0 -> undef2, __retres1_6^0 -> undef4, lt_13^0 -> undef10, tmp_11^0 -> (0 + undef15)}>
<l1, l3, (undef33 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef33))) /\ (undef26 = undef26) /\ (undef32 = (0 + b_128^0)) /\ (undef25 = undef25) /\ (undef20 = 0) /\ (undef18 = (0 + undef20)) /\ (undef31 = (0 + undef18)) /\ (undef17 = undef17), par{Result_4^0 -> undef17, __cil_tmp2_7^0 -> undef18, __retres1_6^0 -> undef20, lt_12^0 -> undef25, lt_13^0 -> undef26, tmp_11^0 -> (0 + undef31)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef34 = undef34), par{Result_4^0 -> undef34}>
<l4, l6, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0))>
<l3, l1, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0))>
<l7, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef92 = 0) /\ (0 <= (4 + (~(1) * undef92))) /\ (undef85 = undef85) /\ (undef91 = 0) /\ (undef84 = undef84) /\ (undef79 = 0) /\ (undef77 = (0 + undef79)) /\ (undef90 = (0 + undef77)) /\ (undef76 = undef76), par{Result_4^0 -> undef76, __cil_tmp2_7^0 -> undef77, __retres1_6^0 -> undef79, lt_12^0 -> undef84, lt_13^0 -> undef85, tmp_11^0 -> (0 + undef90)}>
<l7, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l2, l8, (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109), par{__disjvr_0^0 -> undef109}>
<l8, l7, true, par{y_9^0 -> (1 + y_9^0)}>
<l6, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef151 = 0) /\ (0 <= (4 + (~(1) * undef151))) /\ (undef144 = undef144) /\ (undef150 = 0) /\ (undef143 = undef143) /\ (undef138 = 0) /\ (undef136 = (0 + undef138)) /\ (undef149 = (0 + undef136)) /\ (undef135 = undef135), par{Result_4^0 -> undef135, __cil_tmp2_7^0 -> undef136, __retres1_6^0 -> undef138, lt_12^0 -> undef143, lt_13^0 -> undef144, tmp_11^0 -> (0 + undef149)}>
<l6, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l9, l4, (undef173 = undef173), par{count_5^0 -> undef173}>
<l10, l3, (undef196 = ~(1)) /\ (0 <= (4 + (~(1) * undef196))) /\ (undef189 = undef189) /\ (undef195 = ~(1)) /\ (undef188 = undef188) /\ (undef183 = 0) /\ (undef181 = (0 + undef183)) /\ (undef194 = (0 + undef181)) /\ (undef180 = undef180), par{Result_4^0 -> undef180, __cil_tmp2_7^0 -> undef181, __retres1_6^0 -> undef183, b_51^0 -> ~(2), lt_12^0 -> undef188, lt_13^0 -> undef189, tmp_11^0 -> (0 + undef194)}>
<l11, l3, (undef213 = (0 + b_51^0)) /\ (0 <= (4 + (~(1) * undef213))) /\ (undef206 = undef206) /\ (undef212 = (0 + b_51^0)) /\ (undef205 = undef205) /\ (undef200 = 0) /\ (undef198 = (0 + undef200)) /\ (undef211 = (0 + undef198)) /\ (undef197 = undef197), par{Result_4^0 -> undef197, __cil_tmp2_7^0 -> undef198, __retres1_6^0 -> undef200, b_76^0 -> (~(1) + b_51^0), lt_12^0 -> undef205, lt_13^0 -> undef206, tmp_11^0 -> (0 + undef211)}>
<l11, l2, (undef229 = (0 + b_51^0)) /\ ((5 + (~(1) * undef229)) <= 0) /\ (undef223 = undef223) /\ (undef217 = 1) /\ (undef215 = (0 + undef217)) /\ (undef228 = (0 + undef215)) /\ (undef214 = undef214), par{Result_4^0 -> undef214, __cil_tmp2_7^0 -> undef215, __retres1_6^0 -> undef217, lt_13^0 -> undef223, tmp_11^0 -> (0 + undef228)}>
<l12, l3, (undef246 = ~(1)) /\ (0 <= (4 + (~(1) * undef246))) /\ (undef239 = undef239) /\ (undef245 = ~(1)) /\ (undef238 = undef238) /\ (undef233 = 0) /\ (undef231 = (0 + undef233)) /\ (undef244 = (0 + undef231)) /\ (undef230 = undef230), par{Result_4^0 -> undef230, __cil_tmp2_7^0 -> undef231, __retres1_6^0 -> undef233, b_128^0 -> ~(2), lt_12^0 -> undef238, lt_13^0 -> undef239, tmp_11^0 -> (0 + undef244)}>
<l13, l9, true>

Fresh variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Undef variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef173 = undef173)>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (0 <= ((~(1) + (~(1) * (1 + y_9^0))) + z_10^0)) /\ (undef92 = 0) /\ (0 <= (4 + (~(1) * undef92))) /\ (undef85 = undef85) /\ (undef91 = 0) /\ (undef84 = undef84) /\ (undef79 = 0) /\ (undef77 = (0 + undef79)) /\ (undef90 = (0 + undef77)) /\ (undef76 = undef76), par{__disjvr_0^0 -> undef109, tmp_11^0 -> (0 + undef90), y_9^0 -> (1 + y_9^0)}>
<l3, l4, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (((0 + (~(1) * (1 + y_9^0))) + z_10^0) <= 0), par{__disjvr_0^0 -> undef109, tmp_11^0 -> (0 + undef15), x_8^0 -> (1 + x_8^0), y_9^0 -> (1 + y_9^0)}>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef33 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef33))) /\ (undef26 = undef26) /\ (undef32 = (0 + b_128^0)) /\ (undef25 = undef25) /\ (undef20 = 0) /\ (undef18 = (0 + undef20)) /\ (undef31 = (0 + undef18)) /\ (undef17 = undef17), par{tmp_11^0 -> (0 + undef31)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef34 = undef34)>
<l4, l3, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef151 = 0) /\ (0 <= (4 + (~(1) * undef151))) /\ (undef144 = undef144) /\ (undef150 = 0) /\ (undef143 = undef143) /\ (undef138 = 0) /\ (undef136 = (0 + undef138)) /\ (undef149 = (0 + undef136)) /\ (undef135 = undef135), par{tmp_11^0 -> (0 + undef149)}>
<l4, l4, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>

Fresh variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Undef variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l4, l5, y_9^0 <= x_8^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008362s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003961s
Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001062s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000929s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003991s
[40462 : 40463]
[40462 : 40464]
Successful child: 40463
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000638s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: 1 + z_10^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006886s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001143s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000948s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004036s
[40462 : 40468]
[40462 : 40469]
Successful child: 40468
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + y_9^0 <= x_8^0 - Process 2
* Exit transition: <l0, l4, x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 1 + y_9^0 <= x_8^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000791s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= tmp_11^0 , 
4: 1 + y_9^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006914s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001145s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000948s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004035s
[40462 : 40473]
[40462 : 40474]
Successful child: 40473
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:y_9^0 <= x_8^0 - Process 3
* Exit transition: <l0, l4, x_8^0 <= y_9^0 /\ x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : y_9^0 <= x_8^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000851s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: y_9^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006921s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001148s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000946s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004032s
[40462 : 40478]
[40462 : 40479]
Successful child: 40478
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:z_10^0 <= 1 + x_8^0 - Process 4
* Exit transition: <l0, l4, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0, {all remain the same}>
* Postcondition  : z_10^0 <= 1 + x_8^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000774s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= tmp_11^0 , 
4: z_10^0 <= 1 + x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006994s
Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001142s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000947s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004046s
[40462 : 40483]
[40462 : 40484]
Successful child: 40483
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + z_10^0 <= y_9^0 - Process 5
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 1 + z_10^0 <= y_9^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000775s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: z_10^0 <= y_9^0 , 
4: 1 + z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006920s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004267s
Ranking function: -5 + b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001121s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000953s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004025s
[40462 : 40488]
[40462 : 40489]
Successful child: 40488
[ 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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:z_10^0 <= y_9^0 - Process 6
* Exit transition: <l0, l4, y_9^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : z_10^0 <= y_9^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000857s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= 0 , 
4: z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003339s
Ranking function: -1 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001012s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004352s
[40462 : 40493]
[40462 : 40494]
Successful child: 40493
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:3 + z_10^0 <= b_128^0 + x_8^0 - Process 7
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 3 + z_10^0 <= b_128^0 + x_8^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000950s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 , 
4: 3 + z_10^0 <= b_128^0 + x_8^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005273s
Ranking function: -67 + 13*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001141s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005374s
[40462 : 40498]
[40462 : 40499]
Successful child: 40498
[ 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: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:4 + z_10^0 <= b_128^0 + y_9^0 - Process 8
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>
* Postcondition  : 4 + z_10^0 <= b_128^0 + y_9^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001039s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 , 
4: 4 + z_10^0 <= b_128^0 + y_9^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005630s
Ranking function: -19 + b_128^0 - 7*y_9^0 + 7*z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001258s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005993s
[40462 : 40503]
[40462 : 40504]
Successful child: 40503
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ 5 <= b_128^0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:4 + y_9^0 <= b_128^0 + x_8^0 - Process 9
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
* Postcondition  : 4 + y_9^0 <= b_128^0 + x_8^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001135s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 , 
4: 4 + y_9^0 <= b_128^0 + x_8^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001352s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007061s
[40462 : 40508]
[40462 : 40509]
Successful child: 40508
[ 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:5 <= b_128^0 - Process 10
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
* Postcondition  : 5 <= b_128^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001170s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 , 
4: 5 <= b_128^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002812s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014414s
[40462 : 40513]
[40462 : 40514]
Successful child: 40513
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, z_10^0 <= tmp_11^0 + y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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): 
<l3, l3, 0 <= 0 /\ tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, z_10^0 <= tmp_11^0 + y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Ranking function: tmp_11^0 + y_9^0 - z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001538s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007762s
[40462 : 40518]
[40462 : 40519]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028871s
Time used: 0.027741

[40462 : 40523]
[40462 : 40527]
Successful child: 40523

Program does NOT terminate