/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  : [f17/5]
1. non_recursive  : [exit_location/1]
2. recursive  : [f27/5]
3. recursive  : [f37/5]
4. recursive  : [f45/5]
5. recursive  : [f55/5]
6. recursive  : [f65/5]
7. recursive  : [f75/5]
8. recursive  : [f83/3]
9. non_recursive  : [f93/10]
10. non_recursive  : [f83_loop_cont/11]
11. non_recursive  : [f75_loop_cont/11]
12. non_recursive  : [f65_loop_cont/11]
13. non_recursive  : [f55_loop_cont/11]
14. non_recursive  : [f45_loop_cont/11]
15. non_recursive  : [f37_loop_cont/11]
16. non_recursive  : [f27_loop_cont/11]
17. non_recursive  : [f17_loop_cont/11]
18. non_recursive  : [f0/10]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into f17/5
1. SCC is completely evaluated into other SCCs
2. SCC is partially evaluated into f27/5
3. SCC is partially evaluated into f37/5
4. SCC is partially evaluated into f45/5
5. SCC is partially evaluated into f55/5
6. SCC is partially evaluated into f65/5
7. SCC is partially evaluated into f75/5
8. SCC is partially evaluated into f83/3
9. SCC is completely evaluated into other SCCs
10. SCC is partially evaluated into f83_loop_cont/11
11. SCC is partially evaluated into f75_loop_cont/11
12. SCC is partially evaluated into f65_loop_cont/11
13. SCC is partially evaluated into f55_loop_cont/11
14. SCC is partially evaluated into f45_loop_cont/11
15. SCC is partially evaluated into f37_loop_cont/11
16. SCC is partially evaluated into f27_loop_cont/11
17. SCC is partially evaluated into f17_loop_cont/11
18. SCC is partially evaluated into f0/10

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

### Specialization of cost equations f17/5 
* CE 3 is refined into CE [42] 
* CE 4 is refined into CE [43] 
* CE 2 is refined into CE [44] 


### Cost equations --> "Loop" of f17/5 
* CEs [44] --> Loop 42 
* CEs [42] --> Loop 43 
* CEs [43] --> Loop 44 

### Ranking functions of CR f17(D,E,L,M,N) 
* RF of phase [42]: [-D+50]

#### Partial ranking functions of CR f17(D,E,L,M,N) 
* Partial RF of phase [42]:
  - RF of loop [42:1]:
    -D+50


### Specialization of cost equations f27/5 
* CE 8 is refined into CE [45] 
* CE 9 is refined into CE [46] 
* CE 7 is refined into CE [47] 


### Cost equations --> "Loop" of f27/5 
* CEs [47] --> Loop 45 
* CEs [45] --> Loop 46 
* CEs [46] --> Loop 47 

### Ranking functions of CR f27(E,F,L,M,N) 
* RF of phase [45]: [-E+50]

#### Partial ranking functions of CR f27(E,F,L,M,N) 
* Partial RF of phase [45]:
  - RF of loop [45:1]:
    -E+50


### Specialization of cost equations f37/5 
* CE 13 is refined into CE [48] 
* CE 14 is refined into CE [49] 
* CE 12 is refined into CE [50] 


### Cost equations --> "Loop" of f37/5 
* CEs [50] --> Loop 48 
* CEs [48] --> Loop 49 
* CEs [49] --> Loop 50 

### Ranking functions of CR f37(A,F,L,M,N) 
* RF of phase [48]: [-F+50]

#### Partial ranking functions of CR f37(A,F,L,M,N) 
* Partial RF of phase [48]:
  - RF of loop [48:1]:
    -F+50


### Specialization of cost equations f45/5 
* CE 18 is refined into CE [51] 
* CE 19 is refined into CE [52] 
* CE 17 is refined into CE [53] 


### Cost equations --> "Loop" of f45/5 
* CEs [53] --> Loop 51 
* CEs [51] --> Loop 52 
* CEs [52] --> Loop 53 

### Ranking functions of CR f45(A,G,L,M,N) 
* RF of phase [51]: [-A+50]

#### Partial ranking functions of CR f45(A,G,L,M,N) 
* Partial RF of phase [51]:
  - RF of loop [51:1]:
    -A+50


