/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, l4, true>
<l1, l2, ((1 + y^0) <= (0 + __const_2000^0)) /\ (undef5 = ((0 + __const_1000^0) + x^0)) /\ ((1 + __const_110^0) <= (0 + undef5)), par{x^0 -> undef5}>
<l2, l1, true>
<l3, l1, true, par{y^0 -> (0 + __const_3000^0)}>
<l4, l3, true>

Fresh variables:
undef5, 

Undef variables:
undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (y^0 = (0 + y^0))>
<l1, l1, ((1 + y^0) <= (0 + __const_2000^0)) /\ (undef5 = ((0 + __const_1000^0) + x^0)) /\ ((1 + __const_110^0) <= (0 + undef5)), par{x^0 -> undef5}>

Fresh variables:
undef5, 

Undef variables:
undef5, 

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_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
Variables:
__const_1000^0, __const_110^0, __const_2000^0, x^0, y^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.003129

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000784s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003072s
[14830 : 14831]
[14830 : 14832]
Successful child: 14831
[ 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, 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000757s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003134s
[14830 : 14836]
[14830 : 14837]
Successful child: 14836
[ 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_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + __const_2000^0 <= y^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, 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_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + __const_2000^0 <= y^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
Ranking function: __const_1000^0 - __const_110^0 + x^0
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000861s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003673s
[14830 : 14841]
[14830 : 14842]
Successful child: 14841
[ 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, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, 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: 
<l1, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:__const_1000^0 + __const_2000^0 + x^0 <= 1 + __const_110^0 + y^0 - Process 3
* Exit transition: <l0, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + y^0 <= __const_2000^0, {all remain the same}>
* Postcondition  : __const_1000^0 + __const_2000^0 + x^0 <= 1 + __const_110^0 + y^0

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001003s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004283s
[14830 : 14846]
[14830 : 14847]
Successful child: 14846
[ 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 <= 0 /\ 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, 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 <= 0 /\ 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
Ranking function: __const_1000^0 - __const_110^0 + x^0
New Graphs: 

LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 4
* Exit transition: <l0, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + y^0 <= __const_2000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0, {all remain the same}>
* Postcondition  : 1 + __const_1000^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000558s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + __const_1000^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001050s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004454s
[14830 : 14851]
[14830 : 14852]
Successful child: 14851
[ 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, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 0 <= __const_1000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 0 <= __const_1000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:__const_1000^0 + x^0 <= __const_110^0 - Process 5
* Exit transition: <l0, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + y^0 <= __const_2000^0 /\ 0 <= __const_1000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0, {all remain the same}>
* Postcondition  : __const_1000^0 + x^0 <= __const_110^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000896s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: __const_1000^0 + x^0 <= __const_110^0 , 
Narrowing transition: 
<l1, l1, 1 + y^0 <= __const_1000^0 + __const_2000^0 /\ 1 + __const_110^0 <= undef5 /\ 1 + y^0 <= __const_2000^0 /\ 0 <= __const_1000^0 /\ 2 + __const_110^0 + y^0 <= __const_1000^0 + __const_2000^0 + x^0 /\ __const_1000^0 + x^0 = undef5, {x^0 -> undef5, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001166s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004730s
[14830 : 14856]
[14830 : 14857]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014953s
Time used: 0.014256

[14830 : 14861]
[14830 : 14865]
Successful child: 14861

Program does NOT terminate