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


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


MAYBE
WARNING: Excluded non-linear constraints:[C*(C*C)+1=<B*(B*B)+A*(A*A)]
WARNING: Excluded non-linear constraints:[C*(C*C)>=B*(B*B)+A*(A*A)+1]
WARNING: Excluded non-linear constraints:[C*(C*C)=B*(B*B)+A*(A*A)]
WARNING: Excluded non-linear constraints:[B*(B*B)=C*(C*C)+D*(D*D)]

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/1]
5. non_recursive  : [eval_foo_start/5]

#### 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/1
5. SCC is partially evaluated into eval_foo_start/5

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

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


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

### Ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 

#### Partial ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) 
* Partial RF of phase [8,9,10]:
  - RF of loop [8:1]:
    -V__0+1000 depends on loops [9:1,10:1] 
  - RF of loop [9:1]:
    -V__01+1000 depends on loops [10:1] 
  - RF of loop [9:1,10:1]:
    V__0/999-1 depends on loops [8:1] 
  - RF of loop [10:1]:
    V__01/999-1 depends on loops [9:1] 
    -V__03+1001


### Specialization of cost equations eval_foo_bb0_in/1 
* CE 2 is refined into CE [12,13] 


### Cost equations --> "Loop" of eval_foo_bb0_in/1 
* CEs [12,13] --> Loop 12 

### Ranking functions of CR eval_foo_bb0_in(B) 

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


### Specialization of cost equations eval_foo_start/5 
* CE 1 is refined into CE [14] 


### Cost equations --> "Loop" of eval_foo_start/5 
* CEs [14] --> Loop 13 

### Ranking functions of CR eval_foo_start(V_MAX,V_a,V_b,V_c,B) 

#### Partial ranking functions of CR eval_foo_start(V_MAX,V_a,V_b,V_c,B) 


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

#### Cost of chains of eval_foo_bb1_in(V__03,V__01,V__0,B):
* Chain [[8,9,10],11]: 2*it(8)+1*it(10)+0
  Such that:aux(19) =< -V__03+1001
it(10) =< aux(19)

  with precondition: [B=2,1000>=V__03,V__03>=1,V__01>=1,V__0>=1] 

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


#### Cost of chains of eval_foo_bb0_in(B):
* Chain [12]: 1*aux(20)+0
  with precondition: [] 


#### Cost of chains of eval_foo_start(V_MAX,V_a,V_b,V_c,B):
* Chain [13]: 1*s(4)+0
  with precondition: [] 


Closed-form bounds of eval_foo_start(V_MAX,V_a,V_b,V_c,B): 
-------------------------------------
* Chain [13] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of eval_foo_start(V_MAX,V_a,V_b,V_c,B): inf 
Asymptotic class: infinity 
* Total analysis performed in 159 ms.