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


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


YES

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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (y^0 = 1)>
<l1, l1, (0 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(3) * y^0)), y^0 -> (0 + y^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 0 <= x^0, {x^0 -> x^0 - 3*y^0, rest remain the same}>
Variables:
x^0, y^0

Precedence: 
Graph 0

Graph 1
<l0, l1, y^0 = 1, {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.002119

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000858s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001392s
[62541 : 62542]
[62541 : 62543]
Successful child: 62542
[ 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, 0 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - 3*y^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): 
<l1, l1, 0 <= x^0 /\ 1 <= y^0, {x^0 -> x^0 - 3*y^0, rest remain the same}>
Ranking function: x^0
New Graphs: 
INVARIANTS: 
1: 1 <= y^0 , 
Quasi-INVARIANTS to narrow Graph: 
1: 
Program Terminates