/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_wcet0_0/4,eval_wcet0_1/5,eval_wcet0_bb1_in/4,eval_wcet0_bb2_in/5,eval_wcet0_bb3_in/5,eval_wcet0_bb4_in/6]
1. non_recursive  : [eval_wcet0_stop/1]
2. non_recursive  : [eval_wcet0_bb5_in/1]
3. non_recursive  : [eval_wcet0_bb1_in_loop_cont/2]
4. non_recursive  : [eval_wcet0_bb0_in/2]
5. non_recursive  : [eval_wcet0_start/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_wcet0_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_wcet0_bb0_in/2
5. SCC is partially evaluated into eval_wcet0_start/2

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

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


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

### Ranking functions of CR eval_wcet0_bb1_in(V_n,V_j_0,V_i_0,B) 
* RF of phase [12,13]: [V_i_0-1]

#### Partial ranking functions of CR eval_wcet0_bb1_in(V_n,V_j_0,V_i_0,B) 
* Partial RF of phase [12,13]:
  - RF of loop [12:1]:
    V_n+V_j_0-1 depends on loops [13:1] 
  - RF of loop [12:1,13:1]:
    V_i_0-1
  - RF of loop [13:1]:
    V_n-V_j_0-1 depends on loops [12:1] 


### Specialization of cost equations eval_wcet0_bb0_in/2 
* CE 3 is refined into CE [18,19,20,21,22] 
* CE 2 is refined into CE [23] 


### Cost equations --> "Loop" of eval_wcet0_bb0_in/2 
* CEs [20,21,22] --> Loop 18 
* CEs [23] --> Loop 19 
* CEs [18,19] --> Loop 20 

### Ranking functions of CR eval_wcet0_bb0_in(V_n,B) 

#### Partial ranking functions of CR eval_wcet0_bb0_in(V_n,B) 


### Specialization of cost equations eval_wcet0_start/2 
* CE 1 is refined into CE [24,25,26] 


### Cost equations --> "Loop" of eval_wcet0_start/2 
* CEs [26] --> Loop 21 
* CEs [25] --> Loop 22 
* CEs [24] --> Loop 23 

### Ranking functions of CR eval_wcet0_start(V_n,B) 

#### Partial ranking functions of CR eval_wcet0_start(V_n,B) 


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

#### Cost of chains of eval_wcet0_bb1_in(V_n,V_j_0,V_i_0,B):
* Chain [[12,13],17]: 2*it(12)+0
  Such that:aux(7) =< V_i_0
it(12) =< aux(7)

  with precondition: [B=2,V_n=V_i_0+V_j_0,V_j_0>=0,V_n>=V_j_0+2] 

* Chain [[12,13],16]: 2*it(12)+0
  Such that:aux(8) =< V_i_0
it(12) =< aux(8)

  with precondition: [B=2,V_j_0+V_n=V_i_0,0>=V_j_0,V_j_0+V_n>=2] 

* Chain [[12,13],15]: 2*it(12)+0
  Such that:aux(9) =< V_i_0
it(12) =< aux(9)

  with precondition: [B=2,V_i_0>=2,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0] 

* Chain [[12,13],14]: 2*it(12)+0
  Such that:aux(10) =< V_i_0
it(12) =< aux(10)

  with precondition: [B=2,V_i_0>=2,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0] 

* Chain [17]: 0
  with precondition: [V_i_0=1,B=2,V_n=V_j_0+1,V_n>=1] 

* Chain [16]: 0
  with precondition: [V_i_0=1,B=2,V_j_0+V_n=1,V_n>=1] 


#### Cost of chains of eval_wcet0_bb0_in(V_n,B):
* Chain [20]: 0
  with precondition: [V_n=1] 

* Chain [19]: 0
  with precondition: [0>=V_n] 

* Chain [18]: 8*s(6)+0
  Such that:aux(12) =< V_n
s(6) =< aux(12)

  with precondition: [V_n>=2] 


#### Cost of chains of eval_wcet0_start(V_n,B):
* Chain [23]: 0
  with precondition: [V_n=1] 

* Chain [22]: 0
  with precondition: [0>=V_n] 

* Chain [21]: 8*s(12)+0
  Such that:s(11) =< V_n
s(12) =< s(11)

  with precondition: [V_n>=2] 


Closed-form bounds of eval_wcet0_start(V_n,B): 
-------------------------------------
* Chain [23] with precondition: [V_n=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [0>=V_n] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [V_n>=2] 
    - Upper bound: 8*V_n 
    - Complexity: n 

### Maximum cost of eval_wcet0_start(V_n,B): nat(V_n)*8 
Asymptotic class: n 
* Total analysis performed in 187 ms.