### Specialization of cost equations f55/5 
* CE 23 is refined into CE [54] 
* CE 24 is refined into CE [55] 
* CE 22 is refined into CE [56] 


### Cost equations --> "Loop" of f55/5 
* CEs [56] --> Loop 54 
* CEs [54] --> Loop 55 
* CEs [55] --> Loop 56 

### Ranking functions of CR f55(G,H,L,M,N) 
* RF of phase [54]: [-G+50]

#### Partial ranking functions of CR f55(G,H,L,M,N) 
* Partial RF of phase [54]:
  - RF of loop [54:1]:
    -G+50


### Specialization of cost equations f65/5 
* CE 28 is refined into CE [57] 
* CE 29 is refined into CE [58] 
* CE 27 is refined into CE [59] 


### Cost equations --> "Loop" of f65/5 
* CEs [59] --> Loop 57 
* CEs [57] --> Loop 58 
* CEs [58] --> Loop 59 

### Ranking functions of CR f65(H,I,L,M,N) 
* RF of phase [57]: [-H+50]

#### Partial ranking functions of CR f65(H,I,L,M,N) 
* Partial RF of phase [57]:
  - RF of loop [57:1]:
    -H+50


### Specialization of cost equations f75/5 
* CE 33 is refined into CE [60] 
* CE 34 is refined into CE [61] 
* CE 32 is refined into CE [62] 


### Cost equations --> "Loop" of f75/5 
* CEs [62] --> Loop 60 
* CEs [60] --> Loop 61 
* CEs [61] --> Loop 62 

### Ranking functions of CR f75(A,I,L,M,N) 
* RF of phase [60]: [-I+50]

#### Partial ranking functions of CR f75(A,I,L,M,N) 
* Partial RF of phase [60]:
  - RF of loop [60:1]:
    -I+50


### Specialization of cost equations f83/3 
* CE 39 is refined into CE [63] 
* CE 38 is refined into CE [64] 
* CE 37 is refined into CE [65] 


### Cost equations --> "Loop" of f83/3 
* CEs [65] --> Loop 63 
* CEs [63] --> Loop 64 
* CEs [64] --> Loop 65 

### Ranking functions of CR f83(A,L,M) 
* RF of phase [63]: [-A+50]

#### Partial ranking functions of CR f83(A,L,M) 
* Partial RF of phase [63]:
  - RF of loop [63:1]:
    -A+50


### Specialization of cost equations f83_loop_cont/11 
* CE 41 is refined into CE [66] 
* CE 40 is refined into CE [67] 


### Cost equations --> "Loop" of f83_loop_cont/11 
* CEs [66] --> Loop 66 
* CEs [67] --> Loop 67 

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

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


### Specialization of cost equations f75_loop_cont/11 
* CE 36 is refined into CE [68,69,70,71] 
* CE 35 is refined into CE [72] 


### Cost equations --> "Loop" of f75_loop_cont/11 
* CEs [69] --> Loop 68 
* CEs [68,71] --> Loop 69 
* CEs [70] --> Loop 70 
* CEs [72] --> Loop 71 

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

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


### Specialization of cost equations f65_loop_cont/11 
* CE 31 is refined into CE [73,74,75,76,77,78] 
* CE 30 is refined into CE [79] 


### Cost equations --> "Loop" of f65_loop_cont/11 
* CEs [77,78] --> Loop 72 
* CEs [74,75,76] --> Loop 73 
* CEs [73] --> Loop 74 
* CEs [79] --> Loop 75 

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

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


### Specialization of cost equations f55_loop_cont/11 
* CE 26 is refined into CE [80,81,82,83,84,85] 
* CE 25 is refined into CE [86] 


### Cost equations --> "Loop" of f55_loop_cont/11 
* CEs [84,85] --> Loop 76 
* CEs [81,82,83] --> Loop 77 
* CEs [80] --> Loop 78 
* CEs [86] --> Loop 79 

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

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


### Specialization of cost equations f45_loop_cont/11 
* CE 21 is refined into CE [87,88,89,90,91,92] 
* CE 20 is refined into CE [93] 


