crypto/err/err.c:550: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `lh_delete`.
Showing all 9 steps of the trace


crypto/err/err.c:545:12: Call
543.   
544.       CRYPTO_w_lock(CRYPTO_LOCK_ERR);
545.       hash = get_hash(0, 0);
                  ^
546.       if (hash) {
547.           for (; str->error; str++) {

crypto/err/err.c:279:26: Call
  277.           CRYPTO_w_lock(CRYPTO_LOCK_ERR);
  278.       if (!int_error_hash && create) {
  279.           int_error_hash = lh_ERR_STRING_DATA_new();
                                  ^
  280.       }
  281.       if (int_error_hash != NULL)

crypto/lhash/lhash.c:125:5: Assignment
    123.       ret->num_nodes = MIN_NODES / 2;
    124.       ret->num_alloc_nodes = MIN_NODES;
    125.       ret->pmax = MIN_NODES / 2;
               ^
    126.       ret->up_load = UP_LOAD;
    127.       ret->down_load = DOWN_LOAD;

crypto/err/err.c:550:19: Call
548.               if (lib)
549.                   str->error |= ERR_PACK(lib, 0, 0);
550.               (void)lh_ERR_STRING_DATA_delete(hash, str);
                         ^
551.           }
552.       }

crypto/lhash/lhash.c:189:1: Parameter `lh->pmax`
  187.   }
  188.   
  189. > void *lh_delete(_LHASH *lh, const void *data)
  190.   {
  191.       unsigned long hash;

crypto/lhash/lhash.c:212:9: Call
  210.       if ((lh->num_nodes > MIN_NODES) &&
  211.           (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
  212.           contract(lh);
                 ^
  213.   
  214.       return (ret);

crypto/lhash/lhash.c:323:1: <LHS trace>
321.   }
322.   
323. > static void contract(_LHASH *lh)
324.   {
325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:323:1: Parameter `lh->p`
    321.   }
    322.   
    323. > static void contract(_LHASH *lh)
    324.   {
    325.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:327:10: Binary operation: ([0, +oo] - 1):unsigned32 by call to `lh_delete` 
    325.       LHASH_NODE **n, *n1, *np;
    326.   
    327.       np = lh->b[lh->p + lh->pmax - 1];
                    ^
    328.       lh->b[lh->p + lh->pmax - 1] = NULL; /* 24/07-92 - eay - weird but :-( */
    329.       if (lh->p == 0) {
