/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_t47_bb1_in/3,eval_t47_bb2_in/3]
1. non_recursive  : [eval_t47_stop/1]
2. non_recursive  : [eval_t47_bb3_in/1]
3. non_recursive  : [eval_t47_bb1_in_loop_cont/2]
4. non_recursive  : [eval_t47_bb0_in/2]
5. non_recursive  : [eval_t47_start/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_t47_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_t47_bb0_in/2
5. SCC is partially evaluated into eval_t47_start/2

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

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


### Cost equations --> "Loop" of eval_t47_bb1_in/3 
* CEs [7] --> Loop 6 
* CEs [8] --> Loop 7 
* CEs [6] --> Loop 8 

### Ranking functions of CR eval_t47_bb1_in(V_flag_0,V__0,B) 
* RF of phase [6]: [V__0]

#### Partial ranking functions of CR eval_t47_bb1_in(V_flag_0,V__0,B) 
* Partial RF of phase [6]:
  - RF of loop [6:1]:
    V__0


### Specialization of cost equations eval_t47_bb0_in/2 
* CE 2 is refined into CE [9,10] 


### Cost equations --> "Loop" of eval_t47_bb0_in/2 
* CEs [10] --> Loop 9 
* CEs [9] --> Loop 10 

### Ranking functions of CR eval_t47_bb0_in(V_n,B) 

#### Partial ranking functions of CR eval_t47_bb0_in(V_n,B) 


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


### Cost equations --> "Loop" of eval_t47_start/2 
* CEs [12] --> Loop 11 
* CEs [11] --> Loop 12 

### Ranking functions of CR eval_t47_start(V_n,B) 

#### Partial ranking functions of CR eval_t47_start(V_n,B) 


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

#### Cost of chains of eval_t47_bb1_in(V_flag_0,V__0,B):
* Chain [[6],7,8]: 1*it(6)+1
  Such that:it(6) =< V__0

  with precondition: [V_flag_0=1,B=2,V__0>=1] 

* Chain [7,8]: 1
  with precondition: [V_flag_0=1,B=2,0>=V__0] 


#### Cost of chains of eval_t47_bb0_in(V_n,B):
* Chain [10]: 1
  with precondition: [0>=V_n] 

* Chain [9]: 1*s(1)+1
  Such that:s(1) =< V_n

  with precondition: [V_n>=1] 


#### Cost of chains of eval_t47_start(V_n,B):
* Chain [12]: 1
  with precondition: [0>=V_n] 

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

  with precondition: [V_n>=1] 


Closed-form bounds of eval_t47_start(V_n,B): 
-------------------------------------
* Chain [12] with precondition: [0>=V_n] 
    - Upper bound: 1 
    - Complexity: constant 
* Chain [11] with precondition: [V_n>=1] 
    - Upper bound: V_n+1 
    - Complexity: n 

### Maximum cost of eval_t47_start(V_n,B): nat(V_n)+1 
Asymptotic class: n 
* Total analysis performed in 53 ms.