NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l13, true>
<l1, l2, (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, ___cil_tmp2_7^0 -> undef2, ___retres1_6^0 -> undef3, lt_13^0 -> undef9, tmp_11^0 -> (0 + undef14)}>
<l1, l3, (undef31 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef31))) /\ (undef24 = undef24) /\ (undef30 = (0 + b_128^0)) /\ (undef23 = undef23) /\ (undef18 = 0) /\ (undef17 = (0 + undef18)) /\ (undef29 = (0 + undef17)) /\ (undef16 = undef16), par{Result_4^0 -> undef16, ___cil_tmp2_7^0 -> undef17, ___retres1_6^0 -> undef18, lt_12^0 -> undef23, lt_13^0 -> undef24, tmp_11^0 -> (0 + undef29)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef32 = undef32), par{Result_4^0 -> undef32}>
<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)) /\ (undef86 = 0) /\ (0 <= (4 + (~(1) * undef86))) /\ (undef79 = undef79) /\ (undef85 = 0) /\ (undef78 = undef78) /\ (undef73 = 0) /\ (undef72 = (0 + undef73)) /\ (undef84 = (0 + undef72)) /\ (undef71 = undef71), par{Result_4^0 -> undef71, ___cil_tmp2_7^0 -> undef72, ___retres1_6^0 -> undef73, lt_12^0 -> undef78, lt_13^0 -> undef79, tmp_11^0 -> (0 + undef84)}>
<l7, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l2, l8, ((1 + tmp_11^0) <= 0)>
<l2, l8, (1 <= (0 + tmp_11^0))>
<l8, l7, true, par{y_9^0 -> (1 + y_9^0)}>
<l6, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef154 = 0) /\ (0 <= (4 + (~(1) * undef154))) /\ (undef147 = undef147) /\ (undef153 = 0) /\ (undef146 = undef146) /\ (undef141 = 0) /\ (undef140 = (0 + undef141)) /\ (undef152 = (0 + undef140)) /\ (undef139 = undef139), par{Result_4^0 -> undef139, ___cil_tmp2_7^0 -> undef140, ___retres1_6^0 -> undef141, lt_12^0 -> undef146, lt_13^0 -> undef147, tmp_11^0 -> (0 + undef152)}>
<l6, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l9, l4, (undef174 = undef174), par{count_5^0 -> undef174}>
<l10, l3, (undef196 = ~(1)) /\ (0 <= (4 + (~(1) * undef196))) /\ (undef189 = undef189) /\ (undef195 = ~(1)) /\ (undef188 = undef188) /\ (undef183 = 0) /\ (undef182 = (0 + undef183)) /\ (undef194 = (0 + undef182)) /\ (undef181 = undef181), par{Result_4^0 -> undef181, ___cil_tmp2_7^0 -> undef182, ___retres1_6^0 -> undef183, b_51^0 -> ~(2), lt_12^0 -> undef188, lt_13^0 -> undef189, tmp_11^0 -> (0 + undef194)}>
<l11, l3, (undef212 = (0 + b_51^0)) /\ (0 <= (4 + (~(1) * undef212))) /\ (undef205 = undef205) /\ (undef211 = (0 + b_51^0)) /\ (undef204 = undef204) /\ (undef199 = 0) /\ (undef198 = (0 + undef199)) /\ (undef210 = (0 + undef198)) /\ (undef197 = undef197), par{Result_4^0 -> undef197, ___cil_tmp2_7^0 -> undef198, ___retres1_6^0 -> undef199, b_76^0 -> (~(1) + b_51^0), lt_12^0 -> undef204, lt_13^0 -> undef205, tmp_11^0 -> (0 + undef210)}>
<l11, l2, (undef227 = (0 + b_51^0)) /\ ((5 + (~(1) * undef227)) <= 0) /\ (undef221 = undef221) /\ (undef215 = 1) /\ (undef214 = (0 + undef215)) /\ (undef226 = (0 + undef214)) /\ (undef213 = undef213), par{Result_4^0 -> undef213, ___cil_tmp2_7^0 -> undef214, ___retres1_6^0 -> undef215, lt_13^0 -> undef221, tmp_11^0 -> (0 + undef226)}>
<l12, l3, (undef243 = ~(1)) /\ (0 <= (4 + (~(1) * undef243))) /\ (undef236 = undef236) /\ (undef242 = ~(1)) /\ (undef235 = undef235) /\ (undef230 = 0) /\ (undef229 = (0 + undef230)) /\ (undef241 = (0 + undef229)) /\ (undef228 = undef228), par{Result_4^0 -> undef228, ___cil_tmp2_7^0 -> undef229, ___retres1_6^0 -> undef230, b_128^0 -> ~(2), lt_12^0 -> undef235, lt_13^0 -> undef236, tmp_11^0 -> (0 + undef241)}>
<l13, l9, true>

