/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(n^1))  

Preprocessing Cost Relations
=====================================

#### Computed strongly connected components 
0. recursive  : [eval_speedSingleSingle2_0/5,eval_speedSingleSingle2_1/6,eval_speedSingleSingle2_bb1_in/5,eval_speedSingleSingle2_bb2_in/6,eval_speedSingleSingle2_bb3_in/6,eval_speedSingleSingle2_bb4_in/6,eval_speedSingleSingle2_bb5_in/6]
1. non_recursive  : [eval_speedSingleSingle2_stop/1]
2. non_recursive  : [eval_speedSingleSingle2_bb6_in/1]
3. non_recursive  : [eval_speedSingleSingle2_bb1_in_loop_cont/2]
4. non_recursive  : [eval_speedSingleSingle2_bb0_in/3]
5. non_recursive  : [eval_speedSingleSingle2_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_speedSingleSingle2_bb1_in/5
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into eval_speedSingleSingle2_bb0_in/3
5. SCC is partially evaluated into eval_speedSingleSingle2_start/3

Control-Flow Refinement of Cost Relations
=====================================

### Specialization of cost equations eval_speedSingleSingle2_bb1_in/5 
* CE 7 is refined into CE [8] 
* CE 5 is refined into CE [9] 
* CE 6 is refined into CE [10] 


### Cost equations --> "Loop" of eval_speedSingleSingle2_bb1_in/5 
* CEs [9] --> Loop 8 
* CEs [10] --> Loop 9 
* CEs [8] --> Loop 10 

### Ranking functions of CR eval_speedSingleSingle2_bb1_in(V_n,V_m,V_y_0,V_x_0,B) 
* RF of phase [8]: [V_n-V_x_0,V_n-V_y_0]
* RF of phase [9]: [V_m-V_x_0,V_m-V_y_0]

#### Partial ranking functions of CR eval_speedSingleSingle2_bb1_in(V_n,V_m,V_y_0,V_x_0,B) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    V_n-V_x_0
    V_n-V_y_0
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    V_m-V_x_0
    V_m-V_y_0


### Specialization of cost equations eval_speedSingleSingle2_bb0_in/3 
* CE 4 is refined into CE [11,12,13,14] 
* CE 3 is refined into CE [15] 
* CE 2 is refined into CE [16] 


### Cost equations --> "Loop" of eval_speedSingleSingle2_bb0_in/3 
* CEs [14] --> Loop 11 
* CEs [13] --> Loop 12 
* CEs [11] --> Loop 13 
* CEs [15] --> Loop 14 
* CEs [16] --> Loop 15 
* CEs [12] --> Loop 16 

### Ranking functions of CR eval_speedSingleSingle2_bb0_in(V_n,V_m,B) 

#### Partial ranking functions of CR eval_speedSingleSingle2_bb0_in(V_n,V_m,B) 


### Specialization of cost equations eval_speedSingleSingle2_start/3 
* CE 1 is refined into CE [17,18,19,20,21,22] 


### Cost equations --> "Loop" of eval_speedSingleSingle2_start/3 
* CEs [22] --> Loop 17 
* CEs [21] --> Loop 18 
* CEs [20] --> Loop 19 
* CEs [19] --> Loop 20 
* CEs [18] --> Loop 21 
* CEs [17] --> Loop 22 

### Ranking functions of CR eval_speedSingleSingle2_start(V_n,V_m,B) 

#### Partial ranking functions of CR eval_speedSingleSingle2_start(V_n,V_m,B) 


Computing Bounds
=====================================

#### Cost of chains of eval_speedSingleSingle2_bb1_in(V_n,V_m,V_y_0,V_x_0,B):
* Chain [[9],10]: 1*it(9)+0
  Such that:it(9) =< V_m-V_x_0

  with precondition: [B=2,V_y_0=V_x_0,V_n>=0,V_y_0>=V_n,V_m>=V_y_0+1] 

* Chain [[8],[9],10]: 1*it(8)+1*it(9)+0
  Such that:it(9) =< -V_n+V_m
it(8) =< V_n-V_x_0

  with precondition: [B=2,V_y_0=V_x_0,V_y_0>=0,V_m>=V_n+1,V_n>=V_y_0+1] 

* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< V_n-V_y_0

  with precondition: [B=2,V_y_0=V_x_0,V_m>=0,V_y_0>=0,V_n>=V_y_0+1] 

* Chain [10]: 0
  with precondition: [B=2,V_x_0=V_y_0,V_n>=0,V_m>=0,V_x_0>=0,V_m+V_n>=V_x_0] 


#### Cost of chains of eval_speedSingleSingle2_bb0_in(V_n,V_m,B):
* Chain [16]: 1*s(1)+0
  Such that:s(1) =< V_m

  with precondition: [V_n=0,V_m>=1] 

* Chain [15]: 0
  with precondition: [0>=V_n+1] 

* Chain [14]: 0
  with precondition: [0>=V_m+1] 

* Chain [13]: 0
  with precondition: [V_n>=0,V_m>=0] 

* Chain [12]: 1*s(2)+0
  Such that:s(2) =< V_n

  with precondition: [V_n>=1,V_m>=0] 

* Chain [11]: 1*s(3)+1*s(4)+0
  Such that:s(3) =< -V_n+V_m
s(4) =< V_n

  with precondition: [V_n>=1,V_m>=V_n+1] 


#### Cost of chains of eval_speedSingleSingle2_start(V_n,V_m,B):
* Chain [22]: 1*s(5)+0
  Such that:s(5) =< V_m

  with precondition: [V_n=0,V_m>=1] 

* Chain [21]: 0
  with precondition: [0>=V_n+1] 

* Chain [20]: 0
  with precondition: [0>=V_m+1] 

* Chain [19]: 0
  with precondition: [V_n>=0,V_m>=0] 

* Chain [18]: 1*s(6)+0
  Such that:s(6) =< V_n

  with precondition: [V_n>=1,V_m>=0] 

* Chain [17]: 1*s(7)+1*s(8)+0
  Such that:s(7) =< -V_n+V_m
s(8) =< V_n

  with precondition: [V_n>=1,V_m>=V_n+1] 


Closed-form bounds of eval_speedSingleSingle2_start(V_n,V_m,B): 
-------------------------------------
* Chain [22] with precondition: [V_n=0,V_m>=1] 
    - Upper bound: V_m 
    - Complexity: n 
* Chain [21] with precondition: [0>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [20] with precondition: [0>=V_m+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [19] with precondition: [V_n>=0,V_m>=0] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [18] with precondition: [V_n>=1,V_m>=0] 
    - Upper bound: V_n 
    - Complexity: n 
* Chain [17] with precondition: [V_n>=1,V_m>=V_n+1] 
    - Upper bound: V_m 
    - Complexity: n 

### Maximum cost of eval_speedSingleSingle2_start(V_n,V_m,B): max([nat(V_m),nat(-V_n+V_m)+nat(V_n)]) 
Asymptotic class: n 
* Total analysis performed in 171 ms.