/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, l8, true>
<l1, l2, true>
<l2, l3, ((0 + x_13^0) <= 0), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l4, (1 <= (0 + x_13^0)) /\ (undef25 = undef25) /\ (undef20 = (0 + undef25)) /\ (undef18 = undef18) /\ (0 <= (0 + undef20)) /\ ((0 + undef20) <= 0) /\ (undef24 = (~(1) + y_17^0)) /\ (undef22 = undef22) /\ (2 <= (0 + undef24)), par{nd_12^0 -> undef18, rv_15^0 -> undef20, st_16^0 -> undef22, y_17^0 -> undef24}>
<l4, l2, true>
<l2, l5, (1 <= (0 + x_13^0)) /\ (undef42 = undef42) /\ (undef35 = undef35), par{nd_12^0 -> undef35, rv_15^0 -> (0 + undef42)}>
<l5, l6, (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43), par{__disjvr_0^0 -> undef43}>
<l6, l7, (undef59 = undef59) /\ (undef52 = undef52), par{nd_12^0 -> undef52, x_13^0 -> (~(1) + x_13^0), y_17^0 -> (0 + undef59)}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef18, undef20, undef22, undef24, undef25, undef35, undef42, undef43, undef52, undef59, 

Undef variables:
undef18, undef20, undef22, undef24, undef25, undef35, undef42, undef43, undef52, undef59, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + x_13^0) <= 0)>
<l2, l2, (1 <= (0 + x_13^0)) /\ (undef25 = undef25) /\ (undef20 = (0 + undef25)) /\ (undef18 = undef18) /\ (0 <= (0 + undef20)) /\ ((0 + undef20) <= 0) /\ (undef24 = (~(1) + y_17^0)) /\ (undef22 = undef22) /\ (2 <= (0 + undef24)), par{y_17^0 -> undef24}>
<l2, l2, (1 <= (0 + x_13^0)) /\ (undef42 = undef42) /\ (undef35 = undef35) /\ (undef43 = __disjvr_0^0) /\ (__disjvr_0^0 = undef43) /\ (undef59 = undef59) /\ (undef52 = undef52), par{__disjvr_0^0 -> undef43, x_13^0 -> (~(1) + x_13^0), y_17^0 -> (0 + undef59)}>

Fresh variables:
undef18, undef20, undef22, undef24, undef25, undef35, undef42, undef43, undef52, undef59, 

Undef variables:
undef18, undef20, undef22, undef24, undef25, undef35, undef42, undef43, undef52, undef59, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_13^0 /\ 2 <= undef24 /\ undef20 = 0 /\ undef20 = undef25 /\ y_17^0 = 1 + undef24, {y_17^0 -> undef24, rest remain the same}>
<l2, l2, 1 <= x_13^0 /\ __disjvr_0^0 = undef43, {__disjvr_0^0 -> undef43, x_13^0 -> -1 + x_13^0, y_17^0 -> undef59, rest remain the same}>
Variables:
x_13^0, y_17^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, x_13^0 <= 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.004328

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001556s
Ranking function: -1 + x_13^0
New Graphs: 
Transitions:
<l2, l2, 1 <= x_13^0 /\ 2 <= undef24 /\ undef20 = 0 /\ undef20 = undef25 /\ y_17^0 = 1 + undef24, {y_17^0 -> undef24, rest remain the same}>
Variables:
x_13^0, y_17^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000882s
Ranking function: -3 + y_17^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l3}...
No cycles found.

Program Terminates