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


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


MAYBE

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

#### Computed strongly connected components 
0. recursive  : [f10/9]
1. non_recursive  : [exit_location/1]
2. recursive  : [f20/1]
3. non_recursive  : [f20_loop_cont/2]
4. non_recursive  : [f10_loop_cont/7]
5. non_recursive  : [f0/6]

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

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

### Specialization of cost equations f10/9 
* CE 4 is refined into CE [10] 
* CE 5 is refined into CE [11] 
* CE 2 is refined into CE [12] 
* CE 3 is refined into CE [13] 


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

### Ranking functions of CR f10(A,B,C,D,G,H,I,J,K) 
* RF of phase [10,11]: [A]

#### Partial ranking functions of CR f10(A,B,C,D,G,H,I,J,K) 
* Partial RF of phase [10,11]:
  - RF of loop [10:1]:
    B+7
    -C+8
  - RF of loop [10:1,11:1]:
    A
  - RF of loop [11:1]:
    A-B
    A+C-1


### Specialization of cost equations f20/1 
* CE 9 is refined into CE [14] 
* CE 8 is refined into CE [15] 


### Cost equations --> "Loop" of f20/1 
* CEs [15] --> Loop 14 
* CEs [14] --> Loop 15 

### Ranking functions of CR f20(G) 

#### Partial ranking functions of CR f20(G) 


### Specialization of cost equations f10_loop_cont/7 
* CE 7 is refined into CE [16,17] 
* CE 6 is refined into CE [18] 


### Cost equations --> "Loop" of f10_loop_cont/7 
* CEs [16] --> Loop 16 
* CEs [18] --> Loop 17 
* CEs [17] --> Loop 18 

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

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


### Specialization of cost equations f0/6 
* CE 1 is refined into CE [19,20,21,22] 


### Cost equations --> "Loop" of f0/6 
* CEs [22] --> Loop 19 
* CEs [19,20,21] --> Loop 20 

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

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


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

#### Cost of chains of f10(A,B,C,D,G,H,I,J,K):
* Chain [[10,11],13]: 1*it(10)+1*it(11)+0
  Such that:it(11) =< A-B
it(11) =< A+C
aux(3) =< A
it(10) =< aux(3)
it(11) =< aux(3)

  with precondition: [G=2,A>=1,C>=0,8>=A+C,B+C>=1] 

* Chain [[10,11],12]: 1*it(10)+1*it(11)+0
  Such that:it(11) =< A-B
it(11) =< A-B+I
it(10) =< B-I
aux(4) =< A
it(10) =< aux(4)
it(11) =< aux(4)

  with precondition: [G=3,H=0,B+C=I+J,A>=1,C>=0,8>=A+C,B>=I,B+C>=1,A+I>=B,B+C>=I+1] 

* Chain [13]: 0
  with precondition: [G=2,C>=0,8>=A+C,B+C>=1] 


#### Cost of chains of f20(G):
* Chain [[14]]...: 1*it(14)+0
  with precondition: [G=2] 

* Chain [[14],15]: 1*it(14)+0
  with precondition: [G=2] 

* Chain [15]: 0
  with precondition: [G=2] 


#### Cost of chains of f10_loop_cont(A,B,C,D,E,F,G):
* Chain [18]...: 1*s(2)+0
  with precondition: [A=3,F=8] 

* Chain [17]: 0
  with precondition: [A=2,F=8] 

* Chain [16]: 1*s(3)+0
  with precondition: [A=3,F=8] 


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

* Chain [19]...: 1*s(11)+1*s(12)+1*s(14)+0
  Such that:s(11) =< 7
aux(11) =< 8
s(11) =< aux(11)
s(12) =< aux(11)

  with precondition: [] 


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

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