WARNING: Excluded non-linear constraints:[F=2*(A*A)+2*A,G= -A* -A+2*B]
WARNING: Excluded non-linear constraints:[F=2*(A*A)+2*A,G= -A* -A+2*B]

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

#### Computed strongly connected components 
0. recursive  : [l1/5]
1. non_recursive  : [exit_location/1]
2. non_recursive  : [l1_loop_cont/2]
3. non_recursive  : [l0/5]

#### Obtained direct recursion through partial evaluation 
0. SCC is partially evaluated into l1/5
1. SCC is completely evaluated into other SCCs
2. SCC is completely evaluated into other SCCs
3. SCC is partially evaluated into l0/5

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

### Specialization of cost equations l1/5 
* CE 4 is refined into CE [5] 
* CE 2 is refined into CE [6] 
* CE 3 is refined into CE [7] 


### Cost equations --> "Loop" of l1/5 
* CEs [6] --> Loop 5 
* CEs [7] --> Loop 6 
* CEs [5] --> Loop 7 

### Ranking functions of CR l1(Y1,Y2,X2,X3,Y3) 

#### Partial ranking functions of CR l1(Y1,Y2,X2,X3,Y3) 


### Specialization of cost equations l0/5 
* CE 1 is refined into CE [8,9,10] 


### Cost equations --> "Loop" of l0/5 
* CEs [10] --> Loop 8 
* CEs [9] --> Loop 9 
* CEs [8] --> Loop 10 

### Ranking functions of CR l0(Y1,Y2,X2,X3,Y3) 

#### Partial ranking functions of CR l0(Y1,Y2,X2,X3,Y3) 


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

#### Cost of chains of l1(Y1,Y2,X2,X3,Y3):
* Chain [[5,6]]...: 2*it(5)+0
  with precondition: [X3>=1,Y3=2] 

* Chain [[5,6],7]: 2*it(5)+0
  with precondition: [Y3=2,X3>=1] 

* Chain [7]: 0
  with precondition: [Y3=2] 


#### Cost of chains of l0(Y1,Y2,X2,X3,Y3):
* Chain [10]: 0
  with precondition: [] 

* Chain [9]: 2*s(1)+0
  with precondition: [X3>=1] 

* Chain [8]...: 2*s(2)+0
  with precondition: [X3>=1] 


Closed-form bounds of l0(Y1,Y2,X2,X3,Y3): 
-------------------------------------
* Chain [10] with precondition: [] 
    - Upper bound: 0 
    - Complexity: constant 
* Chain [9] with precondition: [X3>=1] 
    - Upper bound: inf 
    - Complexity: infinity 
* Chain [8]... with precondition: [X3>=1] 
    - Upper bound: inf 
    - Complexity: infinity 

### Maximum cost of l0(Y1,Y2,X2,X3,Y3): inf 
Asymptotic class: infinity 
* Total analysis performed in 23 ms.

