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


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


MAYBE
Warning: Ignored call to eval_foo_bb1_in_loop_cont/2 in equation eval_foo_bb0_in/2 

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

#### Computed strongly connected components 
0. recursive  : [eval_foo_bb1_in/2]
1. non_recursive  : [eval_foo_bb0_in/2]
2. non_recursive  : [eval_foo_start/2]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into eval_foo_bb1_in/2
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into eval_foo_start/2

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

### Specialization of cost equations eval_foo_bb1_in/2 
* CE 2 is refined into CE [5] 
* CE 3 is refined into CE [6] 
* CE 4 is refined into CE [7] 


### Cost equations --> "Loop" of eval_foo_bb1_in/2 
* CEs [5] --> Loop 5 
* CEs [6] --> Loop 6 
* CEs [7] --> Loop 7 

### Ranking functions of CR eval_foo_bb1_in(V__0,B) 
* RF of phase [5]: [V__0]
* RF of phase [6]: [-V__0]

#### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 
* Partial RF of phase [5]:
  - RF of loop [5:1]:
    V__0
* Partial RF of phase [6]:
  - RF of loop [6:1]:
    -V__0

Warning: no base case found for predicate

### Specialization of cost equations eval_foo_start/2 
* CE 1 is refined into CE [8,9,10] 


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

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

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

Warning: no base case found for predicate

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

#### Cost of chains of eval_foo_bb1_in(V__0,B):
* Chain [[7]]...: 1*it(7)+0
  with precondition: [V__0=0] 

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

  with precondition: [0>=V__0+1] 

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

  with precondition: [V__0>=1] 


#### Cost of chains of eval_foo_start(V_i,B):
* Chain [10]...: 1*s(1)+0
  with precondition: [V_i=0] 

* Chain [9]...: 1*s(2)+1*s(3)+0
  Such that:s(2) =< -V_i

  with precondition: [0>=V_i+1] 

* Chain [8]...: 1*s(4)+1*s(5)+0
  Such that:s(4) =< V_i

  with precondition: [V_i>=1] 


Closed-form bounds of eval_foo_start(V_i,B): 
-------------------------------------
* Chain [10]... with precondition: [V_i=0] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [9]... with precondition: [0>=V_i+1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [8]... with precondition: [V_i>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

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