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


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

crypto/err/err.c:279:26: Call
  277.       if (!int_error_hash && create) {
  278.           CRYPTO_push_info("get_hash (err.c)");
  279.           int_error_hash = lh_ERR_STRING_DATA_new();
                                  ^
  280.           CRYPTO_pop_info();
  281.       }

crypto/lhash/lhash.c:128:5: Assignment
    126.       ret->num_nodes = MIN_NODES / 2;
    127.       ret->num_alloc_nodes = MIN_NODES;
    128.       ret->p = 0;
               ^
    129.       ret->pmax = MIN_NODES / 2;
    130.       ret->up_load = UP_LOAD;

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

crypto/lhash/lhash.c:209:1: Parameter `lh->pmax`
  207.   }
  208.   
  209. > void *lh_delete(_LHASH *lh, const void *data)
  210.   {
  211.       unsigned long hash;

crypto/lhash/lhash.c:232:9: Call
  230.       if ((lh->num_nodes > MIN_NODES) &&
  231.           (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
  232.           contract(lh);
                 ^
  233.   
  234.       return (ret);

crypto/lhash/lhash.c:343:1: <LHS trace>
341.   }
342.   
343. > static void contract(_LHASH *lh)
344.   {
345.       LHASH_NODE **n, *n1, *np;

crypto/lhash/lhash.c:343:1: Parameter `lh->p`
    341.   }
    342.   
    343. > static void contract(_LHASH *lh)
    344.   {
    345.       LHASH_NODE **n, *n1, *np;

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