Fresh variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Undef variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef174 = undef174)>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1) /\ (1 <= (0 + (0 + undef14))) /\ (0 <= ((~(1) + (~(1) * (1 + y_9^0))) + z_10^0)) /\ (undef86 = 0) /\ (0 <= (4 + (~(1) * undef86))) /\ (undef79 = undef79) /\ (undef85 = 0) /\ (undef78 = undef78) /\ (undef73 = 0) /\ (undef72 = (0 + undef73)) /\ (undef84 = (0 + undef72)) /\ (undef71 = undef71), par{tmp_11^0 -> (0 + undef84), 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)) /\ (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1) /\ (1 <= (0 + (0 + undef14))) /\ (((0 + (~(1) * (1 + y_9^0))) + z_10^0) <= 0), par{tmp_11^0 -> (0 + undef14), 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)) /\ (undef31 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef31))) /\ (undef24 = undef24) /\ (undef30 = (0 + b_128^0)) /\ (undef23 = undef23) /\ (undef18 = 0) /\ (undef17 = (0 + undef18)) /\ (undef29 = (0 + undef17)) /\ (undef16 = undef16), par{tmp_11^0 -> (0 + undef29)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef32 = undef32)>
<l4, l3, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef154 = 0) /\ (0 <= (4 + (~(1) * undef154))) /\ (undef147 = undef147) /\ (undef153 = 0) /\ (undef146 = undef146) /\ (undef141 = 0) /\ (undef140 = (0 + undef141)) /\ (undef152 = (0 + undef140)) /\ (undef139 = undef139), par{tmp_11^0 -> (0 + undef152)}>
<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, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Undef variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.030259

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007815s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.003912s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001065s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000945s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004047s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007844s
Time used: 0.00751
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.077730s
Time used: 0.077728

LOG: SAT solveNonLinear - Elapsed time: 0.136174s
Cost: 1; Total time: 0.135201
Failed at location 4: 1 + y_9^0 <= x_8^0
Before Improving: 
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: 1 + y_9^0 <= x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013643s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004649s
Remaining time after improvement: 0.989859
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: y_9^0 <= x_8^0
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal y_9^0 <= x_8^0 and entry <l0, l4, true, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000749s
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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.006026s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.004058s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001171s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000945s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004055s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007989s
Time used: 0.007601
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071806s
Time used: 0.071803

LOG: SAT solveNonLinear - Elapsed time: 0.125702s
Cost: 1; Total time: 0.124661
Failed at location 4: z_10^0 <= 1 + x_8^0
Before Improving: 
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: z_10^0 <= 1 + x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012579s
Remaining time after improvement: 0.995236
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: z_10^0 <= 1 + x_8^0
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal z_10^0 <= 1 + x_8^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0, {all remain the same}>

LOG: CALL check - Post:z_10^0 <= 1 + x_8^0 - Process 2
* Exit transition: <l0, l4, 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.000671s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000759s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: z_10^0 <= 1 + x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.006431s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001187s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000959s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004081s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008128s
Time used: 0.00779
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061303s
Time used: 0.0613

