/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, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ ((1 + (~(1) * b_7^0)) <= 0), par{b_7^0 -> 0, y_6^0 -> (~(1) + y_6^0)}>
<l1, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef5 = undef5), par{Result_4^0 -> undef5}>
<l4, l2, true, par{b_7^0 -> 0}>
<l2, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= (0 + (~(1) * b_7^0))), par{b_7^0 -> 1, x_5^0 -> (1 + x_5^0)}>
<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef17 = undef17), par{Result_4^0 -> undef17}>
<l5, l4, true>

Fresh variables:
undef5, undef17, 

Undef variables:
undef5, undef17, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (b_7^0 = 0)>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= (0 + (~(1) * b_7^0))) /\ (0 <= ((~(1) + (~(1) * (1 + x_5^0))) + y_6^0)) /\ ((1 + (~(1) * 1)) <= 0), par{b_7^0 -> 0, x_5^0 -> (1 + x_5^0), y_6^0 -> (~(1) + y_6^0)}>
<l2, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (0 <= (0 + (~(1) * b_7^0))) /\ (((0 + (~(1) * (1 + x_5^0))) + y_6^0) <= 0) /\ (undef5 = undef5), par{b_7^0 -> 1, x_5^0 -> (1 + x_5^0)}>
<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef17 = undef17)>

Fresh variables:
undef5, undef17, 

Undef variables:
undef5, undef17, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, b_7^0 <= 0 /\ 2 + x_5^0 <= y_6^0, {b_7^0 -> 0, x_5^0 -> 1 + x_5^0, y_6^0 -> -1 + y_6^0, rest remain the same}>
Variables:
b_7^0, x_5^0, y_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, b_7^0 = 0, {all remain the same}>

Graph 2
<l2, l3, b_7^0 <= 0 /\ 1 + x_5^0 = y_6^0, {b_7^0 -> 1, x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l3, y_6^0 <= x_5^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000760s
Ranking function: -1 + (~(1) / 2)*x_5^0 + (1 / 2)*y_6^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l3}...
No cycles found.

Program Terminates