/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, l7, true>
<l1, l2, (undef2 = (0 + x_5^0)) /\ (undef8 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, __cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}>
<l3, l2, (undef10 = (0 + x_5^0)) /\ (undef16 = (0 + undef10)) /\ (undef9 = undef9), par{Result_4^0 -> undef9, __cil_tmp2_6^0 -> undef10, selected_11^0 -> (0 + undef16)}>
<l4, l5, (undef19 = (0 + selected_11^0)), par{Result_4^0 -> (0 + undef19), __cil_tmp6_12^0 -> undef19}>
<l4, l2, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{Result_4^0 -> undef24, __cil_tmp2_6^0 -> undef25, selected_11^0 -> (0 + undef31)}>
<l2, l4, true, par{retryCount_10^0 -> (1 + retryCount_10^0)}>
<l6, l4, true, par{maxRetries_9^0 -> 4, retryCount_10^0 -> 0, selected_11^0 -> 0}>
<l7, l6, true>

Fresh variables:
undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 

Undef variables:
undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (retryCount_10^0 = 0) /\ (selected_11^0 = 0)>
<l4, l5, (undef19 = (0 + selected_11^0))>
<l4, l4, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{retryCount_10^0 -> (1 + retryCount_10^0), selected_11^0 -> (0 + undef31)}>

Fresh variables:
undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 

Undef variables:
undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Variables:
retryCount_10^0, selected_11^0, x_5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>

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

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000828s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002165s
[24550 : 24551]
[24550 : 24552]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000612s
Time used: 1.00046

LOG: SAT solveNonLinear - Elapsed time: 1.009373s
Cost: 1; Total time: 1.00881
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= 1 + retryCount_10^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= 1 + retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, 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): 
<l4, l4, 0 <= 1 + retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Quasi-ranking function: 50000 - retryCount_10^0
New Graphs: 
Transitions:
<l4, l4, 50001 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Variables:
retryCount_10^0, selected_11^0, x_5^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000614s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002491s
[24550 : 24556]
[24550 : 24557]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001267s
Time used: 1.00124

LOG: SAT solveNonLinear - Elapsed time: 1.011365s
Cost: 1; Total time: 1.0107
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= retryCount_10^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, 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): 
<l4, l4, 50001 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Quasi-ranking function: 50000 - retryCount_10^0 + x_5^0
New Graphs: 
Transitions:
<l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Variables:
retryCount_10^0, selected_11^0, x_5^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000782s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002940s
[24550 : 24561]
[24550 : 24562]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002310s
Time used: 1.0023

LOG: SAT solveNonLinear - Elapsed time: 1.012987s
Cost: 1; Total time: 1.01225
Quasi-ranking function: 50000 - retryCount_10^0 - x_5^0
New Graphs: 
Transitions:
<l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ 50001 <= retryCount_10^0 + x_5^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
Variables:
retryCount_10^0, selected_11^0, x_5^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000855s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003205s
[24550 : 24566]
[24550 : 24567]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.153755s
Time used: 4.15269
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.006883s
Cannot prove unreachability

[24550 : 24579]
[24550 : 24580]
Successful child: 24579

Program does NOT terminate