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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb2_in/3,eval_foo_bb3_in/3]
1. recursive  : [eval_foo_bb5_in/5,eval_foo_bb6_in/5]
2. recursive  : [eval_foo_bb1_in/2,eval_foo_bb2_in_loop_cont/4,eval_foo_bb4_in/3,eval_foo_bb5_in_loop_cont/3,eval_foo_bb7_in/3]
3. non_recursive  : [eval_foo_stop/1]
4. non_recursive  : [eval_foo_bb8_in/1]
5. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
6. non_recursive  : [eval_foo_bb0_in/2]
7. non_recursive  : [eval_foo_start/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb2_in/3
1. SCC is partially evaluated into eval_foo_bb5_in/5
2. SCC is partially evaluated into eval_foo_bb1_in/2
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_foo_bb0_in/2
7. SCC is partially evaluated into eval_foo_start/3

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

### Specialization of cost equations eval_foo_bb2_in/3 
* CE 8 is refined into CE [11] 
* CE 7 is refined into CE [12] 


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

### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
* RF of phase [10]: [V__01-1]

#### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    V__01-1


### Specialization of cost equations eval_foo_bb5_in/5 
* CE 10 is refined into CE [13] 
* CE 9 is refined into CE [14] 


### Cost equations --> "Loop" of eval_foo_bb5_in/5 
* CEs [14] --> Loop 12 
* CEs [13] --> Loop 13 

### Ranking functions of CR eval_foo_bb5_in(V__0,V__01,V__12,B,C) 
* RF of phase [12]: [V__0/2-V__12]

#### Partial ranking functions of CR eval_foo_bb5_in(V__0,V__01,V__12,B,C) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    V__0/2-V__12


### Specialization of cost equations eval_foo_bb1_in/2 
* CE 6 is refined into CE [15] 
* CE 3 is refined into CE [16] 
* CE 4 is discarded (unfeasible) 
* CE 5 is refined into CE [17] 


### Cost equations --> "Loop" of eval_foo_bb1_in/2 
* CEs [16] --> Loop 14 
* CEs [17] --> Loop 15 
* CEs [15] --> Loop 16 

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
* Partial RF of phase [14,15]:
  - RF of loop [14:1]:
    V__0-1 depends on loops [15:1] 


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [18,19,20] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [20] --> Loop 17 
* CEs [19] --> Loop 18 
* CEs [18] --> Loop 19 

### Ranking functions of CR eval_foo_bb0_in(V_x,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_x,B) 


### Specialization of cost equations eval_foo_start/3 
* CE 1 is refined into CE [21,22,23] 


### Cost equations --> "Loop" of eval_foo_start/3 
* CEs [23] --> Loop 20 
* CEs [22] --> Loop 21 
* CEs [21] --> Loop 22 

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

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


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

#### Cost of chains of eval_foo_bb2_in(V__01,B,C):
* Chain [[10],11]: 1*it(10)+0
  Such that:it(10) =< V__01-C

  with precondition: [B=2,1>=C,C>=0,V__01>=C+2] 


#### Cost of chains of eval_foo_bb5_in(V__0,V__01,V__12,B,C):
* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< V__0/2-V__12

  with precondition: [V__01=0,B=3,V__12>=0,V__0+1>=2*C,2*C>=V__0,C>=V__12+1,V__0+V__12>=C+1] 


#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[14,15]]...: 5*it(14)+0
  with precondition: [V__0>=2,B=4] 

* Chain [[14,15],16]: 5*it(14)+0
  with precondition: [B=4,V__0>=2] 

* Chain [16]: 0
  with precondition: [B=4,1>=V__0] 


#### Cost of chains of eval_foo_bb0_in(V_x,B):
* Chain [19]: 0
  with precondition: [1>=V_x] 

* Chain [18]: 5*s(10)+0
  with precondition: [V_x>=2] 

* Chain [17]...: 5*s(11)+0
  with precondition: [V_x>=2] 


#### Cost of chains of eval_foo_start(V_x,V_y,B):
* Chain [22]: 0
  with precondition: [1>=V_x] 

* Chain [21]: 5*s(12)+0
  with precondition: [V_x>=2] 

* Chain [20]...: 5*s(13)+0
  with precondition: [V_x>=2] 


Closed-form bounds of eval_foo_start(V_x,V_y,B): 
-------------------------------------
* Chain [22] with precondition: [1>=V_x] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [V_x>=2] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [V_x>=2] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_x,V_y,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 159 ms.