/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, l6, true>
<l1, l2, (undef1 = undef1) /\ (undef4 = undef4), par{x_13^0 -> undef1, y_16^0 -> undef4}>
<l2, l3, (1 <= (0 + x_13^0)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef10}>
<l4, l3, (undef14 = undef14) /\ (undef17 = undef17) /\ (1 <= (0 + y_16^0)) /\ (undef13 = (~(1) + x_13^0)) /\ (undef16 = (~(1) + y_16^0)) /\ ((0 + undef13) <= (~(1) + undef14)) /\ ((~(1) + undef14) <= (0 + undef13)) /\ ((0 + undef16) <= (~(1) + undef17)) /\ ((~(1) + undef17) <= (0 + undef16)) /\ (1 <= (0 + undef14)) /\ (1 <= (0 + undef17)), par{x_13^0 -> undef13, x_27^0 -> undef14, y_16^0 -> undef16, y_28^0 -> undef17}>
<l3, l2, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0)>
<l3, l5, (undef27 = undef27) /\ (undef30 = undef30) /\ (1 <= (0 + y_16^0)) /\ (undef25 = (~(1) + x_13^0)) /\ (undef28 = (~(1) + y_16^0)) /\ ((0 + undef25) <= (~(1) + undef27)) /\ ((~(1) + undef27) <= (0 + undef25)) /\ ((0 + undef28) <= (~(1) + undef30)) /\ ((~(1) + undef30) <= (0 + undef28)) /\ (1 <= (0 + undef30)), par{x_13^0 -> undef25, x_32^0 -> undef27, y_16^0 -> undef28, y_33^0 -> undef30}>
<l5, l3, true>
<l6, l1, true>

Fresh variables:
undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 

Undef variables:
undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (x_13^0 = undef1) /\ (y_16^0 = undef10) /\ (undef1 = undef1) /\ (undef4 = undef4) /\ (1 <= (0 + undef1)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + undef1))>
<l3, l3, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ (1 <= (0 + x_13^0)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef10}>
<l3, l3, (undef27 = undef27) /\ (undef30 = undef30) /\ (1 <= (0 + y_16^0)) /\ (undef25 = (~(1) + x_13^0)) /\ (undef28 = (~(1) + y_16^0)) /\ ((0 + undef25) <= (~(1) + undef27)) /\ ((~(1) + undef27) <= (0 + undef25)) /\ ((0 + undef28) <= (~(1) + undef30)) /\ ((~(1) + undef30) <= (0 + undef28)) /\ (1 <= (0 + undef30)), par{x_13^0 -> undef25, y_16^0 -> undef28}>

Fresh variables:
undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 

Undef variables:
undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 <= x_13^0 /\ y_16^0 <= 0 /\ undef10 = 5000, {y_16^0 -> undef10, rest remain the same}>
<l3, l3, 1 <= y_16^0 /\ 1 <= undef30 /\ 1 + undef25 = undef27 /\ 1 + undef28 = undef30 /\ x_13^0 = 1 + undef25 /\ y_16^0 = 1 + undef28, {x_13^0 -> undef25, y_16^0 -> undef28, rest remain the same}>
Variables:
x_13^0, y_16^0

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef1 /\ x_13^0 = undef1 /\ y_16^0 = undef10 /\ undef10 = 5000, {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: 4.12183

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012190s
Ranking function: (1 / 5000) + (5001 / 5000)*x_13^0 + (~(1) / 5000)*y_16^0
New Graphs: 
Transitions:
<l3, l3, 1 <= y_16^0 /\ 1 <= undef30 /\ 1 + undef25 = undef27 /\ 1 + undef28 = undef30 /\ x_13^0 = 1 + undef25 /\ y_16^0 = 1 + undef28, {x_13^0 -> undef25, y_16^0 -> undef28, rest remain the same}>
Variables:
x_13^0, y_16^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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