/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  : [f2/7]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [f1/4]
3. non_recursive  : [f2_loop_cont/5]
4. non_recursive  : [f300/4]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f2/7
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into f2_loop_cont/5
4. SCC is partially evaluated into f300/4

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

### Specialization of cost equations f2/7 
* CE 8 is refined into CE [11] 
* CE 4 is refined into CE [12] 
* CE 5 is refined into CE [13] 
* CE 7 is refined into CE [14] 
* CE 2 is refined into CE [15] 
* CE 3 is refined into CE [16] 
* CE 6 is refined into CE [17] 


### Cost equations --> "Loop" of f2/7 
* CEs [15] --> Loop 11 
* CEs [16] --> Loop 12 
* CEs [17] --> Loop 13 
* CEs [11] --> Loop 14 
* CEs [12] --> Loop 15 
* CEs [13] --> Loop 16 
* CEs [14] --> Loop 17 

### Ranking functions of CR f2(A,B,C,F,G,H,I) 

#### Partial ranking functions of CR f2(A,B,C,F,G,H,I) 
* Partial RF of phase [11,12,13]:
  - RF of loop [11:1,12:1]:
    A-1


### Specialization of cost equations f2_loop_cont/5 
* CE 10 is refined into CE [18] 
* CE 9 is refined into CE [19] 


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

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

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


### Specialization of cost equations f300/4 
* CE 1 is refined into CE [20,21,22,23,24,25,26,27,28] 


### Cost equations --> "Loop" of f300/4 
* CEs [27,28] --> Loop 20 
* CEs [20,21,26] --> Loop 21 
* CEs [22] --> Loop 22 
* CEs [23,24] --> Loop 23 
* CEs [25] --> Loop 24 

### Ranking functions of CR f300(A,B,C,F) 

#### Partial ranking functions of CR f300(A,B,C,F) 


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

#### Cost of chains of f2(A,B,C,F,G,H,I):
* Chain [[11,12,13]]...: 2*it(11)+1*it(13)+0
  Such that:aux(3) =< A
it(11) =< aux(3)

  with precondition: [A>=1] 

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

  with precondition: [F=2,G=0,0>=H+1,A>=1] 

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

  with precondition: [F=2,G=0,A>=1,H>=1] 

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

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

* Chain [17]: 0
  with precondition: [F=2,H=0,A=G,0>=A] 

* Chain [16]: 0
  with precondition: [F=2,A=G+1,1>=A,0>=H+1] 

* Chain [15]: 0
  with precondition: [F=2,A=G+1,1>=A,H>=1] 

* Chain [14]: 0
  with precondition: [F=3] 


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

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


#### Cost of chains of f300(A,B,C,F):
* Chain [24]: 0
  with precondition: [] 

* Chain [23]: 0
  with precondition: [1>=A] 

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

* Chain [21]: 6*s(2)+3*s(3)+0
  Such that:aux(7) =< A
s(2) =< aux(7)

  with precondition: [A>=1] 

* Chain [20]...: 4*s(11)+2*s(12)+0
  Such that:aux(8) =< A
s(11) =< aux(8)

  with precondition: [A>=1] 


Closed-form bounds of f300(A,B,C,F): 
-------------------------------------
* Chain [24] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [1>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [0>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [21] with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [20]... with precondition: [A>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of f300(A,B,C,F): inf 
Asymptotic class: infinity 
* Total analysis performed in 156 ms.