NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l12, true>
<l1, l2, (undef9 = undef9), par{head_12^0 -> 0, i_11^0 -> 0, length_19^0 -> undef9}>
<l2, l3, (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef29 = undef29) /\ (undef27 = (0 + undef29)), par{head_12^0 -> (0 + undef27), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef27, tmp___0_14^0 -> undef29}>
<l2, l4, (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef32 = (0 + head_12^0)) /\ (undef46 = (0 + undef32)) /\ (undef47 = undef47) /\ (undef45 = (0 + a_16^0)) /\ ((0 + undef45) <= 0) /\ (0 <= (0 + undef45)) /\ (undef48 = undef48) /\ (undef31 = undef31), par{Result_4^0 -> undef31, ___cil_tmp6_15^0 -> undef32, tmp_20^0 -> (0 + undef46), x_18^0 -> undef45}>
<l3, l5, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef62 = undef62) /\ (undef60 = (0 + undef62)), par{head_12^0 -> (0 + undef60), i_11^0 -> (1 + i_11^0), tmp_13^0 -> undef60, tmp___0_14^0 -> undef62}>
<l5, l3, true>
<l3, l6, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)), par{Result_4^0 -> undef79, ___cil_tmp6_15^0 -> undef80, tmp_20^0 -> (0 + undef94), x_18^0 -> (0 + a_16^0)}>
<l6, l7, ((1 + x_18^0) <= 0)>
<l6, l7, (1 <= (0 + x_18^0))>
<l7, l8, (undef140 = undef140) /\ (undef134 = undef134), par{lt_21^0 -> undef134, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef140)}>
<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef156 = undef156) /\ (undef141 = undef141), par{Result_4^0 -> undef141}>
<l8, l9, (0 <= (0 + a_140^0))>
<l9, l10, ((1 + x_18^0) <= 0)>
<l9, l10, (1 <= (0 + x_18^0))>
<l10, l11, (undef217 = undef217) /\ (undef211 = undef211), par{lt_21^0 -> undef211, t_17^0 -> (0 + x_18^0), x_18^0 -> (0 + undef217)}>
<l11, l8, true>
<l12, l1, true>

Fresh variables:
undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 

Undef variables:
undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef9 = undef9) /\ (0 <= ((~(2) + (~(1) * 0)) + length_10^0)) /\ (undef29 = undef29) /\ (undef27 = (0 + undef29)), par{head_12^0 -> (0 + undef27), i_11^0 -> (1 + 0)}>
<l0, l4, (undef9 = undef9) /\ (((~(1) + (~(1) * 0)) + length_10^0) <= 0) /\ (undef32 = (0 + 0)) /\ (undef46 = (0 + undef32)) /\ (undef47 = undef47) /\ (undef45 = (0 + a_16^0)) /\ ((0 + undef45) <= 0) /\ (0 <= (0 + undef45)) /\ (undef48 = undef48) /\ (undef31 = undef31), par{head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef45}>
<l3, l3, (0 <= (0 + len_47^0)) /\ (0 <= ((~(2) + (~(1) * i_11^0)) + length_10^0)) /\ (undef62 = undef62) /\ (undef60 = (0 + undef62)), par{head_12^0 -> (0 + undef60), i_11^0 -> (1 + i_11^0)}>
<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ ((1 + (0 + a_16^0)) <= 0) /\ (undef140 = undef140) /\ (undef134 = undef134), par{x_18^0 -> (0 + undef140)}>
<l3, l8, (0 <= (0 + len_47^0)) /\ (((~(1) + (~(1) * i_11^0)) + length_10^0) <= 0) /\ (undef80 = (0 + head_12^0)) /\ (undef94 = (0 + undef80)) /\ (0 <= (0 + len_47^0)) /\ (undef79 = undef79) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (0 <= (0 + len_47^0)) /\ (1 <= (0 + (0 + a_16^0))) /\ (undef140 = undef140) /\ (undef134 = undef134), par{x_18^0 -> (0 + undef140)}>
<l8, l4, (0 <= (0 + a_140^0)) /\ ((0 + x_18^0) <= 0) /\ (0 <= (0 + x_18^0)) /\ (undef156 = undef156) /\ (undef141 = undef141)>
<l8, l8, (0 <= (0 + a_140^0)) /\ ((1 + x_18^0) <= 0) /\ (undef217 = undef217) /\ (undef211 = undef211), par{x_18^0 -> (0 + undef217)}>
<l8, l8, (0 <= (0 + a_140^0)) /\ (1 <= (0 + x_18^0)) /\ (undef217 = undef217) /\ (undef211 = undef211), par{x_18^0 -> (0 + undef217)}>

