/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f20/5]
1. recursive  : [f11/3,f14/3,f20_loop_cont/4]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f11_loop_cont/2]
4. non_recursive  : [f0/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f20/5
1. SCC is partially evaluated into f11/3
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f0/4

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

### Specialization of cost equations f20/5 
* CE 9 is refined into CE [10] 
* CE 8 is refined into CE [11] 
* CE 7 is refined into CE [12] 


### Cost equations --> "Loop" of f20/5 
* CEs [12] --> Loop 10 
* CEs [10] --> Loop 11 
* CEs [11] --> Loop 12 

### Ranking functions of CR f20(A,B,F,G,H) 
* RF of phase [10]: [A-2]

#### Partial ranking functions of CR f20(A,B,F,G,H) 
* Partial RF of phase [10]:
  - RF of loop [10:1]:
    A-2


### Specialization of cost equations f11/3 
* CE 4 is refined into CE [13,14] 
* CE 6 is refined into CE [15] 
* CE 5 is refined into CE [16,17] 
* CE 3 is refined into CE [18] 
* CE 2 is refined into CE [19] 


### Cost equations --> "Loop" of f11/3 
* CEs [17] --> Loop 13 
* CEs [18] --> Loop 14 
* CEs [19] --> Loop 15 
* CEs [16] --> Loop 16 
* CEs [14] --> Loop 17 
* CEs [13] --> Loop 18 
* CEs [15] --> Loop 19 

### Ranking functions of CR f11(A,B,F) 

#### Partial ranking functions of CR f11(A,B,F) 
* Partial RF of phase [13,15,16]:
  - RF of loop [15:1]:
    -A+6 depends on loops [16:1] 
  - RF of loop [16:1]:
    A-2 depends on loops [15:1] 


### Specialization of cost equations f0/4 
* CE 1 is refined into CE [20,21,22,23,24,25,26,27] 


### Cost equations --> "Loop" of f0/4 
* CEs [25,26,27] --> Loop 20 
* CEs [20,21,22,23,24] --> Loop 21 

### Ranking functions of CR f0(A,B,C,F) 

#### Partial ranking functions of CR f0(A,B,C,F) 


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

#### Cost of chains of f20(A,B,F,G,H):
* Chain [[10],12]: 1*it(10)+0
  Such that:it(10) =< A

  with precondition: [F=2,G=2,5>=A,A>=3,B>=1] 

* Chain [[10],11]: 1*it(10)+0
  Such that:it(10) =< A

  with precondition: [F=3,5>=A,A>=3,B>=1] 

* Chain [12]: 0
  with precondition: [F=2,A=G,2>=A,B>=1] 

* Chain [11]: 0
  with precondition: [F=3,5>=A,B>=1] 


#### Cost of chains of f11(A,B,F):
* Chain [[14]]...: 1*it(14)+0
  with precondition: [A>=6,F=3] 

* Chain [[14],19]: 1*it(14)+0
  with precondition: [F=3,A>=6] 

* Chain [[13,15,16]]...: 4*it(13)+0
  with precondition: [5>=A,F=3] 

* Chain [[13,15,16],[14]]...: 5*it(13)+0
  with precondition: [F=3,5>=A] 

* Chain [[13,15,16],[14],19]: 5*it(13)+0
  with precondition: [F=3,5>=A] 

* Chain [[13,15,16],19]: 4*it(13)+0
  with precondition: [F=3,5>=A] 

* Chain [[13,15,16],18]: 4*it(13)+1*s(4)+0
  Such that:s(4) =< 5

  with precondition: [F=3,5>=A] 

* Chain [[13,15,16],17]: 4*it(13)+0
  with precondition: [F=3,5>=A] 

* Chain [19]: 0
  with precondition: [F=3] 

* Chain [18]: 1*s(4)+0
  Such that:s(4) =< A

  with precondition: [F=3,5>=A,A>=3,B>=1] 

* Chain [17]: 0
  with precondition: [F=3,5>=A,B>=1] 


#### Cost of chains of f0(A,B,C,F):
* Chain [21]: 1*aux(9)+0
  with precondition: [] 

* Chain [20]...: 1*aux(10)+0
  with precondition: [] 


Closed-form bounds of f0(A,B,C,F): 
-------------------------------------
* Chain [21] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f0(A,B,C,F): inf 
Asymptotic class: infinity 
* Total analysis performed in 172 ms.