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


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


WORST_CASE(?,O(n^1))  

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

#### Computed strongly connected components 
0. non_recursive  : [f1/3]
1. recursive  : [f5/5]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f5_loop_cont/4]
4. non_recursive  : [f300/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is completely evaluated into other SCCs
1. SCC is partially evaluated into f5/5
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f5_loop_cont/4
4. SCC is partially evaluated into f300/3

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

### Specialization of cost equations f5/5 
* CE 5 is refined into CE [8] 
* CE 4 is refined into CE [9] 
* CE 3 is refined into CE [10] 


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

### Ranking functions of CR f5(A,B,D,E,F) 
* RF of phase [8]: [A]

#### Partial ranking functions of CR f5(A,B,D,E,F) 
* Partial RF of phase [8]:
  - RF of loop [8:1]:
    A


### Specialization of cost equations f5_loop_cont/4 
* CE 7 is refined into CE [11] 
* CE 6 is refined into CE [12] 


### Cost equations --> "Loop" of f5_loop_cont/4 
* CEs [11] --> Loop 11 
* CEs [12] --> Loop 12 

### Ranking functions of CR f5_loop_cont(A,B,C,D) 

#### Partial ranking functions of CR f5_loop_cont(A,B,C,D) 


### Specialization of cost equations f300/3 
* CE 2 is refined into CE [13,14,15,16] 
* CE 1 is refined into CE [17] 


### Cost equations --> "Loop" of f300/3 
* CEs [14,16] --> Loop 13 
* CEs [15] --> Loop 14 
* CEs [17] --> Loop 15 
* CEs [13] --> Loop 16 

### Ranking functions of CR f300(A,B,D) 

#### Partial ranking functions of CR f300(A,B,D) 


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

#### Cost of chains of f5(A,B,D,E,F):
* Chain [[8],10]: 1*it(8)+0
  Such that:it(8) =< A

  with precondition: [D=2,E=0,A>=1] 

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

  with precondition: [D=3,A>=1] 

* Chain [10]: 0
  with precondition: [A=0,D=2,E=0] 

* Chain [9]: 0
  with precondition: [D=3,A>=0] 


#### Cost of chains of f5_loop_cont(A,B,C,D):
* Chain [12]: 0
  with precondition: [A=2] 

* Chain [11]: 0
  with precondition: [A=3] 


#### Cost of chains of f300(A,B,D):
* Chain [16]: 0
  with precondition: [A=1] 

* Chain [15]: 0
  with precondition: [0>=A] 

* Chain [14]: 0
  with precondition: [A>=1] 

* Chain [13]: 2*s(1)+0
  Such that:aux(1) =< A
s(1) =< aux(1)

  with precondition: [A>=2] 


Closed-form bounds of f300(A,B,D): 
-------------------------------------
* Chain [16] with precondition: [A=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [15] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [14] with precondition: [A>=1] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [13] with precondition: [A>=2] 
    - Upper bound: 2*A 
    - Complexity: n 

### Maximum cost of f300(A,B,D): nat(A)*2 
Asymptotic class: n 
* Total analysis performed in 61 ms.