Fresh variables:
undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 

Undef variables:
undef9, undef27, undef29, undef31, undef32, undef45, undef46, undef47, undef48, undef60, undef62, undef79, undef80, undef94, undef134, undef140, undef141, undef156, undef211, undef217, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
Variables:
head_12^0, i_11^0, len_47^0, length_10^0

Graph 2:
Transitions:
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Variables:
a_140^0, x_18^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>

Graph 2
<l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
<l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

Graph 3
<l0, l4, length_10^0 <= 1 /\ a_16^0 = undef45 /\ undef32 = 0 /\ undef32 = undef46 /\ undef45 = 0, {head_12^0 -> 0, i_11^0 -> 0, x_18^0 -> undef45, rest remain the same}>
<l8, l4, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001038s
Ranking function: -2 - i_11^0 + length_10^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.003689

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001037s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003459s
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007708s
Time used: 0.00748
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014912s
Time used: 0.014307
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031735s
Time used: 0.031725

LOG: SAT solveNonLinear - Elapsed time: 0.046647s
Cost: 2; Total time: 0.046032
Failed at location 8: 1 + a_140^0 <= 0
Failed at location 8: 1 + a_140^0 <= 0
Before Improving: 
Quasi-invariant at l8: 1 + a_140^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005152s
Remaining time after improvement: 0.998296
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l8: 1 + a_140^0 <= 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: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, 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: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 1
* Exit transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0
Postcodition moved up: 1 + a_140^0 <= 0

LOG: Try proving POST
Postcondition: 1 + a_140^0 <= 0

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 2
* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000841s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: 1 + a_140^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020993s
Time used: 0.020783
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000522s
Time used: 1.00037

LOG: SAT solveNonLinear - Elapsed time: 1.021515s
Cost: 51; Total time: 1.02116
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003599s
Remaining time after improvement: 0.998537
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 3
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001108s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.648689s
Time used: 1.64796
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000817s
Time used: 1.00051

LOG: SAT solveNonLinear - Elapsed time: 2.649505s
Cost: 51; Total time: 2.64847
Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 1 + a_16^0 <= i_11^0
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007724s
Remaining time after improvement: 0.997847
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + a_16^0 <= i_11^0
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 4
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001294s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000333s
Time used: 1.00008

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 4.699831s
Calling Safety with literal 1 + a_140^0 <= 0 and entry <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 5
* Exit transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0
Postcodition moved up: 1 + a_140^0 <= 0

LOG: Try proving POST
Postcondition: 1 + a_140^0 <= 0

LOG: CALL check - Post:1 + a_140^0 <= 0 - Process 6
* Exit transition: <l0, l3, 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : 1 + a_140^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000982s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: 1 + a_140^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021240s
Time used: 0.021036
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000742s
Time used: 1.00044

LOG: SAT solveNonLinear - Elapsed time: 1.021982s
Cost: 51; Total time: 1.02148
Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003770s
Remaining time after improvement: 0.99842
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 7
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001317s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.583075s
Time used: 1.58254
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000767s
Time used: 1.00047

