/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, l5, true>
<l1, l2, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
<l2, l1, true>
<l1, l3, ((0 + y^0) <= 0)>
<l3, l1, (1 <= (0 + x^0)) /\ (undef8 = undef8), par{x^0 -> (~(1) + x^0), y^0 -> undef8}>
<l4, l3, true>
<l5, l4, true>

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef8, 

Undef variables:
undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= x^0 /\ y^0 = undef8, {x^0 -> -1 + x^0, rest 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.003174

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001011s
Ranking function: x^0
New Graphs: 
Transitions:
<l1, l1, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
Variables:
y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000456s
Ranking function: -1 + y^0
New Graphs: 
Program Terminates