LOG: SAT solveNonLinear - Elapsed time: 0.114686s
Cost: 1; Total time: 0.113626
Failed at location 4: z_10^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: z_10^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014275s
Remaining time after improvement: 0.99365
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: z_10^0 <= y_9^0
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal z_10^0 <= y_9^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:z_10^0 <= y_9^0 - Process 3
* Exit transition: <l0, l4, 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.000761s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000852s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing 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}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.003135s
Ranking function: -7 + b_128^0 + 3*tmp_11^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000979s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004133s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008282s
Time used: 0.007953
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046484s
Time used: 0.04648

LOG: SAT solveNonLinear - Elapsed time: 0.287115s
Cost: 1; Total time: 0.286117
Failed at location 4: 3 + z_10^0 <= b_128^0 + x_8^0
Before Improving: 
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0
Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009663s
Remaining time after improvement: 0.995725
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0
Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0
[ 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, 5 <= undef15 /\ 1 <= undef14 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal 3 + z_10^0 <= b_128^0 + x_8^0 and entry <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}>

LOG: CALL check - Post:3 + z_10^0 <= b_128^0 + x_8^0 - Process 4
* 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.000874s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000983s
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, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.004787s
Ranking function: -16 - 8*y_9^0 + 8*z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001113s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005442s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008791s
Time used: 0.008289
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089663s
Time used: 0.089651

LOG: SAT solveNonLinear - Elapsed time: 0.445737s
Cost: 1; Total time: 0.44467
Failed at location 4: 4 + z_10^0 <= b_128^0 + y_9^0
Before Improving: 
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + y_9^0
Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010301s
Remaining time after improvement: 0.994963
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + y_9^0
Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^0
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal 4 + z_10^0 <= b_128^0 + y_9^0 and entry <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}>

LOG: CALL check - Post:4 + z_10^0 <= b_128^0 + y_9^0 - Process 5
* 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.000989s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001109s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + z_10^0 <= b_128^0 + y_9^0 , 
4: 4 + z_10^0 <= b_128^0 + y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.005204s
Ranking function: -67 + 13*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001209s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005727s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009524s
Time used: 0.009078
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068821s
Time used: 0.068818

LOG: SAT solveNonLinear - Elapsed time: 0.453994s
Cost: 1; Total time: 0.452856
Failed at location 4: 4 + y_9^0 <= b_128^0 + x_8^0
Before Improving: 
Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0
Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017041s
Remaining time after improvement: 0.994677
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0
Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0
[ 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, 5 <= b_128^0 + tmp_11^0 /\ 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal 4 + y_9^0 <= b_128^0 + x_8^0 and entry <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}>

LOG: CALL check - Post:4 + y_9^0 <= b_128^0 + x_8^0 - Process 6
* 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.001099s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001251s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 + tmp_11^0 , 
4: 4 + y_9^0 <= b_128^0 + x_8^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.001331s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006241s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009641s
Time used: 0.009175
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.050918s
Time used: 0.050915

LOG: SAT solveNonLinear - Elapsed time: 0.516571s
Cost: 1; Total time: 0.515416
Failed at location 4: 5 <= b_128^0
Before Improving: 
Quasi-invariant at l3: 5 <= b_128^0
Quasi-invariant at l4: 5 <= b_128^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009171s
Remaining time after improvement: 0.994841
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 5 <= b_128^0
Quasi-invariant at l4: 5 <= b_128^0
[ 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, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 
Calling Safety with literal 5 <= b_128^0 and entry <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}>

LOG: CALL check - Post:5 <= b_128^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 /\ 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.001189s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001317s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 , 
4: 5 <= b_128^0 , 
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.002730s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014250s
Trying to remove 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 <= 4 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018543s
Time used: 0.017216
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016146s
Time used: 0.014333
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.073194s
Time used: 0.073192

