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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_speedFails1_bb1_in/4,eval_speedFails1_bb2_in/4]
1. non_recursive  : [eval_speedFails1_stop/1]
2. non_recursive  : [eval_speedFails1_bb3_in/1]
3. non_recursive  : [eval_speedFails1_bb1_in_loop_cont/2]
4. non_recursive  : [eval_speedFails1_bb0_in/4]
5. non_recursive  : [eval_speedFails1_start/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_speedFails1_bb1_in/4
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_speedFails1_bb0_in/4
5. SCC is partially evaluated into eval_speedFails1_start/4

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

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


### Cost equations --> "Loop" of eval_speedFails1_bb1_in/4 
* CEs [6] --> Loop 5 
* CEs [5] --> Loop 6 

### Ranking functions of CR eval_speedFails1_bb1_in(V_n,V_m,V__0,B) 

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


### Specialization of cost equations eval_speedFails1_bb0_in/4 
* CE 2 is refined into CE [7,8,9] 


### Cost equations --> "Loop" of eval_speedFails1_bb0_in/4 
* CEs [9] --> Loop 7 
* CEs [8] --> Loop 8 
* CEs [7] --> Loop 9 

### Ranking functions of CR eval_speedFails1_bb0_in(V_i,V_n,V_m,B) 

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


### Specialization of cost equations eval_speedFails1_start/4 
* CE 1 is refined into CE [10,11,12] 


### Cost equations --> "Loop" of eval_speedFails1_start/4 
* CEs [12] --> Loop 10 
* CEs [11] --> Loop 11 
* CEs [10] --> Loop 12 

### Ranking functions of CR eval_speedFails1_start(V_i,V_n,V_m,B) 

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


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

#### Cost of chains of eval_speedFails1_bb1_in(V_n,V_m,V__0,B):
* Chain [[5]]...: 1*it(5)+0
  with precondition: [V_n>=V__0,B=2] 

* Chain [[5],6]: 1*it(5)+0
  with precondition: [B=2,V_m>=1,V_n>=V__0] 

* Chain [6]: 0
  with precondition: [B=2,V__0>=V_n+1] 


#### Cost of chains of eval_speedFails1_bb0_in(V_i,V_n,V_m,B):
* Chain [9]: 1*s(1)+0
  with precondition: [V_m>=1,V_n>=V_i] 

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

* Chain [7]...: 1*s(2)+0
  with precondition: [V_n>=V_i] 


#### Cost of chains of eval_speedFails1_start(V_i,V_n,V_m,B):
* Chain [12]: 1*s(3)+0
  with precondition: [V_m>=1,V_n>=V_i] 

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

* Chain [10]...: 1*s(4)+0
  with precondition: [V_n>=V_i] 


Closed-form bounds of eval_speedFails1_start(V_i,V_n,V_m,B): 
-------------------------------------
* Chain [12] with precondition: [V_m>=1,V_n>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [11] with precondition: [V_i>=V_n+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [10]... with precondition: [V_n>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_speedFails1_start(V_i,V_n,V_m,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 51 ms.