### Cost equations --> "Loop" of f45_loop_cont/11 
* CEs [91,92] --> Loop 80 
* CEs [88,89,90] --> Loop 81 
* CEs [87] --> Loop 82 
* CEs [93] --> Loop 83 

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

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


### Specialization of cost equations f37_loop_cont/11 
* CE 16 is refined into CE [94,95,96,97,98,99] 
* CE 15 is refined into CE [100] 


### Cost equations --> "Loop" of f37_loop_cont/11 
* CEs [98,99] --> Loop 84 
* CEs [95,96,97] --> Loop 85 
* CEs [94] --> Loop 86 
* CEs [100] --> Loop 87 

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

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


### Specialization of cost equations f27_loop_cont/11 
* CE 11 is refined into CE [101,102,103,104,105,106] 
* CE 10 is refined into CE [107] 


### Cost equations --> "Loop" of f27_loop_cont/11 
* CEs [105,106] --> Loop 88 
* CEs [102,103,104] --> Loop 89 
* CEs [101] --> Loop 90 
* CEs [107] --> Loop 91 

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

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


### Specialization of cost equations f17_loop_cont/11 
* CE 6 is refined into CE [108,109,110,111,112,113] 
* CE 5 is refined into CE [114] 


### Cost equations --> "Loop" of f17_loop_cont/11 
* CEs [112,113] --> Loop 92 
* CEs [109,110,111] --> Loop 93 
* CEs [108] --> Loop 94 
* CEs [114] --> Loop 95 

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

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


### Specialization of cost equations f0/10 
* CE 1 is refined into CE [115,116,117,118] 


### Cost equations --> "Loop" of f0/10 
* CEs [115,116,117,118] --> Loop 96 

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

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


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

#### Cost of chains of f17(D,E,L,M,N):
* Chain [[42],44]: 1*it(42)+0
  Such that:it(42) =< -D+50

  with precondition: [L=3,49>=D,D>=0] 

* Chain [[42],43]: 1*it(42)+0
  Such that:it(42) =< -D+50

  with precondition: [L=10,M=50,N=0,49>=D,D>=0] 

* Chain [44]: 0
  with precondition: [L=3,D>=0] 


#### Cost of chains of f27(E,F,L,M,N):
* Chain [[45],47]: 1*it(45)+0
  Such that:it(45) =< -E+50

  with precondition: [L=3,49>=E] 

* Chain [[45],46]: 1*it(45)+0
  Such that:it(45) =< -E+50

  with precondition: [L=9,M=50,N=0,49>=E] 

* Chain [47]: 0
  with precondition: [L=3] 

* Chain [46]: 0
  with precondition: [L=9,N=0,E=M,E>=50] 


#### Cost of chains of f37(A,F,L,M,N):
* Chain [[48],50]: 1*it(48)+0
  Such that:it(48) =< -F+50

  with precondition: [A=0,L=3,49>=F] 

* Chain [[48],49]: 1*it(48)+0
  Such that:it(48) =< -F+50

  with precondition: [A=0,L=8,M=0,N=50,49>=F] 

* Chain [50]: 0
  with precondition: [A=0,L=3] 

* Chain [49]: 0
  with precondition: [A=0,L=8,M=0,F=N,F>=50] 


#### Cost of chains of f45(A,G,L,M,N):
* Chain [[51],53]: 1*it(51)+0
  Such that:it(51) =< -A+50

  with precondition: [L=3,49>=A] 

* Chain [[51],52]: 1*it(51)+0
  Such that:it(51) =< -A+50

  with precondition: [L=7,M=50,N=0,49>=A] 

* Chain [53]: 0
  with precondition: [L=3] 

* Chain [52]: 0
  with precondition: [L=7,N=0,A=M,A>=50] 


#### Cost of chains of f55(G,H,L,M,N):
* Chain [[54],56]: 1*it(54)+0
  Such that:it(54) =< -G+50

  with precondition: [L=3,49>=G] 

* Chain [[54],55]: 1*it(54)+0
  Such that:it(54) =< -G+50

  with precondition: [L=6,M=50,N=0,49>=G] 

* Chain [56]: 0
  with precondition: [L=3] 

* Chain [55]: 0
  with precondition: [L=6,N=0,G=M,G>=50] 