LOG: SAT solveNonLinear - Elapsed time: 2.583842s
Cost: 51; Total time: 2.583
Failed at location 3: a_140^0 + length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 + i_11^0 <= length_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007890s
Remaining time after improvement: 0.9976
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: a_140^0 + length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 + i_11^0 <= length_10^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:a_140^0 + length_10^0 <= 1 + i_11^0 - Process 8
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : a_140^0 + length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001400s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000295s
Time used: 1.00005

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 4.648165s
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: 1 + a_140^0 <= 0 , 
Narrowing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Variables:
a_140^0, x_18^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001059s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003821s
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007342s
Time used: 0.007158
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060105s
Time used: 0.058907
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.240865s
Time used: 0.240669

LOG: SAT solveNonLinear - Elapsed time: 0.300970s
Cost: 4; Total time: 0.299576
Failed at location 8: 0 <= x_18^0
Failed at location 8: 0 <= x_18^0
Failed at location 8: x_18^0 <= 0
Failed at location 8: x_18^0 <= 0
Before Improving: 
Quasi-invariant at l8: 0 <= x_18^0
Quasi-invariant at l8: x_18^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014742s
Remaining time after improvement: 0.997931
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l8: 0 <= x_18^0
Quasi-invariant at l8: x_18^0 <= 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: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, 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: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
New Graphs: 
Calling Safety with literal 0 <= x_18^0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:0 <= x_18^0 - Process 9
* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : 0 <= x_18^0
Postcodition moved up: 0 <= undef140

LOG: Try proving POST
Postcondition: 0 <= undef140

LOG: CALL check - Post:0 <= undef140 - Process 10
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : 0 <= undef140

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001075s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: 0 <= x_18^0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020192s
Time used: 0.019985
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000652s
Time used: 1.00051

LOG: SAT solveNonLinear - Elapsed time: 1.020844s
Cost: 51; Total time: 1.02049
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004265s
Remaining time after improvement: 0.998186
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 11
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001517s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.692822s
Time used: 0.692421
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001672s
Time used: 1.00137

LOG: SAT solveNonLinear - Elapsed time: 1.694493s
Cost: 51; Total time: 1.69379
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008224s
Remaining time after improvement: 0.997545
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 12
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001669s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002203s
Time used: 1.00171
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043514s
Time used: 0.0435

LOG: SAT solveNonLinear - Elapsed time: 1.045716s
Cost: 51; Total time: 1.04521
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015617s
Remaining time after improvement: 0.996779
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 13
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001689s

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.825273s
Calling Safety with literal x_18^0 <= 0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:x_18^0 <= 0 - Process 14
* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : x_18^0 <= 0
Postcodition moved up: undef140 <= 0

LOG: Try proving POST
Postcondition: undef140 <= 0

LOG: CALL check - Post:undef140 <= 0 - Process 15
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : undef140 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001140s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: x_18^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020315s
Time used: 0.020108
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002928s
Time used: 1.00278

LOG: SAT solveNonLinear - Elapsed time: 1.023243s
Cost: 51; Total time: 1.02289
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004325s
Remaining time after improvement: 0.998165
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 16
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001762s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.694218s
Time used: 0.693787
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000861s
Time used: 1.00055

LOG: SAT solveNonLinear - Elapsed time: 1.695079s
Cost: 51; Total time: 1.69433
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008389s
Remaining time after improvement: 0.997519
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 0 <= 1 + a_140^0 + i_11^0 + len_47^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 17
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001867s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004269s
Time used: 1.00369
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.060772s
Time used: 0.060756

LOG: SAT solveNonLinear - Elapsed time: 1.065041s
Cost: 51; Total time: 1.06445
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015872s
Remaining time after improvement: 0.996581
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + a_16^0 + i_11^0 <= a_140^0 + len_47^0 + length_10^0
Quasi-invariant at l3: 1 + i_11^0 <= len_47^0 + length_10^0
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 18
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 + a_16^0 <= 0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001851s

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.847760s
Calling Safety with literal 0 <= x_18^0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:0 <= x_18^0 - Process 19
* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : 0 <= x_18^0
Postcodition moved up: 0 <= undef140

LOG: Try proving POST
Postcondition: 0 <= undef140

LOG: CALL check - Post:0 <= undef140 - Process 20
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : 0 <= undef140

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001199s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: 0 <= x_18^0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020062s
Time used: 0.019851
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003505s
Time used: 1.0032

