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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (undef3 = ((0 + (~(1) * __const_1000^0)) + x^0)) /\ ((1 + __const_200^0) <= (0 + undef3)), par{x^0 -> undef3}>
<l2, l1, true>
<l3, l1, true>
<l4, l3, true>

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, (undef3 = ((0 + (~(1) * __const_1000^0)) + x^0)) /\ ((1 + __const_200^0) <= (0 + undef3)), par{x^0 -> undef3}>

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
Variables:
__const_1000^0, __const_200^0, x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000866s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002480s
[11073 : 11074]
[11073 : 11075]
Successful child: 11074
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, 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): 
<l1, l1, 1 <= __const_1000^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
Ranking function: -__const_1000^0 - __const_200^0 + x^0
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000345s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= __const_1000^0 , 
Narrowing transition: 
<l1, l1, 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
Variables:
__const_1000^0, __const_200^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000696s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002574s
[11073 : 11079]
[11073 : 11080]
Successful child: 11079
[ 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: 
<l1, l1, __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:x^0 <= __const_1000^0 + __const_200^0 - Process 2
* Exit transition: <l0, l1, __const_1000^0 <= 0, {all remain the same}>
* Postcondition  : x^0 <= __const_1000^0 + __const_200^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000566s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x^0 <= __const_1000^0 + __const_200^0 , 
Narrowing transition: 
<l1, l1, __const_1000^0 <= 0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, __const_1000^0 <= 0 /\ 1 + __const_1000^0 + __const_200^0 <= x^0 /\ 1 + __const_200^0 <= undef3 /\ __const_1000^0 + undef3 = x^0, {x^0 -> undef3, rest remain the same}>
Variables:
__const_1000^0, __const_200^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000756s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002972s
[11073 : 11084]
[11073 : 11085]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008672s
Time used: 0.008214

[11073 : 11089]
[11073 : 11093]
Successful child: 11093

Program does NOT terminate