
 OPTIM version 22983, Copyright (C) David J. Wales
 OPTIM comes with ABSOLUTELY NO WARRANTY; for details supply WARRANTY as an input keyword.
 This is free software, and you are welcome to redistribute it
 under certain conditions; provide keyword COPYRIGHT to see the details.

 getparams> Number of atoms (or variables)  determined as    145
 keyword> Local permutational alignment: alignment threshold=        1.00000
 keyword> Local permutational alignment: alignment cutoff=           5.00000
 keyword> Number of groups of permutable atoms=     6
CHARMMTYPE set to  2
1
                 Chemistry at HARvard Macromolecular Mechanics
                   (CHARMM) - Developmental Version 35b4   February 15, 2010   
       Copyright(c) 1984-2001  President and Fellows of Harvard College
                              All Rights Reserved
      Current operating system: Linux-2.6.16.54-0.2.5-smp(x86_64)@comp29.ch.
                 Created on  5/28/12 at 13: 2:20 by user: wales       

            Maximum number of ATOMS:     25140, and RESidues:       14000
            Current HEAP size:         2048000, and STACK size:    500000

 RDTITL> * INPUT FILE FOR TRYPZIP 1LE1
 RDTITL> *
  
 CHARMM>    BOMLev -2
 Parameter: TOP <- "toph19_eef1_bs360.inp"
 Parameter: PAR <- "param19_eef1_bs360.inp"
  
 CHARMM>    WRNLEV -1
  
 CHARMM>    PRNLEV 1
 NBOND          152
 NTHETA          223
 NPHI           88

chsetdihe> number of internal coordinates for segment    1
 chsetdihe> NPHIPSI           24
 chsetdihe> NOMEGAC           11
 chsetdihe> NSIDECHAIN           27
 chsetdihe> NCHIRAL           13

chsetdihe> total number of internal coordinates
 chsetdihe> NPHIPSITOT=            24
 chsetdihe> NOMEGACTOT=            11
 chsetdihe> NSIDECHAINTOT=            27
 chsetdihe> NCHIRALTOT=            13

 chsetdihe>            51  twistable dihedrals identified
