/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_bb1_in/4,eval_foo_bb2_in/4]
1. non_recursive  : [eval_foo_stop/1]
2. non_recursive  : [eval_foo_bb3_in/1]
3. non_recursive  : [eval_foo_bb1_in_loop_cont/2]
4. non_recursive  : [eval_foo_bb0_in/2]
5. non_recursive  : [eval_foo_start/4]

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

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

### Specialization of cost equations eval_foo_bb1_in/4 
* CE 20 is refined into CE [21] 
* CE 19 is refined into CE [22] 
* CE 17 is discarded (unfeasible) 
* CE 15 is discarded (unfeasible) 
* CE 14 is discarded (unfeasible) 
* CE 13 is discarded (unfeasible) 
* CE 18 is discarded (unfeasible) 
* CE 16 is discarded (unfeasible) 
* CE 7 is refined into CE [23] 
* CE 5 is refined into CE [24] 
* CE 6 is refined into CE [25] 
* CE 4 is discarded (unfeasible) 
* CE 3 is discarded (unfeasible) 
* CE 9 is refined into CE [26] 
* CE 10 is refined into CE [27] 
* CE 8 is refined into CE [28] 
* CE 12 is refined into CE [29] 
* CE 11 is refined into CE [30] 


### Cost equations --> "Loop" of eval_foo_bb1_in/4 
* CEs [23] --> Loop 21 
* CEs [25] --> Loop 22 
* CEs [27] --> Loop 23 
* CEs [26] --> Loop 24 
* CEs [28] --> Loop 25 
* CEs [30] --> Loop 26 
* CEs [29] --> Loop 27 
* CEs [24] --> Loop 28 
* CEs [21] --> Loop 29 
* CEs [22] --> Loop 30 

### Ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 
* RF of phase [24]: [-V__0+17]
* RF of phase [27]: [V__0]

#### Partial ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 
* Partial RF of phase [21,22,23,26]:
  - RF of loop [21:1]:
    -V__01+V__0+1 depends on loops [22:1,23:1] 
  - RF of loop [21:1,26:1]:
    V__0 depends on loops [22:1,23:1] 
  - RF of loop [22:1]:
    -V__0+1 depends on loops [21:1,26:1] 
  - RF of loop [23:1]:
    -V__0+20 depends on loops [21:1,26:1] 
    V__01-V__0 depends on loops [21:1] 
  - RF of loop [26:1]:
    V__01-1
* Partial RF of phase [24]:
  - RF of loop [24:1]:
    -V__0+17
* Partial RF of phase [27]:
  - RF of loop [27:1]:
    V__0


### Specialization of cost equations eval_foo_bb0_in/2 
* CE 2 is refined into CE [31,32,33,34,35] 


### Cost equations --> "Loop" of eval_foo_bb0_in/2 
* CEs [34] --> Loop 31 
* CEs [35] --> Loop 32 
* CEs [33] --> Loop 33 
* CEs [32] --> Loop 34 
* CEs [31] --> Loop 35 

### Ranking functions of CR eval_foo_bb0_in(V_i,B) 

#### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) 


### Specialization of cost equations eval_foo_start/4 
* CE 1 is refined into CE [36,37,38,39,40] 


### Cost equations --> "Loop" of eval_foo_start/4 
* CEs [40] --> Loop 36 
* CEs [39] --> Loop 37 
* CEs [38] --> Loop 38 
* CEs [37] --> Loop 39 
* CEs [36] --> Loop 40 

### Ranking functions of CR eval_foo_start(V_i,V_range,V_up,B) 

#### Partial ranking functions of CR eval_foo_start(V_i,V_range,V_up,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__03,V__01,V__0,B):
* Chain [[27],28,[24],25,[21,22,23,26]]...: 3*it(21)+1*it(24)+1*it(26)+1*it(27)+2
  Such that:it(24) =< 16
it(26) =< 19
it(27) =< V__0

  with precondition: [V__03=0,V__01=20,B=2,18>=V__0,V__0>=1] 

* Chain [[21,22,23,26]]...: 3*it(21)+1*it(26)+0
  Such that:it(26) =< V__01

  with precondition: [V__0+2>=V__01,18*V__0+18*V__03+38>=19*V__01,V__03>=0,V__01>=V__0,V__0>=0,V__01>=1,20>=V__01,B=2] 

* Chain [30]: 0
  with precondition: [V__03=0,V__01=20,B=2,0>=V__0+1] 

* Chain [29]: 0
  with precondition: [V__03=0,V__01=20,B=2,V__0>=21] 

* Chain [28,[24],25,[21,22,23,26]]...: 3*it(21)+1*it(24)+1*it(26)+2
  Such that:it(24) =< 16
it(26) =< 19

  with precondition: [V__03=0,V__01=20,V__0=0,B=2] 


#### Cost of chains of eval_foo_bb0_in(V_i,B):
* Chain [35]: 0
  with precondition: [0>=V_i+1] 

* Chain [34]: 0
  with precondition: [V_i>=21] 

* Chain [33]...: 1*s(1)+1*s(2)+3*s(3)+2
  Such that:s(1) =< 16
s(2) =< 19

  with precondition: [V_i=0] 

* Chain [32]...: 1*s(4)+3*s(5)+0
  Such that:s(4) =< 20

  with precondition: [20>=V_i,V_i>=19] 

* Chain [31]...: 1*s(6)+1*s(7)+1*s(8)+3*s(9)+2
  Such that:s(6) =< 16
s(7) =< 19
s(8) =< V_i

  with precondition: [18>=V_i,V_i>=1] 


#### Cost of chains of eval_foo_start(V_i,V_range,V_up,B):
* Chain [40]: 0
  with precondition: [0>=V_i+1] 

* Chain [39]: 0
  with precondition: [V_i>=21] 

* Chain [38]...: 1*s(10)+1*s(11)+3*s(12)+2
  Such that:s(10) =< 16
s(11) =< 19

  with precondition: [V_i=0] 

* Chain [37]...: 1*s(13)+3*s(14)+0
  Such that:s(13) =< 20

  with precondition: [20>=V_i,V_i>=19] 

* Chain [36]...: 1*s(15)+1*s(16)+1*s(17)+3*s(18)+2
  Such that:s(15) =< 16
s(16) =< 19
s(17) =< V_i

  with precondition: [18>=V_i,V_i>=1] 


Closed-form bounds of eval_foo_start(V_i,V_range,V_up,B): 
-------------------------------------
* Chain [40] with precondition: [0>=V_i+1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [39] with precondition: [V_i>=21] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [38]... with precondition: [V_i=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [37]... with precondition: [20>=V_i,V_i>=19] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [36]... with precondition: [18>=V_i,V_i>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_i,V_range,V_up,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 554 ms.