/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. non_recursive  : [eval_relation1_stop/1]
1. non_recursive  : [eval_relation1_bb2_in/1]
2. non_recursive  : [eval_relation1_1/1]
3. non_recursive  : [eval_relation1_0/1]
4. non_recursive  : [eval_relation1_bb1_in/1]
5. non_recursive  : [eval_relation1_bb0_in/1]
6. non_recursive  : [eval_relation1_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
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 completely evaluated into other SCCs
5. SCC is completely evaluated into other SCCs
6. SCC is partially evaluated into eval_relation1_start/3

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

### Specialization of cost equations eval_relation1_start/3 
* CE 1 is refined into CE [2] 


### Cost equations --> "Loop" of eval_relation1_start/3 
* CEs [2] --> Loop 2 

### Ranking functions of CR eval_relation1_start(V_x,V_y,B) 

#### Partial ranking functions of CR eval_relation1_start(V_x,V_y,B) 


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

#### Cost of chains of eval_relation1_start(V_x,V_y,B):
* Chain [2]: 0
  with precondition: [] 


Closed-form bounds of eval_relation1_start(V_x,V_y,B): 
-------------------------------------
* Chain [2] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_relation1_start(V_x,V_y,B): 0 
Asymptotic class: constant 
* Total analysis performed in 5 ms.