/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_foo_bb1_in/3,eval_foo_bb2_in/3]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb3_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/2]
5. non_recursive  : [eval_foo_start/3]

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

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

### Specialization of cost equations eval_foo_bb1_in/3 
* CE 11 is refined into CE [12] 
* CE 10 is discarded (unfeasible) 
* CE 8 is discarded (unfeasible) 
* CE 9 is refined into CE [13] 
* CE 7 is refined into CE [14] 
* CE 4 is refined into CE [15] 
* CE 3 is refined into CE [16] 
* CE 6 is discarded (unfeasible) 
* CE 5 is refined into CE [17] 


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

### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* RF of phase [15]: [V__0-10]

#### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 
* Partial RF of phase [12,13,14,16]:
  - RF of loop [12:1]:
    V__0-9 depends on loops [13:1,14:1] 
  - RF of loop [13:1]:
    -V__0+2 depends on loops [12:1,16:1] 
  - RF of loop [14:1]:
    -V__0+10 depends on loops [12:1,16:1] 
  - RF of loop [16:1]:
    V__0-1 depends on loops [13:1,14:1] 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    V__0-10


### 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 [19] --> Loop 18 
* CEs [20] --> Loop 19 
* CEs [18] --> Loop 20 

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

#### Partial ranking functions of CR eval_foo_bb0_in(V_i,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 21 
* CEs [22] --> Loop 22 
* CEs [21] --> Loop 23 

### Ranking functions of CR eval_foo_start(V_i,V_up,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,V_up,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__01,V__0,B):
* Chain [[15],[12,13,14,16]]...: 4*it(12)+1*it(15)+0
  Such that:it(15) =< V__0

  with precondition: [V__01=0,B=2,V__0>=11] 

* Chain [[12,13,14,16]]...: 4*it(12)+0
  with precondition: [10>=V__0,V__01>=0,V__0>=1,1>=V__01,B=2] 

* Chain [17]: 0
  with precondition: [V__01=0,B=2,0>=V__0] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [20]: 0
  with precondition: [0>=V_i] 

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

* Chain [18]...: 1*s(2)+4*s(3)+0
  Such that:s(2) =< V_i

  with precondition: [V_i>=11] 


#### Cost of chains of eval_foo_start(V_i,V_up,B):
* Chain [23]: 0
  with precondition: [0>=V_i] 

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

* Chain [21]...: 1*s(5)+4*s(6)+0
  Such that:s(5) =< V_i

  with precondition: [V_i>=11] 


Closed-form bounds of eval_foo_start(V_i,V_up,B): 
-------------------------------------
* Chain [23] with precondition: [0>=V_i] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22]... with precondition: [10>=V_i,V_i>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [21]... with precondition: [V_i>=11] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_up,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 178 ms.