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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_14/8,eval_foo_15/9,eval_foo_4/7,eval_foo_5/8,eval_foo_7/9,eval_foo_8/10,eval_foo_bb10_in/7,eval_foo_bb11_in/7,eval_foo_bb12_in/7,eval_foo_bb1_in/7,eval_foo_bb2_in/7,eval_foo_bb3_in/7,eval_foo_bb4_in/7,eval_foo_bb5_in/7,eval_foo_bb6_in/7,eval_foo_bb7_in/8,eval_foo_bb8_in/8,eval_foo_bb9_in/7]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo__critedge_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/7]
5. non_recursive  : [eval_foo_start/7]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/7
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_foo_bb0_in/7
5. SCC is partially evaluated into eval_foo_start/7

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

### Specialization of cost equations eval_foo_bb1_in/7 
* CE 10 is refined into CE [11] 
* CE 6 is refined into CE [12] 
* CE 3 is refined into CE [13] 
* CE 4 is refined into CE [14] 
* CE 9 is refined into CE [15] 
* CE 5 is refined into CE [16] 
* CE 8 is refined into CE [17] 
* CE 7 is refined into CE [18] 


### Cost equations --> "Loop" of eval_foo_bb1_in/7 
* CEs [15] --> Loop 11 
* CEs [16] --> Loop 12 
* CEs [17] --> Loop 13 
* CEs [18] --> Loop 14 
* CEs [11] --> Loop 15 
* CEs [12] --> Loop 16 
* CEs [13] --> Loop 17 
* CEs [14] --> Loop 18 

### Ranking functions of CR eval_foo_bb1_in(V_an,V_bn,V__010,V__05,V__01,V__0,B) 
* RF of phase [14]: [V_an-V__0+1]

#### Partial ranking functions of CR eval_foo_bb1_in(V_an,V_bn,V__010,V__05,V__01,V__0,B) 
* Partial RF of phase [11,13]:
  - RF of loop [13:1]:
    V_an-V__0+1
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    V_an-V__0+1


### Specialization of cost equations eval_foo_bb0_in/7 
* CE 2 is refined into CE [19,20,21,22,23,24,25,26,27,28,29] 


### Cost equations --> "Loop" of eval_foo_bb0_in/7 
* CEs [28] --> Loop 19 
* CEs [27,29] --> Loop 20 
* CEs [19] --> Loop 21 
* CEs [21] --> Loop 22 
* CEs [20] --> Loop 23 
* CEs [22] --> Loop 24 
* CEs [23] --> Loop 25 
* CEs [25] --> Loop 26 
* CEs [24] --> Loop 27 
* CEs [26] --> Loop 28 

### Ranking functions of CR eval_foo_bb0_in(V_i,V_j,V_k,V_an,V_bn,V_tk,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_i,V_j,V_k,V_an,V_bn,V_tk,B) 


### Specialization of cost equations eval_foo_start/7 
* CE 1 is refined into CE [30,31,32,33,34,35,36,37,38,39] 


### Cost equations --> "Loop" of eval_foo_start/7 
* CEs [39] --> Loop 29 
* CEs [38] --> Loop 30 
* CEs [37] --> Loop 31 
* CEs [36] --> Loop 32 
* CEs [35] --> Loop 33 
* CEs [34] --> Loop 34 
* CEs [33] --> Loop 35 
* CEs [32] --> Loop 36 
* CEs [31] --> Loop 37 
* CEs [30] --> Loop 38 

### Ranking functions of CR eval_foo_start(V_i,V_j,V_k,V_an,V_bn,V_tk,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,V_j,V_k,V_an,V_bn,V_tk,B) 


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

#### Cost of chains of eval_foo_bb1_in(V_an,V_bn,V__010,V__05,V__01,V__0,B):
* Chain [[14],18]: 1*it(14)+0
  Such that:it(14) =< V_an-V__0+1

  with precondition: [B=2,V__01>=V_bn+1,V__05>=V__010+1,V_an>=V__0] 

* Chain [[12]]...: 1*it(12)+0
  with precondition: [V__0>=V_an+1,V_bn>=V__01,V__05>=V__010+1,B=2] 

* Chain [[12],18]: 1*it(12)+0
  with precondition: [B=2,V__0>=V_an+1,V__05>=V__010+1,V_bn>=V__01] 

* Chain [[12],17]: 1*it(12)+0
  with precondition: [B=2,V__0>=V_an+1,V__05>=V__010+1,V_bn>=V__01] 

* Chain [[11,13]]...: 1*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0+1

  with precondition: [V__05>=V__010+1,V_an>=V__0,V_bn>=V__01,B=2] 

* Chain [[11,13],[14],18]: 1*it(11)+1*it(13)+1*it(14)+0
  Such that:it(13) =< V_an-V__0
aux(1) =< V_an-V__0+1
it(13) =< aux(1)
it(14) =< aux(1)

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0] 

* Chain [[11,13],[12]]...: 2*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0+1

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0] 

* Chain [[11,13],[12],18]: 2*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0+1

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0] 

