/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  : [f19/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [f28/3]
3. non_recursive  : [f36/5]
4. non_recursive  : [f28_loop_cont/6]
5. non_recursive  : [f19_loop_cont/6]
6. non_recursive  : [f0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f19/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f28/3
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f28_loop_cont/6
5. SCC is partially evaluated into f19_loop_cont/6
6. SCC is partially evaluated into f0/5

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

### Specialization of cost equations f19/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 f19/5 
* CEs [14] --> Loop 12 
* CEs [12] --> Loop 13 
* CEs [13] --> Loop 14 

### Ranking functions of CR f19(B,C,E,F,G) 
* RF of phase [12]: [B+1]

#### Partial ranking functions of CR f19(B,C,E,F,G) 
* Partial RF of phase [12]:
  - RF of loop [12:1]:
    B+1


### Specialization of cost equations f28/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 f28/3 
* CEs [17] --> Loop 15 
* CEs [15] --> Loop 16 
* CEs [16] --> Loop 17 

### Ranking functions of CR f28(C,E,F) 
* RF of phase [15]: [C+1]

#### Partial ranking functions of CR f28(C,E,F) 
* Partial RF of phase [15]:
  - RF of loop [15:1]:
    C+1


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


### Cost equations --> "Loop" of f28_loop_cont/6 
* CEs [18] --> Loop 18 
* CEs [19] --> Loop 19 

### Ranking functions of CR f28_loop_cont(A,B,C,D,E,F) 

#### Partial ranking functions of CR f28_loop_cont(A,B,C,D,E,F) 


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


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

### Ranking functions of CR f19_loop_cont(A,B,C,D,E,F) 

#### Partial ranking functions of CR f19_loop_cont(A,B,C,D,E,F) 


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


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

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

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


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

#### Cost of chains of f19(B,C,E,F,G):
* Chain [[12],14]: 1*it(12)+0
  Such that:it(12) =< B+1

  with precondition: [E=3,999>=B,B>=0] 

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

  with precondition: [E=4,F+1=0,G=999,999>=B,B>=0] 

* Chain [14]: 0
  with precondition: [E=3,999>=B] 


#### Cost of chains of f28(C,E,F):
* Chain [[15],17]: 1*it(15)+0
  Such that:it(15) =< C+1

  with precondition: [E=2,F+1=0,C>=0] 

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

  with precondition: [E=3,C>=0] 

* Chain [17]: 0
  with precondition: [E=2,C=F,0>=C+1] 

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


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

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


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

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

* Chain [21]: 0
  with precondition: [A=4,E=1,0>=D+1] 

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

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


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


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

### Maximum cost of f0(A,B,C,D,E): 5000 
Asymptotic class: constant 
* Total analysis performed in 117 ms.