#### Cost of chains of f65(H,I,L,M,N):
* Chain [[57],59]: 1*it(57)+0
  Such that:it(57) =< -H+50

  with precondition: [L=3,49>=H] 

* Chain [[57],58]: 1*it(57)+0
  Such that:it(57) =< -H+50

  with precondition: [L=5,M=50,N=0,49>=H] 

* Chain [59]: 0
  with precondition: [L=3] 

* Chain [58]: 0
  with precondition: [L=5,N=0,H=M,H>=50] 


#### Cost of chains of f75(A,I,L,M,N):
* Chain [[60],62]: 1*it(60)+0
  Such that:it(60) =< -I+50

  with precondition: [L=3,49>=I] 

* Chain [[60],61]: 1*it(60)+0
  Such that:it(60) =< -I+50

  with precondition: [L=4,M=0,N=50,49>=I] 

* Chain [62]: 0
  with precondition: [L=3] 

* Chain [61]: 0
  with precondition: [L=4,M=0,I=N,I>=50] 


#### Cost of chains of f83(A,L,M):
* Chain [[63],65]: 1*it(63)+0
  Such that:it(63) =< -A+50

  with precondition: [L=2,M=50,49>=A] 

* Chain [[63],64]: 1*it(63)+0
  Such that:it(63) =< -A+50

  with precondition: [L=3,49>=A] 

* Chain [65]: 0
  with precondition: [L=2,A=M,A>=50] 

* Chain [64]: 0
  with precondition: [L=3] 


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

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


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

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

* Chain [69]: 2*s(1)+0
  Such that:aux(1) =< -B+50
s(1) =< aux(1)

  with precondition: [A=4,49>=B] 

* Chain [68]: 0
  with precondition: [A=4,B>=50] 


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

* Chain [74]: 0
  with precondition: [A=5] 

* Chain [73]: 3*s(3)+2*s(7)+0
  Such that:s(6) =< 50
aux(2) =< -J+50
s(3) =< aux(2)
s(7) =< s(6)

  with precondition: [A=5,49>=J] 

* Chain [72]: 100
  with precondition: [A=5,J>=50] 


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

* Chain [78]: 0
  with precondition: [A=6] 

* Chain [77]: 3*s(10)+5*s(15)+0
  Such that:aux(3) =< 50
aux(4) =< -I+50
s(10) =< aux(4)
s(15) =< aux(3)

  with precondition: [A=6,49>=I] 

* Chain [76]: 250
  with precondition: [A=6,I>=50] 


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

* Chain [82]: 0
  with precondition: [A=7] 

* Chain [81]: 3*s(21)+8*s(26)+0
  Such that:aux(6) =< 50
aux(7) =< -H+50
s(21) =< aux(7)
s(26) =< aux(6)

  with precondition: [A=7,49>=H] 

* Chain [80]: 400
  with precondition: [A=7,H>=50] 


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

* Chain [86]: 0
  with precondition: [A=8] 

* Chain [85]: 3*s(32)+11*s(37)+0
  Such that:aux(9) =< 50
aux(10) =< -B+50
s(32) =< aux(10)
s(37) =< aux(9)

  with precondition: [A=8,49>=B] 

* Chain [84]: 550
  with precondition: [A=8,B>=50] 


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

* Chain [90]: 0
  with precondition: [A=9,B=0] 

* Chain [89]: 3*s(43)+14*s(48)+0
  Such that:aux(12) =< 50
aux(13) =< -G+50
s(43) =< aux(13)
s(48) =< aux(12)

  with precondition: [A=9,B=0,49>=G] 

* Chain [88]: 700
  with precondition: [A=9,B=0,G>=50] 


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

* Chain [94]: 0
  with precondition: [A=10,B=0] 

* Chain [93]: 3*s(54)+17*s(59)+0
  Such that:aux(15) =< 50
aux(16) =< -F+50
s(54) =< aux(16)
s(59) =< aux(15)

  with precondition: [A=10,B=0,49>=F] 

* Chain [92]: 850
  with precondition: [A=10,B=0,F>=50] 


#### Cost of chains of f0(A,B,C,D,E,F,G,H,I,L):
* Chain [96]: 1150
  with precondition: [] 


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

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