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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [f5/19]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f28/11]
3. non_recursive  : [f5_loop_cont/12]
4. non_recursive  : [f0/11]

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

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

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


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

### Ranking functions of CR f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V) 
* RF of phase [8,9]: [-C+32]

#### Partial ranking functions of CR f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V) 
* Partial RF of phase [8,9]:
  - RF of loop [8:1]:
    -B+32
  - RF of loop [8:1,9:1]:
    -C+32


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


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

### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 

#### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L) 


### Specialization of cost equations f0/11 
* CE 1 is refined into CE [14,15,16] 


### Cost equations --> "Loop" of f0/11 
* CEs [14,15,16] --> Loop 14 

### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 

#### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 


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

#### Cost of chains of f5(B,C,D,E,F,G,H,I,J,M,N,O,P,Q,R,S,T,U,V):
* Chain [[8,9],11]: 1*it(8)+1*it(9)+0
  Such that:it(8) =< -B+R
aux(3) =< -C+32
it(8) =< aux(3)
it(9) =< aux(3)

  with precondition: [M=2,O=32,N=Q,N=R,T=U,T=V,1>=P,B>=0,P>=0,C>=B,N>=B+P,B+P+31>=C+N] 

* Chain [[8,9],10]: 2*it(8)+0
  Such that:aux(4) =< -C+32
it(8) =< aux(4)

  with precondition: [M=3,31>=C,B>=0,C>=B] 

* Chain [10]: 0
  with precondition: [M=3,B>=0,C>=B] 


#### Cost of chains of f5_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L):
* Chain [13]: 0
  with precondition: [A=2] 

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


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,M):
* Chain [14]: 128
  with precondition: [] 


Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,M): 
-------------------------------------
* Chain [14] with precondition: [] 
    - Upper bound: 128 
    - Complexity: constant 

### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,M): 128 
Asymptotic class: constant 
* Total analysis performed in 254 ms.