/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_real2_2/6,eval_real2_3/7,eval_real2_4/8,eval_real2_5/8,eval_real2_6/8,eval_real2_bb2_in/6,eval_real2_bb3_in/6,eval_real2_bb4_in/8,eval_real2_bb5_in/9]
1. recursive  : [eval_real2_bb1_in/3,eval_real2_bb2_in_loop_cont/4]
2. non_recursive  : [eval_real2_stop/1]
3. non_recursive  : [eval_real2_bb6_in/1]
4. non_recursive  : [eval_real2_bb1_in_loop_cont/2]
5. non_recursive  : [eval_real2_bb0_in/2]
6. non_recursive  : [eval_real2_start/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_real2_bb2_in/6
1. SCC is partially evaluated into eval_real2_bb1_in/3
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_real2_bb0_in/2
6. SCC is partially evaluated into eval_real2_start/2

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

### Specialization of cost equations eval_real2_bb2_in/6 
* CE 8 is refined into CE [9] 
* CE 6 is refined into CE [10] 
* CE 7 is refined into CE [11] 


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

### Ranking functions of CR eval_real2_bb2_in(V_len,V_again_0,V_i_0,V_again_1,B,C) 
* RF of phase [9,10]: [V_len-V_i_0-1]

#### Partial ranking functions of CR eval_real2_bb2_in(V_len,V_again_0,V_i_0,V_again_1,B,C) 
* Partial RF of phase [9,10]:
  - RF of loop [9:1,10:1]:
    V_len-V_i_0-1


### Specialization of cost equations eval_real2_bb1_in/3 
* CE 5 is refined into CE [12] 
* CE 3 is refined into CE [13,14] 
* CE 4 is refined into CE [15,16] 


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

### Ranking functions of CR eval_real2_bb1_in(V_len,V_again_0,B) 

#### Partial ranking functions of CR eval_real2_bb1_in(V_len,V_again_0,B) 


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


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

### Ranking functions of CR eval_real2_bb0_in(V_len,B) 

#### Partial ranking functions of CR eval_real2_bb0_in(V_len,B) 


### Specialization of cost equations eval_real2_start/2 
* CE 1 is refined into CE [20,21,22] 


### Cost equations --> "Loop" of eval_real2_start/2 
* CEs [22] --> Loop 20 
* CEs [21] --> Loop 21 
* CEs [20] --> Loop 22 

### Ranking functions of CR eval_real2_start(V_len,B) 

#### Partial ranking functions of CR eval_real2_start(V_len,B) 


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

#### Cost of chains of eval_real2_bb2_in(V_len,V_again_0,V_i_0,V_again_1,B,C):
* Chain [[9,10],11]: 2*it(9)+0
  Such that:aux(3) =< V_len-V_i_0
it(9) =< aux(3)

  with precondition: [B=2,V_again_1>=0,C>=0,V_len>=V_i_0+2,V_i_0>=V_again_1,V_again_1+V_len>=V_i_0+C+1] 

* Chain [11]: 0
  with precondition: [B=2,V_again_1=C,V_again_1>=0,V_i_0+1>=V_len,V_i_0>=V_again_1] 


#### Cost of chains of eval_real2_bb1_in(V_len,V_again_0,B):
* Chain [[12]]...: 3*it(12)+0
  with precondition: [V_len>=2,V_again_0>=1,B=3] 

* Chain [[12],16]: 3*it(12)+0
  with precondition: [B=3,V_len>=2,V_again_0>=1] 

* Chain [14,16]: 1
  with precondition: [V_again_0=1,B=3,1>=V_len] 


#### Cost of chains of eval_real2_bb0_in(V_len,B):
* Chain [19]: 1
  with precondition: [1>=V_len] 

* Chain [18]: 3*s(7)+0
  with precondition: [V_len>=2] 

* Chain [17]...: 3*s(8)+0
  with precondition: [V_len>=2] 


#### Cost of chains of eval_real2_start(V_len,B):
* Chain [22]: 1
  with precondition: [1>=V_len] 

* Chain [21]: 3*s(9)+0
  with precondition: [V_len>=2] 

* Chain [20]...: 3*s(10)+0
  with precondition: [V_len>=2] 


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

### Maximum cost of eval_real2_start(V_len,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 172 ms.