LOG: SAT solveNonLinear - Elapsed time: 1.023567s
Cost: 51; Total time: 1.02306
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004431s
Remaining time after improvement: 0.998077
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 21
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001635s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.809893s
Time used: 0.80945
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001184s
Time used: 1.00088

LOG: SAT solveNonLinear - Elapsed time: 1.811076s
Cost: 51; Total time: 1.81033
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= length_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008573s
Remaining time after improvement: 0.997461
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= length_10^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 22
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001773s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002828s
Time used: 1.00232
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042193s
Time used: 0.042179

LOG: SAT solveNonLinear - Elapsed time: 1.045021s
Cost: 51; Total time: 1.0445
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= i_11^0
Quasi-invariant at l3: i_11^0 <= 1
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016078s
Remaining time after improvement: 0.996599
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= i_11^0
Quasi-invariant at l3: i_11^0 <= 1

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 23
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 + undef140 <= 0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001898s

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.942758s
Calling Safety with literal x_18^0 <= 0 and entry <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>

LOG: CALL check - Post:x_18^0 <= 0 - Process 24
* Exit transition: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
* Postcondition  : x_18^0 <= 0
Postcodition moved up: undef140 <= 0

LOG: Try proving POST
Postcondition: undef140 <= 0

LOG: CALL check - Post:undef140 <= 0 - Process 25
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : undef140 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001190s

LOG: NarrowEntry size 1
Narrowing transition: 
<l3, l3, 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ undef60 = undef62, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
END ENTRIES:
GRAPH:
<l3, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 + i_11^0 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef60 = undef62 /\ undef80 = undef94, {head_12^0 -> undef60, i_11^0 -> 1 + i_11^0, rest remain the same}>
END GRAPH:
EXIT: <l3, l8, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
POST: x_18^0 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020012s
Time used: 0.019797
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.009086s
Time used: 1.00877

LOG: SAT solveNonLinear - Elapsed time: 1.029098s
Cost: 51; Total time: 1.02857
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004511s
Remaining time after improvement: 0.998064
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 26
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001659s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.815975s
Time used: 0.815548
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000972s
Time used: 1.00067

LOG: SAT solveNonLinear - Elapsed time: 1.816947s
Cost: 51; Total time: 1.81622
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= length_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008646s
Remaining time after improvement: 0.997383
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= length_10^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 27
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001857s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002768s
Time used: 1.00224
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042274s
Time used: 0.042261

LOG: SAT solveNonLinear - Elapsed time: 1.045041s
Cost: 51; Total time: 1.0445
Failed at location 3: length_10^0 <= 1 + i_11^0
Before Improving: 
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= i_11^0
Quasi-invariant at l3: i_11^0 <= 1
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016021s
Remaining time after improvement: 0.996875
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l3: length_10^0 <= 1 + i_11^0
Quasi-invariant at l3: 1 <= i_11^0
Quasi-invariant at l3: i_11^0 <= 1

LOG: NEXT CALL check - disable

LOG: CALL check - Post:length_10^0 <= 1 + i_11^0 - Process 28
* Exit transition: <l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 2 <= length_10^0 /\ 1 <= a_16^0 /\ 1 <= undef140 /\ undef27 = undef29 /\ undef80 = undef94, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
* Postcondition  : length_10^0 <= 1 + i_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001899s

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.945277s
INVARIANTS: 
8: 
Quasi-INVARIANTS to narrow Graph: 
8: x_18^0 <= 0 , 0 <= x_18^0 , 
Narrowing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Variables:
a_140^0, x_18^0
Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001109s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003914s
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007927s
Time used: 0.007732
Trying to remove transition: <l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022250s
Time used: 0.013105

Proving non-termination of subgraph 2
Transitions:
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>
Variables:
a_140^0, x_18^0

Checking conditional non-termination of SCC {l8}...
EXIT TRANSITIONS:
<l8, end, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>
<l8, end, 0 <= x_18^0 /\ 1 + a_140^0 <= 0, {all remain the same}>
<l8, end, 1 + a_140^0 <= 0 /\ 1 + x_18^0 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033810s
Time used: 0.0338

