/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, true, par{len^0 -> (1 + len^0)}>
<l3, l1, (5 <= (0 + len^0))>
<l3, l1, ((1 + len^0) <= 4)>
<l3, l1, ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> 0}>
<l4, l5, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
<l4, l3, (1 <= (0 + tmp^0))>
<l4, l3, ((1 + tmp^0) <= 0)>
<l2, l4, (undef16 = undef16), par{tmp^0 -> undef16}>
<l6, l2, true, par{len^0 -> 0}>
<l7, l6, true>

Fresh variables:
undef16, 

Undef variables:
undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (len^0 = 0)>
<l2, l5, (undef16 = undef16) /\ ((0 + undef16) <= 0) /\ (0 <= (0 + undef16))>
<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ (5 <= (0 + len^0)), par{len^0 -> (1 + len^0)}>
<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ ((1 + len^0) <= 4), par{len^0 -> (1 + len^0)}>
<l2, l2, (undef16 = undef16) /\ (1 <= (0 + undef16)) /\ ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> (1 + 0)}>
<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ (5 <= (0 + len^0)), par{len^0 -> (1 + len^0)}>
<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ ((1 + len^0) <= 4), par{len^0 -> (1 + len^0)}>
<l2, l2, (undef16 = undef16) /\ ((1 + undef16) <= 0) /\ ((0 + len^0) <= 4) /\ (4 <= (0 + len^0)), par{len^0 -> (1 + 0)}>

Fresh variables:
undef16, 

Undef variables:
undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= undef16 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
<l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
<l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
<l2, l2, 1 + undef16 <= 0 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>
<l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>
<l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
Variables:
len^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, len^0 = 0, {all remain the same}>

Graph 2
<l2, l5, undef16 = 0, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.022248
Some transition disabled by a set of invariant(s):
Invariant at l2: len^0 <= 4

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + undef16 <= 0 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= undef16 /\ 5 <= len^0, {len^0 -> 1 + len^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= undef16 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= undef16 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + undef16 <= 0 /\ len^0 <= 3, {len^0 -> 1 + len^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + undef16 <= 0 /\ len^0 = 4, {len^0 -> 1, rest remain the same}>
Checking unfeasibility...
Time used: 0.012624

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001493s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020014s
[33126 : 33127]
[33126 : 33128]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.057634s
Time used: 0.056829
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, len^0 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[33126 : 33144]
[33126 : 33145]
Successful child: 33144

Program does NOT terminate