chsetdihe> SEG-NR, NSEGATOMS :    1     145

 fetchz> Hybrid EF/BFGS transition state search, maximum steps= 250
         maximum tangent space steps=   5 or  100 when overlap is better than     0.999900
 fetchz> Uphill mode is    0 for initial step and    0 after that
 fetchz> Steps for largest Hessian e/vector= 100, smallest e/vector=2000 convergence at       0.0020%

 fetchz>  435 Cartesian coordinates will be optimised for  145 CHARMM atoms

 fetchz> Lowest   1 eigenvalues and eigenvectors will be calculated non-iteratively
 fetchz> Point group checked when RMS force <     0.00100000, highest symmetry axis tested for=  6
 fetchz> Initial distance and eigenvalue tolerances in symmetry determination=     0.00010000     0.00010000
 fetchz> Minimum number of optimization steps=     0
 keywords> Cutoff for identifying atoms in the same orbit=    0.2000000000    
 keywords> lpermdist neighbours, threshold, max sep=    10     1.000000000         3
 fetchz> Convergence criterion for LBFGS optimization: RMS force< 0.10000000E-05 maximum steps= 10000
 fetchz> Maximum energy rise in LBFGS minimization=    0.1000000000E-01
 fetchz> Number of updates in LBFGS=    10000
 fetchz> Number of updates in XLBFGS=   4
 fetchz> Number of updates in mind=   4
 fetchz> Initial guess for diagonal elements in LBFGS=     0.0100
 fetchz> Initial guess for diagonal elements in XLBFGS=    0.1000
 fetchz> Maximum step size in LBFGS energy minimization=     0.1000
 fetchz> Maximum step size in XLBFGS=    0.2000
 fetchz> Maximum step size in LBFGS neb image minimization=                 0.2000
 fetchz> Warnings will be issued if atoms become closer than 0.5 units
 fetchz> Coordinates for intermediate steps will not be dumped to file points


 OPTIM> Using translational/rotational ev shift=     1000000.000    
 OPTIM> Initial energy=    -381.3469114     RMS force=    0.9354232431E-06
 OPTIM> Final energy  =    -385.2780020     RMS force=    0.9419005855E-06
 KeyConnect> Maximum cycles = 50, maximum images = 23
 KeyConnect> Maximum attempts per pair of minima = 3, with increment image density of 2.00
 KeyConnect> Image density = 0.30, iteration density = 35.00
 KeyNEB> Initial and final NEB force constants     10.00000000        10.00000000     factor=    1.010000000    
 KeyNEB> Number of images will vary depending on the separation of the endpoints
 KeyGrad> Overall rotation and translation will NOT be removed
 KeyGrad> Using doubly nudged elastic band gradient
 KeyOutput> Transition state candidates will be optimized
 KeyOutput> Concise printing during transition states optimization
 KeyOutput> Transition state candidates are maxima along NEB
 KeyMin> Maximal number of iterations will vary, depending on the number of images in the band
 KeyMin> RMS convergence criterion is set to 0.001
 KeyMin> L-BFGS minimization
 KeyLBFGS> Maximum step size per image =     0.2000000000    
 KeyLBFGS> 4 Hessian updates per iteration
 KeyLBFGS> Guess for inverse Hessian diagonal elements =     0.1000000000E-02
 KeyTau> Using Henkelman and Jonsson's improved tangent
 KeyDecide> Cost function in Dijkstra algorithm is D^3

 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 1 >>>>>>>>>>>>>>>>>>>>> 2 minima and 0 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      1 steps with      1 missing connections, weight=    0.31828E+06
 decide> The unconnected minima in the chain and their distances are:
     2       68.28     1 
 

 tryconnect> 700-iteration DNEB run for minima 1_S and 2_F using 20 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.2981058282    
 Double-ended search iterations= 700 RMS= 0.0428 Dev= 4.60% S= 77.66 time= 17.15
 Following    1 images are candidates for TS:    7  
 Converged to TS (number of iterations):        122
 DNEB run yielded 1 true transition state(s) time=   9.37

 >>>>>  Path run for ts 1 ...
 Plus  side of path:                    1292 steps. Energy=    -385.2780020       time=       7.59
 Minus side of path:                    1449 steps. Energy=    -385.7374199       time=       8.03

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.2780020  5.7031         -379.5748628  6.1626         -385.7374199  64.460  50.077   2.060  70.378
        Known (#2)                                              *NEW* (Placed in 3)
 Unconnected minimum 3 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 2 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=    0.18509E+06
 decide> The unconnected minima in the chain and their distances are:
     3       56.99     1 
 

 tryconnect> 595-iteration DNEB run for minima 1_S and 3_F using 17 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      1.009492144    
 Double-ended search iterations= 595 RMS= 0.1474 Dev= 6.08% S= 65.99 time= 12.44
 Following    1 images are candidates for TS:    7  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  26.21
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 3 >>>>>>>>>>>>>>>>>>>>> 3 minima and 1 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      2 steps with      1 missing connections, weight=    0.37017E+06
 decide> The unconnected minima in the chain and their distances are:
     3       56.99     1 
 

 tryconnect> 805-iteration DNEB run for minima 1_S and 3_F using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant     0.6197406068    
 Double-ended search iterations= 805 RMS= 0.5429 Dev= 4.64% S= 67.61 time= 22.29
 Following    2 images are candidates for TS:    8   11  
 Converged to TS (number of iterations):         83
 Converged to TS (number of iterations):        141
 DNEB run yielded 2 true transition state(s) time=  22.20

 >>>>>  Path run for ts 2 ...
 Plus  side of path:                    1873 steps. Energy=    -387.1475166       time=      11.64
 Minus side of path:                    1091 steps. Energy=    -381.2517349       time=       2.67

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -387.1475166  7.2685         -379.8790336  1.3727         -381.2517349  65.316  57.389   1.922  75.429
        *NEW* (Placed in 4)                                     *NEW* (Placed in 5)
 Connection established between members of the U set.

 >>>>>  Path run for ts 3 ...
 Plus  side of path:                    1341 steps. Energy=    -385.7374199       time=       4.76
 Minus side of path:                     950 steps. Energy=    -383.5184080       time=       3.01

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.7374199  2.2266         -383.5108454 0.75626E-02     -383.5184080  33.483  32.501   3.150  46.036
        Known (#3)                                              *NEW* (Placed in 6)
 Unconnected minimum 6 found its way to F set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 4 >>>>>>>>>>>>>>>>>>>>> 6 minima and 3 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     21675.    
 decide> The unconnected minima in the chain and their distances are:
     3       27.88     4     5        1.48     1 
 

 tryconnect> 280-iteration DNEB run for minima 3_F and 4_U using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.1992 Dev= 3.07% S= 33.30 time= 3.00
 Following    1 images are candidates for TS:    5  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  18.90

 tryconnect> 70-iteration DNEB run for minima 1_S and 5_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      8.227024748    
 Double-ended search iterations= 70 RMS= 0.0367 Dev= 0.36% S= 1.48 time= 0.16
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         11
 DNEB run yielded 1 true transition state(s) time=   3.10

 >>>>>  Path run for ts 4 ...
 Plus  side of path:                     976 steps. Energy=    -381.3469114       time=       2.88
 Minus side of path:                     989 steps. Energy=    -381.2517349       time=       2.53

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3469114 0.11264         -381.2342755 0.17459E-01     -381.2517349   1.482   1.478   3.095  46.848
        Known (#1)                                              Known (#5)
 Unconnected minimum 5 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 5 >>>>>>>>>>>>>>>>>>>>> 6 minima and 4 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      1 missing connections, weight=     34062.    
 decide> The unconnected minima in the chain and their distances are:
     6       32.42     5 
 

 tryconnect> 315-iteration DNEB run for minima 5_S and 6_F using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.4624599827    
 Double-ended search iterations= 315 RMS= 0.1906 Dev= 1.44% S= 36.80 time= 3.29
 Following    1 images are candidates for TS:    4  
 Converged to TS (number of iterations):        197
 DNEB run yielded 1 true transition state(s) time=  17.70

 >>>>>  Path run for ts 5 ...
 Plus  side of path:                    1067 steps. Energy=    -381.3066617       time=       2.64
 Minus side of path:                    1026 steps. Energy=    -383.9053790       time=       2.38

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3066617 0.56742         -380.7392418  3.1661         -383.9053790  30.705  26.248   1.749  82.910
        *NEW* (Placed in 7)                                     *NEW* (Placed in 8)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 6 >>>>>>>>>>>>>>>>>>>>> 8 minima and 5 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     19530.    
 decide> The unconnected minima in the chain and their distances are:
     6       26.90     8     7        4.15     5 
 

 tryconnect> 280-iteration DNEB run for minima 6_F and 8_U using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.0841 Dev= 1.72% S= 30.60 time= 2.67
 Following    1 images are candidates for TS:    5  
 Failed to converge to TS (number of iterations):        251
 DNEB run yielded 0 true transition state(s) time=  22.39

 tryconnect> 70-iteration DNEB run for minima 5_S and 7_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0261 Dev= 0.57% S= 4.15 time= 0.16
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         15
 DNEB run yielded 1 true transition state(s) time=   3.67
 isnewts> transition state is the same as number        4 energy=     -381.2342755155
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 6 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1000 steps. Energy=    -381.3469114       time=       3.03
 Minus side of path:                     996 steps. Energy=    -381.2517349       time=       3.00

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3469114 0.11264         -381.2342755 0.17459E-01     -381.2517349   1.482   1.478   3.095  46.847
        Known (#1)                                              Known (#5)
 Alternative path found between members of the S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 7 >>>>>>>>>>>>>>>>>>>>> 8 minima and 6 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      4 steps with      2 missing connections, weight=     31689.    
 decide> The unconnected minima in the chain and their distances are:
     6       31.60     7     7        4.94     1 
 

 tryconnect> 315-iteration DNEB run for minima 6_F and 7_U using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.4624599827    
 Double-ended search iterations= 315 RMS= 0.0965 Dev= 2.58% S= 36.14 time= 3.37
 Following    1 images are candidates for TS:    6  
 Converged to TS (number of iterations):        108
 DNEB run yielded 1 true transition state(s) time=  10.61

 >>>>>  Path run for ts 7 ...
 Plus  side of path:                    1060 steps. Energy=    -381.3066617       time=       2.61
 Minus side of path:                    1028 steps. Energy=    -380.3239361       time=       2.38

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3066617  1.0296         -380.2770198 0.46916E-01     -380.3239361  21.921  20.914   1.898  76.400
        Known (#7)                                              *NEW* (Placed in 9)
 Connection established between members of the U set.

 tryconnect> 70-iteration DNEB run for minima 1_S and 7_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0125 Dev= 0.01% S= 4.95 time= 0.16
 Following    1 images are candidates for TS:    2  
 Converged to TS (number of iterations):         19
 DNEB run yielded 1 true transition state(s) time=   3.23

 >>>>>  Path run for ts 8 ...
 Plus  side of path:                     995 steps. Energy=    -381.3469114       time=       2.43
 Minus side of path:                     968 steps. Energy=    -381.3066617       time=       2.15

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3469114 0.40357E-01     -381.3065543 0.10733E-03     -381.3066617   4.961   4.945   2.063  70.290
        Known (#1)                                              Known (#7)
 Unconnected minimum 7 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 8 >>>>>>>>>>>>>>>>>>>>> 9 minima and 8 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     13308.    
 decide> The unconnected minima in the chain and their distances are:
     6       23.70     9 
 

 tryconnect> 245-iteration DNEB run for minima 6_F and 9_S using 7 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.9156391332    
 Double-ended search iterations= 245 RMS= 0.0941 Dev= 1.09% S= 26.33 time= 1.98
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):         80
 DNEB run yielded 1 true transition state(s) time=   6.73
 isnewts> transition state is the same as number        7 energy=     -380.2770198441
 tryconnect> Try the path again for ts      1 with pushoff=    0.1000000000E-01

 >>>>>  Path run for ts 9 ...
 tryconnect> Trying this transition state path again with pushoff=    0.1000000000E-01
 Plus  side of path:                    1049 steps. Energy=    -381.3066617       time=       2.83
 Minus side of path:                    1021 steps. Energy=    -380.3239361       time=       2.82

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -381.3066617  1.0296         -380.2770198 0.46916E-01     -380.3239361  21.920  20.913   1.894  76.547
        Known (#7)                                              Known (#9)
 Alternative path found between members of the S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 9 >>>>>>>>>>>>>>>>>>>>> 9 minima and 9 ts are known >>>>>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     26616.    
 decide> The unconnected minima in the chain and their distances are:
     6       23.70     9 
 

 tryconnect> 805-iteration DNEB run for minima 6_F and 9_S using 23 images  (DNEB attempt #2)  ...
 lbfgs> Final DNEB force constant      2.953027717    
 Double-ended search iterations= 805 RMS= 0.6963 Dev= 4.35% S= 28.47 time= 22.01
 Following    1 images are candidates for TS:   15  
 Converged to TS (number of iterations):         53
 DNEB run yielded 1 true transition state(s) time=   5.95

 >>>>>  Path run for ts 10 ...
 Plus  side of path:                    1037 steps. Energy=    -380.3666465       time=       2.43
 Minus side of path:                    2178 steps. Energy=    -389.5240203       time=      12.47

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.3666465  7.1358         -373.2308308  16.293         -389.5240203  74.711  70.123   1.515  95.683
        *NEW* (Placed in 10)                                    *NEW* (Placed in 11)
 Connection established between members of the U set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 10 >>>>>>>>>>>>>>>>>>>>> 11 minima and 10 ts are known >>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      6 steps with      2 missing connections, weight=     21849.    
 decide> The unconnected minima in the chain and their distances are:
     6       27.85    10    10        6.34     9 
 

 tryconnect> 280-iteration DNEB run for minima 6_F and 10_U using 8 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.6507276371    
 Double-ended search iterations= 280 RMS= 0.1716 Dev= 3.03% S= 31.39 time= 2.57
 Following    1 images are candidates for TS:    5  
 Converged to TS (number of iterations):        181
 DNEB run yielded 1 true transition state(s) time=  13.62

 >>>>>  Path run for ts 11 ...
 Plus  side of path:                    1417 steps. Energy=    -385.7374199       time=       6.98
 Minus side of path:                    1248 steps. Energy=    -385.2780020       time=       5.59

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -385.7374199  6.1468         -379.5906153  5.6874         -385.2780020  67.213  50.469   2.029  71.478
        Known (#3)                                              Known (#2)
 Alternative path found between members of the F set.

 tryconnect> 70-iteration DNEB run for minima 9_S and 10_U using 2 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant      5.050679530    
 Double-ended search iterations= 70 RMS= 0.0159 Dev= 0.01% S= 6.34 time= 0.17
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         19
 DNEB run yielded 1 true transition state(s) time=   4.47

 >>>>>  Path run for ts 12 ...
 Plus  side of path:                     941 steps. Energy=    -380.3239361       time=       2.75
 Minus side of path:                    1021 steps. Energy=    -380.3666465       time=       2.29

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -380.3239361 0.70010E-03     -380.3232360 0.43410E-01     -380.3666465   6.370   6.341   2.065  70.227
        Known (#9)                                              Known (#10)
 Unconnected minimum 10 found its way to S set.
 >>>>>>>>>>>>>>>>>>>>> CONNECT CYCLE 11 >>>>>>>>>>>>>>>>>>>>> 11 minima and 12 ts are known >>>>>>>>>>>>>>>>>
 decide> Shortest path in Dijkstra has      5 steps with      1 missing connections, weight=     32451.    
 decide> The unconnected minima in the chain and their distances are:
     2       31.90    11 
 

 tryconnect> 315-iteration DNEB run for minima 2_F and 11_S using 9 images  (DNEB attempt #1)  ...
 lbfgs> Final DNEB force constant     0.4624599827    
 Double-ended search iterations= 315 RMS= 0.0613 Dev= 1.48% S= 34.35 time= 3.74
 Following    1 images are candidates for TS:    1  
 Converged to TS (number of iterations):         26
 DNEB run yielded 1 true transition state(s) time=   3.87

 >>>>>  Path run for ts 13 ...
 Plus  side of path:                    1420 steps. Energy=    -389.5240203       time=       5.78
 Minus side of path:                     936 steps. Energy=    -385.2780020       time=       3.23

         E+        Ets - E+           Ets       Ets - E-           E-          S       D      gamma   ~N
     -389.5240203  4.4022         -385.1218190 0.15618         -385.2780020  33.712  31.908   1.811  80.069
        Known (#11)                                             Known (#2)
 Connected path found
  ts        E+         Ets - E+          Ets       Ets - E-          E-          S       D      gamma   ~N
   8     -381.3469114 0.40357E-01    -381.3065543 0.10733E-03    -381.3066617   4.961   4.945   2.063  70.290
   7     -381.3066617  1.0296        -380.2770198 0.46916E-01    -380.3239361  21.921  20.914   1.898  76.400
  12     -380.3239361 0.70010E-03    -380.3232360 0.43410E-01    -380.3666465   6.370   6.341   2.065  70.227
  10     -380.3666465  7.1358        -373.2308308  16.293        -389.5240203  74.711  70.123   1.515  95.683
  13     -389.5240203  4.4022        -385.1218190 0.15618        -385.2780020  33.712  31.908   1.811  80.069

 Number of TS in the path       =      5
 Number of cycles               =     11

 Elapsed time=                               378.44
 OPTIM> # of energy calls=                          0 time=           0.00 %=  0.0
 OPTIM> # of energy+gradient calls=            130110 time=         150.94 %= 39.9
 OPTIM> # of energy+gradient+Hessian calls=      1805 time=           8.32 %=  2.2