* Chain [[11,13],[12],17]: 2*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0+1

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0] 

* Chain [[11,13],16]: 1*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0] 

* Chain [[11,13],15]: 1*it(11)+1*it(13)+0
  Such that:it(13) =< V_an-V__0

  with precondition: [B=2,V__05>=V__010+1,V_bn>=V__01,V_an>=V__0,V_bn>=V__01+V__05] 

* Chain [18]: 0
  with precondition: [B=2,V__0>=V_an+1,V__01>=V_bn+1] 

* Chain [17]: 0
  with precondition: [B=2,V__0>=V_an+1,V__010>=V__05] 

* Chain [16]: 0
  with precondition: [B=2,V__01>=V_bn+1,V__010>=V__05,V_an>=V__0] 

* Chain [15]: 0
  with precondition: [B=2,V__010>=V__05,V_bn>=V__01,V_an>=V__0] 


#### Cost of chains of eval_foo_bb0_in(V_i,V_j,V_k,V_an,V_bn,V_tk,B):
* Chain [28]: 0
  with precondition: [V_an>=V_i,V_bn>=V_j,V_tk>=V_k] 

* Chain [27]: 1*s(15)+1*s(16)+3*s(17)+6*s(18)+0
  Such that:s(13) =< -V_i+V_an
s(14) =< -V_i+V_an+1
s(15) =< s(13)
s(16) =< s(13)
s(17) =< s(14)
s(16) =< s(14)

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 

* Chain [26]: 1*s(19)+1*s(20)+0
  Such that:s(19) =< -V_i+V_an

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1,V_bn>=V_j+V_k] 

* Chain [25]: 0
  with precondition: [V_an>=V_i,V_tk>=V_k,V_j>=V_bn+1] 

* Chain [24]: 1*s(21)+0
  Such that:s(21) =< -V_i+V_an+1

  with precondition: [V_an>=V_i,V_j>=V_bn+1,V_k>=V_tk+1] 

* Chain [23]: 1*s(22)+0
  with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 

* Chain [22]: 0
  with precondition: [V_tk>=V_k,V_i>=V_an+1] 

* Chain [21]: 0
  with precondition: [V_i>=V_an+1,V_j>=V_bn+1] 

* Chain [20]...: 2*s(23)+3*s(24)+0
  Such that:aux(5) =< -V_i+V_an+1
s(23) =< aux(5)

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 

* Chain [19]...: 1*s(27)+0
  with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 


#### Cost of chains of eval_foo_start(V_i,V_j,V_k,V_an,V_bn,V_tk,B):
* Chain [38]: 0
  with precondition: [V_an>=V_i,V_bn>=V_j,V_tk>=V_k] 

* Chain [37]: 1*s(30)+1*s(31)+3*s(32)+6*s(33)+0
  Such that:s(28) =< -V_i+V_an
s(29) =< -V_i+V_an+1
s(30) =< s(28)
s(31) =< s(28)
s(32) =< s(29)
s(31) =< s(29)

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 

* Chain [36]: 1*s(34)+1*s(35)+0
  Such that:s(34) =< -V_i+V_an

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1,V_bn>=V_j+V_k] 

* Chain [35]: 0
  with precondition: [V_an>=V_i,V_tk>=V_k,V_j>=V_bn+1] 

* Chain [34]: 1*s(36)+0
  Such that:s(36) =< -V_i+V_an+1

  with precondition: [V_an>=V_i,V_j>=V_bn+1,V_k>=V_tk+1] 

* Chain [33]: 1*s(37)+0
  with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 

* Chain [32]: 0
  with precondition: [V_tk>=V_k,V_i>=V_an+1] 

* Chain [31]: 0
  with precondition: [V_i>=V_an+1,V_j>=V_bn+1] 

* Chain [30]...: 2*s(39)+3*s(40)+0
  Such that:s(38) =< -V_i+V_an+1
s(39) =< s(38)

  with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 

* Chain [29]...: 1*s(41)+0
  with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 


Closed-form bounds of eval_foo_start(V_i,V_j,V_k,V_an,V_bn,V_tk,B): 
-------------------------------------
* Chain [38] with precondition: [V_an>=V_i,V_bn>=V_j,V_tk>=V_k] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [37] with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [36] with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1,V_bn>=V_j+V_k] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [35] with precondition: [V_an>=V_i,V_tk>=V_k,V_j>=V_bn+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [34] with precondition: [V_an>=V_i,V_j>=V_bn+1,V_k>=V_tk+1] 
    - Upper bound: -V_i+V_an+1 
    - Complexity: n 
* Chain [33] with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [32] with precondition: [V_tk>=V_k,V_i>=V_an+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [31] with precondition: [V_i>=V_an+1,V_j>=V_bn+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [30]... with precondition: [V_an>=V_i,V_bn>=V_j,V_k>=V_tk+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [29]... with precondition: [V_bn>=V_j,V_i>=V_an+1,V_k>=V_tk+1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_j,V_k,V_an,V_bn,V_tk,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 510 ms.