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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_ex_paper1_bb1_in/4,eval_ex_paper1_bb2_in/4]
1. non_recursive  : [eval_ex_paper1_stop/1]
2. non_recursive  : [eval_ex_paper1_bb3_in/1]
3. non_recursive  : [eval_ex_paper1_bb1_in_loop_cont/2]
4. non_recursive  : [eval_ex_paper1_bb0_in/4]
5. non_recursive  : [eval_ex_paper1_start/4]

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

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

### Specialization of cost equations eval_ex_paper1_bb1_in/4 
* CE 6 is refined into CE [7] 
* CE 5 is refined into CE [8] 
* CE 3 is refined into CE [9] 
* CE 4 is refined into CE [10] 


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

### Ranking functions of CR eval_ex_paper1_bb1_in(V_n,V_fwd,V__0,B) 
* RF of phase [7]: [V__0]
* RF of phase [8]: [V_n-V__0]

#### Partial ranking functions of CR eval_ex_paper1_bb1_in(V_n,V_fwd,V__0,B) 
* Partial RF of phase [7]:
  - RF of loop [7:1]:
    V__0
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    V_n-V__0


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


### Cost equations --> "Loop" of eval_ex_paper1_bb0_in/4 
* CEs [14] --> Loop 11 
* CEs [13] --> Loop 12 
* CEs [11] --> Loop 13 
* CEs [12] --> Loop 14 

### Ranking functions of CR eval_ex_paper1_bb0_in(V_i,V_n,V_fwd,B) 

#### Partial ranking functions of CR eval_ex_paper1_bb0_in(V_i,V_n,V_fwd,B) 


### Specialization of cost equations eval_ex_paper1_start/4 
* CE 1 is refined into CE [15,16,17,18] 


### Cost equations --> "Loop" of eval_ex_paper1_start/4 
* CEs [18] --> Loop 15 
* CEs [17] --> Loop 16 
* CEs [16] --> Loop 17 
* CEs [15] --> Loop 18 

### Ranking functions of CR eval_ex_paper1_start(V_i,V_n,V_fwd,B) 

#### Partial ranking functions of CR eval_ex_paper1_start(V_i,V_n,V_fwd,B) 


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

#### Cost of chains of eval_ex_paper1_bb1_in(V_n,V_fwd,V__0,B):
* Chain [[8],9]: 1*it(8)+0
  Such that:it(8) =< V_n-V__0

  with precondition: [B=2,V_fwd>=1,V__0>=1,V_n>=V__0+1] 

* Chain [[7],10]: 1*it(7)+0
  Such that:it(7) =< V__0

  with precondition: [B=2,0>=V_fwd,V__0>=1,V_n>=V__0+1] 

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

* Chain [9]: 0
  with precondition: [B=2,V__0>=V_n] 


#### Cost of chains of eval_ex_paper1_bb0_in(V_i,V_n,V_fwd,B):
* Chain [14]: 0
  with precondition: [0>=V_i] 

* Chain [13]: 1*s(1)+0
  Such that:s(1) =< V_i

  with precondition: [0>=V_fwd,V_i>=1,V_n>=V_i+1] 

* Chain [12]: 1*s(2)+0
  Such that:s(2) =< -V_i+V_n

  with precondition: [V_i>=1,V_fwd>=1,V_n>=V_i+1] 

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


#### Cost of chains of eval_ex_paper1_start(V_i,V_n,V_fwd,B):
* Chain [18]: 0
  with precondition: [0>=V_i] 

* Chain [17]: 1*s(3)+0
  Such that:s(3) =< V_i

  with precondition: [0>=V_fwd,V_i>=1,V_n>=V_i+1] 

* Chain [16]: 1*s(4)+0
  Such that:s(4) =< -V_i+V_n

  with precondition: [V_i>=1,V_fwd>=1,V_n>=V_i+1] 

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


Closed-form bounds of eval_ex_paper1_start(V_i,V_n,V_fwd,B): 
-------------------------------------
* Chain [18] with precondition: [0>=V_i] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [17] with precondition: [0>=V_fwd,V_i>=1,V_n>=V_i+1] 
    - Upper bound: V_i 
    - Complexity: n 
* Chain [16] with precondition: [V_i>=1,V_fwd>=1,V_n>=V_i+1] 
    - Upper bound: -V_i+V_n 
    - Complexity: n 
* Chain [15] with precondition: [V_i>=V_n] 
    - Upper bound: 0 
    - Complexity: constant 

### Maximum cost of eval_ex_paper1_start(V_i,V_n,V_fwd,B): max([nat(V_i),nat(-V_i+V_n)]) 
Asymptotic class: n 
* Total analysis performed in 94 ms.