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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_easy1_bb1_in/3,eval_easy1_bb2_in/3]
1. non_recursive  : [eval_easy1_stop/1]
2. non_recursive  : [eval_easy1_bb3_in/1]
3. non_recursive  : [eval_easy1_bb1_in_loop_cont/2]
4. non_recursive  : [eval_easy1_bb0_in/1]
5. non_recursive  : [eval_easy1_start/1]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_easy1_bb1_in/3
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_easy1_bb0_in/1
5. SCC is partially evaluated into eval_easy1_start/1

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

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


### Cost equations --> "Loop" of eval_easy1_bb1_in/3 
* CEs [8] --> Loop 7 
* CEs [9] --> Loop 8 
* CEs [10] --> Loop 9 
* CEs [7] --> Loop 10 

### Ranking functions of CR eval_easy1_bb1_in(V_0,V_x_0,B) 
* RF of phase [7]: [-V_x_0/2+20]
* RF of phase [8]: [-V_x_0/2+20]
* RF of phase [9]: [-V_x_0+40]

#### Partial ranking functions of CR eval_easy1_bb1_in(V_0,V_x_0,B) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    -V_x_0/2+20
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    -V_x_0/2+20
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    -V_x_0+40


### Specialization of cost equations eval_easy1_bb0_in/1 
* CE 2 is refined into CE [11,12,13] 


### Cost equations --> "Loop" of eval_easy1_bb0_in/1 
* CEs [11,12,13] --> Loop 11 

### Ranking functions of CR eval_easy1_bb0_in(B) 

#### Partial ranking functions of CR eval_easy1_bb0_in(B) 


### Specialization of cost equations eval_easy1_start/1 
* CE 1 is refined into CE [14] 


### Cost equations --> "Loop" of eval_easy1_start/1 
* CEs [14] --> Loop 12 

### Ranking functions of CR eval_easy1_start(B) 

#### Partial ranking functions of CR eval_easy1_start(B) 


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

#### Cost of chains of eval_easy1_bb1_in(V_0,V_x_0,B):
* Chain [[9],10]: 1*it(9)+0
  Such that:it(9) =< -V_x_0+40

  with precondition: [V_0=0,B=2,39>=V_x_0,V_x_0>=0] 

* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< -V_x_0/2+20

  with precondition: [B=2,0>=V_0+1,39>=V_x_0,V_x_0>=0] 

* Chain [[7],10]: 1*it(7)+0
  Such that:it(7) =< -V_x_0/2+20

  with precondition: [B=2,39>=V_x_0,V_0>=1,V_x_0>=0] 


#### Cost of chains of eval_easy1_bb0_in(B):
* Chain [11]: 80
  with precondition: [] 


#### Cost of chains of eval_easy1_start(B):
* Chain [12]: 80
  with precondition: [] 


Closed-form bounds of eval_easy1_start(B): 
-------------------------------------
* Chain [12] with precondition: [] 
    - Upper bound: 80 
    - Complexity: constant 

### Maximum cost of eval_easy1_start(B): 80 
Asymptotic class: constant 
* Total analysis performed in 84 ms.