/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/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, true>
<l3, l2, ((0 + z^0) <= (0 + y^0)), par{x^0 -> (1 + x^0)}>
<l3, l4, ((1 + y^0) <= (0 + z^0)), par{y^0 -> (1 + y^0)}>
<l4, l3, true>
<l2, l3, ((1 + x^0) <= (0 + y^0))>
<l5, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, ((1 + x^0) <= (0 + y^0))>
<l3, l3, ((0 + z^0) <= (0 + y^0)) /\ ((1 + (1 + x^0)) <= (0 + y^0)), par{x^0 -> (1 + x^0)}>
<l3, l3, ((1 + y^0) <= (0 + z^0)), par{y^0 -> (1 + 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:
<l3, l3, z^0 <= y^0 /\ 2 + x^0 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
<l3, l3, 1 + y^0 <= z^0, {y^0 -> 1 + y^0, rest remain the same}>
Variables:
x^0, y^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + x^0 <= y^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001166s
Ranking function: -5 - 5*y^0 + 5*z^0
New Graphs: 
Transitions:
<l3, l3, z^0 <= y^0 /\ 2 + x^0 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0, y^0, z^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000659s
Ranking function: -2 - x^0 + y^0
New Graphs: 
Program Terminates