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


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


WORST_CASE(?,O(1))  

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

#### Computed strongly connected components 
0. recursive  : [lbl13/15,lbl53/15,lbl91/15]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [stop/15]
3. non_recursive  : [lbl53_loop_cont/16]
4. non_recursive  : [start/15]
5. non_recursive  : [start0/15]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into lbl53/15
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into lbl53_loop_cont/16
4. SCC is partially evaluated into start/15
5. SCC is partially evaluated into start0/15

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

### Specialization of cost equations lbl53/15 
* CE 10 is refined into CE [13] 
* CE 7 is refined into CE [14] 
* CE 6 is discarded (unfeasible) 
* CE 5 is discarded (unfeasible) 
* CE 9 is refined into CE [15] 
* CE 8 is refined into CE [16] 


### Cost equations --> "Loop" of lbl53/15 
* CEs [16] --> Loop 12 
* CEs [15] --> Loop 13 
* CEs [13] --> Loop 14 
* CEs [14] --> Loop 15 

### Ranking functions of CR lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V) 

#### Partial ranking functions of CR lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V) 


### Specialization of cost equations lbl53_loop_cont/16 
* CE 12 is refined into CE [17] 
* CE 11 is refined into CE [18] 


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

### Ranking functions of CR lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 

#### Partial ranking functions of CR lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P) 


### Specialization of cost equations start/15 
* CE 3 is refined into CE [19,20,21] 
* CE 4 is refined into CE [22,23,24] 
* CE 2 is refined into CE [25] 


### Cost equations --> "Loop" of start/15 
* CEs [20,23] --> Loop 18 
* CEs [21,24] --> Loop 19 
* CEs [25] --> Loop 20 
* CEs [19,22] --> Loop 21 

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

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


### Specialization of cost equations start0/15 
* CE 1 is refined into CE [26,27,28,29] 


### Cost equations --> "Loop" of start0/15 
* CEs [29] --> Loop 22 
* CEs [28] --> Loop 23 
* CEs [27] --> Loop 24 
* CEs [26] --> Loop 25 

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

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


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

#### Cost of chains of lbl53(A,B,D,F,H,J,L,N,P,Q,R,S,T,U,V):
* Chain [15]: 0
  with precondition: [A=2,D=1,J=2,L=0,N=2,P=2,Q=0,R=1,U=2,V=1,H=T,1>=H,H>=0] 

* Chain [14]: 0
  with precondition: [L=0,P=3,N=A,D+1=J,2>=D,D>=1,H>=0,N>=D+1,D>=H] 

* Chain [13,14]: 1
  with precondition: [D=1,J=2,L=0,P=3,A=N,1>=H,A>=3,H>=0] 

* Chain [12,14]: 1
  with precondition: [D=1,J=2,L=0,P=3,A=N,1>=H,A>=3,H>=0] 


#### Cost of chains of lbl53_loop_cont(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P):
* Chain [17]: 0
  with precondition: [A=2,O=B,O>=2] 

* Chain [16]: 0
  with precondition: [A=3,O=B,O>=2] 


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

* Chain [20]: 0
  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,1>=N] 

* Chain [19]: 0
  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,N>=2] 

* Chain [18]: 1
  with precondition: [N=A,C=B,E=D,G=F,I=H,K=J,M=L,N>=3] 


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

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

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

* Chain [22]: 1
  with precondition: [A>=3] 


Closed-form bounds of start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P): 
-------------------------------------
* Chain [25] with precondition: [A=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [24] with precondition: [1>=A] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [23] with precondition: [A>=2] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [22] with precondition: [A>=3] 
    - Upper bound: 1 
    - Complexity: constant 

### Maximum cost of start0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,P): 1 
Asymptotic class: constant 
* Total analysis performed in 387 ms.