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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, 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.002968

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l8}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001022s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003346s
[26196 : 26197]
[26196 : 26198]
Successful child: 26197
[ 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: 
[26196 : 26202]
[26196 : 26203]
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.000982s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003660s
[26196 : 26210]
[26196 : 26211]
Successful child: 26210
[ 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: 
[26196 : 26215]
[26196 : 26216]
[26196 : 26217]
[26196 : 26218]
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.000969s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003593s
[26196 : 26231]
[26196 : 26232]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013775s
Time used: 0.013396

[26196 : 26236]
[26196 : 26240]
Successful child: 26240

Program does NOT terminate