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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. recursive  : [eval_aaron2_0/4,eval_aaron2_1/5,eval_aaron2_bb1_in/4,eval_aaron2_bb2_in/4,eval_aaron2_bb3_in/5,eval_aaron2_bb4_in/5]
1. non_recursive  : [eval_aaron2_stop/1]
2. non_recursive  : [eval_aaron2_bb5_in/1]
3. non_recursive  : [eval_aaron2_bb1_in_loop_cont/2]
4. non_recursive  : [eval_aaron2_bb0_in/4]
5. non_recursive  : [eval_aaron2_start/4]

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

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

### Specialization of cost equations eval_aaron2_bb1_in/4 
* CE 6 is refined into CE [8] 
* CE 7 is discarded (unfeasible) 
* CE 5 is refined into CE [9] 
* CE 4 is refined into CE [10] 


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

### Ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) 
* RF of phase [8,9]: [-V__02+V__01+1]

#### Partial ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) 
* Partial RF of phase [8,9]:
  - RF of loop [8:1,9:1]:
    -V__02+V__01+1


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


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

### Ranking functions of CR eval_aaron2_bb0_in(V_tx,V_x,V_y,B) 

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


### Specialization of cost equations eval_aaron2_start/4 
* CE 1 is refined into CE [14,15,16] 


### Cost equations --> "Loop" of eval_aaron2_start/4 
* CEs [16] --> Loop 14 
* CEs [15] --> Loop 15 
* CEs [14] --> Loop 16 

### Ranking functions of CR eval_aaron2_start(V_tx,V_x,V_y,B) 

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


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

#### Cost of chains of eval_aaron2_bb1_in(V_tx,V__02,V__01,B):
* Chain [[8,9],10]: 2*it(8)+0
  Such that:aux(2) =< V_tx-V__02+V__01+1
aux(1) =< -V__02+V__01+1
it(8) =< aux(1)
it(8) =< aux(2)

  with precondition: [B=2,V_tx>=0,V__01>=V__02] 

* Chain [10]: 0
  with precondition: [B=2,V_tx>=0,V__02>=V__01+1] 


#### Cost of chains of eval_aaron2_bb0_in(V_tx,V_x,V_y,B):
* Chain [13]: 0
  with precondition: [0>=V_tx+1] 

* Chain [12]: 0
  with precondition: [V_tx>=0,V_y>=V_x+1] 

* Chain [11]: 2*s(3)+0
  Such that:s(1) =< V_tx+V_x-V_y+1
s(2) =< V_x-V_y+1
s(3) =< s(2)
s(3) =< s(1)

  with precondition: [V_tx>=0,V_x>=V_y] 


#### Cost of chains of eval_aaron2_start(V_tx,V_x,V_y,B):
* Chain [16]: 0
  with precondition: [0>=V_tx+1] 

* Chain [15]: 0
  with precondition: [V_tx>=0,V_y>=V_x+1] 

* Chain [14]: 2*s(6)+0
  Such that:s(4) =< V_tx+V_x-V_y+1
s(5) =< V_x-V_y+1
s(6) =< s(5)
s(6) =< s(4)

  with precondition: [V_tx>=0,V_x>=V_y] 


Closed-form bounds of eval_aaron2_start(V_tx,V_x,V_y,B): 
-------------------------------------
* Chain [16] with precondition: [0>=V_tx+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [15] with precondition: [V_tx>=0,V_y>=V_x+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [14] with precondition: [V_tx>=0,V_x>=V_y] 
    - Upper bound: 2*V_x-2*V_y+2 
    - Complexity: n 

### Maximum cost of eval_aaron2_start(V_tx,V_x,V_y,B): nat(V_x-V_y+1)*2 
Asymptotic class: n 
* Total analysis performed in 92 ms.