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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f0/9]
1. recursive  : [f0_loop_cont/12,f2/11]
2. non_recursive  : [exit_location/1]
3. non_recursive  : [f4/8]
4. non_recursive  : [f2_loop_cont/9]
5. non_recursive  : [f3/8]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f0/9
1. SCC is partially evaluated into f2/11
2. SCC is completely evaluated into other SCCs
3. SCC is completely evaluated into other SCCs
4. SCC is partially evaluated into f2_loop_cont/9
5. SCC is partially evaluated into f3/8

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

### Specialization of cost equations f0/9 
* CE 10 is refined into CE [11] 
* CE 8 is refined into CE [12] 
* CE 9 is refined into CE [13] 


### Cost equations --> "Loop" of f0/9 
* CEs [13] --> Loop 11 
* CEs [11] --> Loop 12 
* CEs [12] --> Loop 13 

### Ranking functions of CR f0(A,B,C,D,J,K,L,M,N) 
* RF of phase [11]: [A]

#### Partial ranking functions of CR f0(A,B,C,D,J,K,L,M,N) 
* Partial RF of phase [11]:
  - RF of loop [11:1]:
    A


### Specialization of cost equations f2/11 
* CE 4 is refined into CE [14] 
* CE 2 is refined into CE [15,16] 
* CE 5 is refined into CE [17] 
* CE 3 is refined into CE [18] 


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

### Ranking functions of CR f2(A,B,C,D,G,J,K,L,M,N,O) 
* RF of phase [14]: [C]

#### Partial ranking functions of CR f2(A,B,C,D,G,J,K,L,M,N,O) 
* Partial RF of phase [14]:
  - RF of loop [14:1]:
    C


### Specialization of cost equations f2_loop_cont/9 
* CE 6 is refined into CE [19] 
* CE 7 is refined into CE [20] 


### Cost equations --> "Loop" of f2_loop_cont/9 
* CEs [19] --> Loop 18 
* CEs [20] --> Loop 19 

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

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


### Specialization of cost equations f3/8 
* CE 1 is refined into CE [21,22,23,24,25] 


### Cost equations --> "Loop" of f3/8 
* CEs [21,22,23,24,25] --> Loop 20 

### Ranking functions of CR f3(A,B,C,D,E,F,G,J) 

#### Partial ranking functions of CR f3(A,B,C,D,E,F,G,J) 


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

#### Cost of chains of f0(A,B,C,D,J,K,L,M,N):
* Chain [[11],13]: 1*it(11)+0
  Such that:it(11) =< A

  with precondition: [J=2,K=0,N=1,A+L=C+1,A+M=C,A>=1] 

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

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

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


#### Cost of chains of f2(A,B,C,D,G,J,K,L,M,N,O):
* Chain [[14],17]: 1*it(14)+1*s(3)+0
  Such that:it(14) =< C

  with precondition: [J=3,C>=1] 

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

  with precondition: [J=3,C>=2] 

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

  with precondition: [J=4,K=0,N=1,L=M+1,1>=L,C>=1] 

* Chain [17]: 0
  with precondition: [J=3] 

* Chain [16]: 1*aux(2)+0
  with precondition: [J=3,C>=1] 

* Chain [15]: 0
  with precondition: [J=4,K=A,L=B,N=D,C=M,0>=C] 


#### Cost of chains of f2_loop_cont(A,B,C,D,E,F,G,H,I):
* Chain [19]: 0
  with precondition: [A=3] 

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


#### Cost of chains of f3(A,B,C,D,E,F,G,J):
* Chain [20]: 1*aux(3)+0
  with precondition: [] 


Closed-form bounds of f3(A,B,C,D,E,F,G,J): 
-------------------------------------
* Chain [20] with precondition: [] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f3(A,B,C,D,E,F,G,J): inf 
Asymptotic class: infinity 
* Total analysis performed in 207 ms.