crypto/engine/tb_eckey.c:74: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `engine_table_cleanup`.
Showing all 8 steps of the trace


crypto/engine/tb_eckey.c:74:5: Call
72.   static void engine_unregister_all_EC(void)
73.   {
74.       engine_table_cleanup(&dh_table);
          ^
75.   }
76.   

crypto/engine/eng_table.c:229:1: Parameter `(*table)->piles.num_nodes`
  227.   static IMPLEMENT_LHASH_DOALL_FN(int_cleanup_cb, ENGINE_PILE)
  228.   
  229. > void engine_table_cleanup(ENGINE_TABLE **table)
  230.   {
  231.       CRYPTO_w_lock(CRYPTO_LOCK_ENGINE);

crypto/engine/eng_table.c:233:9: Call
  231.       CRYPTO_w_lock(CRYPTO_LOCK_ENGINE);
  232.       if (*table) {
  233.           lh_ENGINE_PILE_doall(&(*table)->piles,
                 ^
  234.                                LHASH_DOALL_FN(int_cleanup_cb));
  235.           lh_ENGINE_PILE_free(&(*table)->piles);

crypto/lhash/lhash.c:269:1: Parameter `lh->num_nodes`
    267.   }
    268.   
    269. > void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func)
    270.   {
    271.       doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);

crypto/lhash/lhash.c:271:5: Call
    269.   void lh_doall(_LHASH *lh, LHASH_DOALL_FN_TYPE func)
    270.   {
    271.       doall_util_fn(lh, 0, func, (LHASH_DOALL_ARG_FN_TYPE)0, NULL);
               ^
    272.   }
    273.   

crypto/lhash/lhash.c:236:1: <LHS trace>
234.   }
235.   
236. > static void doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
237.                             LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
238.   {

crypto/lhash/lhash.c:236:1: Parameter `lh->num_nodes`
      234.   }
      235.   
      236. > static void doall_util_fn(_LHASH *lh, int use_arg, LHASH_DOALL_FN_TYPE func,
      237.                             LHASH_DOALL_ARG_FN_TYPE func_arg, void *arg)
      238.   {

crypto/lhash/lhash.c:249:10: Binary operation: ([0, +oo] - 1):unsigned32 by call to `engine_table_cleanup` 
      247.        * memory leaks otherwise
      248.        */
      249.       for (i = lh->num_nodes - 1; i >= 0; i--) {
                      ^
      250.           a = lh->b[i];
      251.           while (a != NULL) {