LOG: SAT solveNonLinear - Elapsed time: 0.053912s
Cost: 3; Total time: 0.053635
Failed at location 8: 0 <= a_140^0
Failed at location 8: 0 <= a_140^0
Before Improving: 
Quasi-invariant at l8: 0 <= a_140^0
Optimizing invariants...

LOG: CALL solveLinear

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

LOG: CALL solveNonLinear

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

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

Strengthening and disabling EXIT transitions...
Closed exits from l8: 2
Strengthening exit transition (result): 
<l8, end, 0 <= a_140^0 /\ x_18^0 = 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): 
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>

Checking conditional non-termination of SCC {l8}...
EXIT TRANSITIONS:
<l8, end, 0 <= a_140^0 /\ x_18^0 = 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018211s
Time used: 0.017967
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023788s
Time used: 0.023779

LOG: SAT solveNonLinear - Elapsed time: 0.041999s
Cost: 2; Total time: 0.041746
Failed at location 8: 1 + a_140^0 + x_18^0 <= 0
Failed at location 8: 1 + a_140^0 + x_18^0 <= 0
Before Improving: 
Quasi-invariant at l8: 1 + a_140^0 + x_18^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

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

LOG: CALL solveNonLinear

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

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l8: 1 + a_140^0 + x_18^0 <= 0
Constraint over undef '1 + a_140^0 + undef217 <= 0' in transition:
<l8, l8, 0 <= a_140^0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l8, l8, 0 <= a_140^0 /\ 1 + a_140^0 + x_18^0 <= 0 /\ 1 + a_140^0 + undef217 <= 0 /\ 1 + x_18^0 <= 0, {x_18^0 -> undef217, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l8, l8, 0 <= a_140^0 /\ 1 <= x_18^0, {x_18^0 -> undef217, rest remain the same}>

Calling reachability with...
Transition: <l8, end, true, {all remain the same}>
Conditions: 0 <= a_140^0, 1 + a_140^0 + x_18^0 <= 0, 
Transition: <l8, end, true, {all remain the same}>
Conditions: 0 <= a_140^0, 1 + a_140^0 + x_18^0 <= 0, 
OPEN EXITS: 
<l8, end, 1 + a_140^0 + x_18^0 <= 0, {all remain the same}> (condsUp: 0 <= a_140^0)
<l8, end, 1 + a_140^0 + x_18^0 <= 0, {all remain the same}> (condsUp: 0 <= a_140^0)

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

Calling reachability with...
Transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
Transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
Transition: <l3, l8, 0 <= len_47^0 /\ 1 + a_16^0 <= 0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
Transition: <l3, l8, 0 <= len_47^0 /\ 1 <= a_16^0 /\ length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80 /\ undef80 = undef94, {x_18^0 -> undef140, rest remain the same}>
Conditions: 1 + a_140^0 + x_18^0 <= 0, 0 <= a_140^0, 
OPEN EXITS: 
<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)
<l3, l8, length_10^0 <= 1 + i_11^0 /\ head_12^0 = undef80, {x_18^0 -> undef140, rest remain the same}> (condsUp: 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0)

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

Calling reachability with...
Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 + a_16^0 <= 0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
Transition: <l0, l3, 2 <= length_10^0 /\ undef27 = undef29, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
Conditions: length_10^0 <= 1 + i_11^0, head_12^0 = undef80, 0 <= len_47^0, 1 <= a_16^0, undef80 = undef94, 1 + a_140^0 + undef140 <= 0, 0 <= a_140^0, 
OPEN EXITS: 
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 + a_16^0 <= 0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>
<l0, l3, 0 <= a_140^0 /\ 0 <= len_47^0 /\ 1 + a_140^0 + undef140 <= 0 /\ 1 <= a_16^0 /\ undef27 = undef29 /\ undef27 = undef80 /\ undef80 = undef94 /\ length_10^0 = 2, {head_12^0 -> undef27, i_11^0 -> 1, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate