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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f4/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [f10/3]
3. non_recursive  : [f18/3]
4. non_recursive  : [f10_loop_cont/4]
5. non_recursive  : [f4_loop_cont/4]
6. non_recursive  : [f0/3]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f4/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f10/3
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f10_loop_cont/4
5. SCC is partially evaluated into f4_loop_cont/4
6. SCC is partially evaluated into f0/3

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

### Specialization of cost equations f4/5 
* CE 3 is refined into CE [12] 
* CE 4 is refined into CE [13] 
* CE 2 is refined into CE [14] 


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

### Ranking functions of CR f4(A,B,D,E,F) 
* RF of phase [12]: [-A+2]

#### Partial ranking functions of CR f4(A,B,D,E,F) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    -A+2


### Specialization of cost equations f10/3 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 
* CE 7 is refined into CE [17] 


### Cost equations --> "Loop" of f10/3 
* CEs [17] --> Loop 15 
* CEs [15] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR f10(B,D,E) 
* RF of phase [15]: [-B+2]

#### Partial ranking functions of CR f10(B,D,E) 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    -B+2


### Specialization of cost equations f10_loop_cont/4 
* CE 11 is refined into CE [18] 
* CE 10 is refined into CE [19] 


### Cost equations --> "Loop" of f10_loop_cont/4 
* CEs [18] --> Loop 18 
* CEs [19] --> Loop 19 

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

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


### Specialization of cost equations f4_loop_cont/4 
* CE 6 is refined into CE [20,21,22,23] 
* CE 5 is refined into CE [24] 


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

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

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


### Specialization of cost equations f0/3 
* CE 1 is refined into CE [25,26,27,28] 


### Cost equations --> "Loop" of f0/3 
* CEs [25,26,27,28] --> Loop 24 

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

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


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

#### Cost of chains of f4(A,B,D,E,F):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< -A+2

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

* Chain [[12],13]: 1*it(12)+0
  Such that:it(12) =< -A+2

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

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


#### Cost of chains of f10(B,D,E):
* Chain [[15],17]: 1*it(15)+0
  Such that:it(15) =< -B+2

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

* Chain [[15],16]: 1*it(15)+0
  Such that:it(15) =< -B+2

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

* Chain [17]: 0
  with precondition: [D=2,B=E,B>=2] 

* Chain [16]: 0
  with precondition: [D=3] 


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

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


#### Cost of chains of f4_loop_cont(A,B,C,D):
* Chain [23]: 0
  with precondition: [A=3] 

* Chain [22]: 0
  with precondition: [A=4] 

* Chain [21]: 2*s(1)+0
  Such that:aux(1) =< -C+2
s(1) =< aux(1)

  with precondition: [A=4,1>=C] 

* Chain [20]: 0
  with precondition: [A=4,C>=2] 


#### Cost of chains of f0(A,B,D):
* Chain [24]: 10
  with precondition: [] 


Closed-form bounds of f0(A,B,D): 
-------------------------------------
* Chain [24] with precondition: [] 
    - Upper bound: 10 
    - Complexity: constant 

### Maximum cost of f0(A,B,D): 10 
Asymptotic class: constant 
* Total analysis performed in 105 ms.