/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_bb2_in/3,eval_foo_bb3_in/3]
1. recursive  : [eval_foo_bb1_in/2,eval_foo_bb2_in_loop_cont/4,eval_foo_bb4_in/3]
2. non_recursive  : [eval_foo_stop/1]
3. non_recursive  : [eval_foo_bb5_in/1]
4. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
5. non_recursive  : [eval_foo_bb0_in/2]
6. 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_bb1_in/2
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 partially evaluated into eval_foo_bb0_in/2
6. 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 6 is refined into CE [7] 
* CE 5 is refined into CE [8] 


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

### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) 

#### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) 


### Specialization of cost equations eval_foo_bb1_in/2 
* CE 4 is refined into CE [9] 
* CE 3 is refined into CE [10,11] 


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

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
* RF of phase [9]: [-V__0+10]
* RF of phase [10]: [-V__0+1]

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
* Partial RF of phase [9]:
  - RF of loop [9:1]:
    -V__0+10
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    -V__0+1


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [12,13,14] 


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

### 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 [15,16,17] 


### Cost equations --> "Loop" of eval_foo_start/3 
* CEs [17] --> Loop 15 
* CEs [16] --> Loop 16 
* CEs [15] --> Loop 17 

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

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


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

#### Cost of chains of eval_foo_bb2_in(V__01,B,C):
* Chain [[7]]...: 1*it(7)+0
  with precondition: [V__01>=1,B=2] 

* Chain [8]: 0
  with precondition: [B=2,V__01=C,0>=V__01] 


#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[10],[9],11]: 1*it(9)+1*it(10)+1*s(3)+0
  Such that:it(9) =< 9
it(10) =< -V__0+1

  with precondition: [B=3,0>=V__0] 

* Chain [[9],11]: 1*it(9)+1*s(3)+0
  Such that:it(9) =< -V__0+10

  with precondition: [B=3,9>=V__0,V__0>=1] 

* Chain [11]: 0
  with precondition: [B=3,V__0>=10] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [14]: 1*s(4)+1*s(5)+0
  Such that:s(4) =< -V_i+10

  with precondition: [9>=V_i,V_i>=1] 

* Chain [13]: 1*s(6)+1*s(7)+1*s(8)+0
  Such that:s(6) =< 9
s(7) =< -V_i+1

  with precondition: [0>=V_i] 

* Chain [12]: 0
  with precondition: [V_i>=10] 


#### Cost of chains of eval_foo_start(V_i,V_j,B):
* Chain [17]: 1*s(9)+1*s(10)+0
  Such that:s(9) =< -V_i+10

  with precondition: [9>=V_i,V_i>=1] 

* Chain [16]: 1*s(11)+1*s(12)+1*s(13)+0
  Such that:s(11) =< 9
s(12) =< -V_i+1

  with precondition: [0>=V_i] 

* Chain [15]: 0
  with precondition: [V_i>=10] 


Closed-form bounds of eval_foo_start(V_i,V_j,B): 
-------------------------------------
* Chain [17] with precondition: [9>=V_i,V_i>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [16] with precondition: [0>=V_i] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [15] with precondition: [V_i>=10] 
    - Upper bound: 0 
    - Complexity: constant 

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