/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, l15, true>
<l1, l2, ((1 + __const_5^0) <= (0 + WItemsNum^0))>
<l1, l3, ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (undef6 = undef6), par{tmp1^0 -> undef6}>
<l4, l5, true>
<l5, l1, true>
<l6, l7, true>
<l8, l9, true>
<l10, l11, true>
<l7, l4, ((0 + WItemsNum^0) <= 2)>
<l7, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l11, l12, true>
<l12, l11, true>
<l2, l6, true>
<l13, l5, ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l13, l5, ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l3, l2, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0))>
<l3, l13, (1 <= (0 + tmp1^0))>
<l3, l13, ((1 + tmp1^0) <= 0)>
<l14, l4, (undef55 = undef55) /\ (undef52 = undef52), par{WItemsNum^0 -> undef52}>
<l15, l14, true>

Fresh variables:
undef6, undef52, undef55, 

Undef variables:
undef6, undef52, undef55, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (WItemsNum^0 = undef52) /\ (undef55 = undef55) /\ (undef52 = undef52)>
<l5, l6, ((1 + __const_5^0) <= (0 + WItemsNum^0))>
<l5, l6, ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (undef6 = undef6) /\ ((0 + undef6) <= 0) /\ (0 <= (0 + undef6))>
<l5, l5, ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (undef6 = undef6) /\ (1 <= (0 + undef6)) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l5, l5, ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (undef6 = undef6) /\ ((1 + undef6) <= 0) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l6, l5, ((0 + WItemsNum^0) <= 2)>
<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>

Fresh variables:
undef6, undef52, undef55, 

Undef variables:
undef6, undef52, undef55, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l6, 1 + __const_5^0 <= WItemsNum^0, {all remain the same}>
<l5, l6, WItemsNum^0 <= __const_5^0 /\ undef6 = 0, {all remain the same}>
<l5, l5, 1 <= undef6 /\ WItemsNum^0 <= __const_5^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l5, l5, 1 + undef6 <= 0 /\ WItemsNum^0 <= __const_5^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l6, l5, WItemsNum^0 <= 2, {all remain the same}>
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0, __const_5^0

Precedence: 
Graph 0

Graph 1
<l0, l5, WItemsNum^0 = undef52, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l5, l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002062s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012967s
[1858 : 1859]
[1858 : 1860]
Successful child: 1859
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l6, 1 + __const_5^0 <= WItemsNum^0 /\ 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l6, WItemsNum^0 <= __const_5^0 /\ undef6 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l5, 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0 /\ WItemsNum^0 <= 2, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + __const_5^0 <= 0 /\ 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^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
Strengthening transition (result): 
<l5, l6, 1 + __const_5^0 <= WItemsNum^0 /\ 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l6, WItemsNum^0 <= __const_5^0 /\ undef6 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l5, 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0 /\ WItemsNum^0 <= 2, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l6, l6, 1 + __const_5^0 <= 0 /\ 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
New Graphs: 
Transitions:
<l5, l6, 1 + __const_5^0 <= WItemsNum^0 /\ 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0, {all remain the same}>
<l6, l5, 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0 /\ WItemsNum^0 <= 2, {all remain the same}>
<l6, l6, 1 + __const_5^0 <= 0 /\ 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0, __const_5^0
Checking conditional termination of SCC {l5, l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000824s
Ranking function: -3 + WItemsNum^0
New Graphs: 
Transitions:
<l5, l5, 1 + __const_5^0 <= WItemsNum^0 /\ 1 + __const_5^0 <= 0 /\ 0 <= WItemsNum^0 /\ WItemsNum^0 <= 2, {all remain the same}>
Variables:
WItemsNum^0, __const_5^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal WItemsNum^0 <= __const_5^0 and entry <l5, l5, true, {all remain the same}>

LOG: CALL check - Post:WItemsNum^0 <= __const_5^0 - Process 1
* Exit transition: <l5, l5, true, {all remain the same}>
* Postcondition  : WItemsNum^0 <= __const_5^0

FIXED: Entro call 
FIXED (try DiffLogic): 0

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103372s
Time used: 4.10267
FIXED (FARKAS): fail
FIXED (FARKAS): 4.10952

FIXED: Entro call 
FIXED (try DiffLogic): 0

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.113194s
Time used: 4.10215
FIXED (FARKAS): fail
FIXED (FARKAS): 4.11845

LOG: Try proving POST
[1858 : 1866]
[1858 : 1867]
[1858 : 1868]

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

LOG: RETURN check - Elapsed time: 12.414082s

[1858 : 1977]
[1858 : 1978]
Successful child: 1977

Program does NOT terminate