LOG: SAT solveNonLinear - Elapsed time: 0.142891s
Cost: 1; Total time: 0.141024
Failed at location 4: 1 + tmp_11^0 + z_10^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: x_8^0 <= tmp_11^0 + z_10^0
Quasi-invariant at l4: 1 + tmp_11^0 + z_10^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016378s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007038s
Remaining time after improvement: 0.983909
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: x_8^0 <= tmp_11^0 + z_10^0
Quasi-invariant at l4: tmp_11^0 + z_10^0 <= y_9^0
[ 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, x_8^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, tmp_11^0 + z_10^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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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, x_8^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, tmp_11^0 + z_10^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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Ranking function: -tmp_11^0
New Graphs: 
Transitions:
<l3, l3, x_8^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001536s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007877s
Trying to remove transition: <l3, l3, x_8^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011353s
Time used: 0.010626
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.630646s
Time used: 0.629491
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002576s
Time used: 4.00005
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012601s
Time used: 1.00002
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038265s
Time used: 0.025194

Proving non-termination of subgraph 1
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010202s
Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 + tmp_11^0 <= 0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + 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 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + 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 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^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, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^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 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^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, {all remain the same}>
<l4, end, y_9^0 <= x_8^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 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^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, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^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 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^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, {all remain the same}>
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, 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, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.125375s
Time used: 3.11812
Improving Solution with cost 37 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002302s
Time used: 1.00233

LOG: SAT solveNonLinear - Elapsed time: 4.127677s
Cost: 37; Total time: 4.12045
Failed at location 4: 1 + b_128^0 <= 0
Before Improving: 
Quasi-invariant at l3: 1 + b_128^0 + tmp_11^0 <= 0
Quasi-invariant at l4: 1 + b_128^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.043573s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.037484s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026465s
Remaining time after improvement: 0.914113
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.044405s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: b_128^0 + tmp_11^0 <= 1
Quasi-invariant at l4: b_128^0 <= 1

Strengthening and disabling EXIT transitions...
Closed exits from l3: 10
Closed exits from l4: 9
Strengthening exit transition (result): 
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, z_10^0 <= y_9^0 /\ 1 + tmp_11^0 <= 0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ 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}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ 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, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ b_128^0 <= 1 /\ 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + y_9^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 + tmp_11^0 <= 0 /\ b_128^0 + tmp_11^0 <= 1 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ 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}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ b_128^0 <= 1 /\ 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, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.536186s
Time used: 0.534144
Improving Solution with cost 13 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003996s
Time used: 1.00404

LOG: SAT solveNonLinear - Elapsed time: 1.540182s
Cost: 13; Total time: 1.53818
Failed at location 4: 1 + y_9^0 <= z_10^0
Before Improving: 
Quasi-invariant at l3: 1 + y_9^0 <= z_10^0
Quasi-invariant at l4: 1 + y_9^0 <= z_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026986s
Remaining time after improvement: 0.982255
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.034841s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + y_9^0 <= z_10^0
Quasi-invariant at l4: 1 + y_9^0 <= z_10^0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 7
Closed exits from l4: 5
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
Strengthening exit transition (result): 
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ 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}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ b_128^0 <= 1 /\ 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ z_10^0 <= 1 + x_8^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}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1 /\ 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}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.305739s
Time used: 0.304142
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.989727s
Time used: 0.989629

LOG: SAT solveNonLinear - Elapsed time: 1.295466s
Cost: 3; Total time: 1.29377
Failed at location 4: 1 + x_8^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: 0 <= tmp_11^0
Quasi-invariant at l4: 1 + x_8^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.026910s
Remaining time after improvement: 0.983944
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.027198s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 0 <= tmp_11^0
Quasi-invariant at l4: 1 + x_8^0 <= y_9^0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 2
Closed exits from l4: 3
Strengthening exit transition (result): 
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ b_128^0 <= 1 /\ 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.497400s
Time used: 0.497277

LOG: SAT solveNonLinear - Elapsed time: 0.497400s
Cost: 0; Total time: 0.497277
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.057734s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: tmp_11^0 <= 0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 1 /\ b_128^0 <= 4 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ b_128^0 <= 1 /\ 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

Calling reachability with...
Transition: <l4, end, true, {all remain the same}>
Conditions: b_128^0 <= 1, 1 + y_9^0 <= z_10^0, 1 + x_8^0 <= y_9^0, 
OPEN EXITS: 
<l4, end, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0, {all remain the same}> (condsUp: b_128^0 <= 1)

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l4, true, {all remain the same}>
Conditions: 1 + x_8^0 <= y_9^0, 1 + y_9^0 <= z_10^0, b_128^0 <= 1, 
OPEN EXITS: 
<l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 1, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate