test/bntest.c:605: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_div_recp`.
Showing all 12 steps of the trace


test/bntest.c:604:9: Call
602.           a->neg = rand_neg();
603.           b->neg = rand_neg();
604.           BN_RECP_CTX_set(recp, b, ctx);
               ^
605.           BN_div_recp(d, c, a, recp, ctx);
606.           if (bp != NULL) {

crypto/bn/bn_recp.c:93:1: Parameter `*recp->Nr.d`
  91.   }
  92.   
  93. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  94.   {
  95.       if (!BN_copy(&(recp->N), d))

test/bntest.c:605:9: Call
603.           b->neg = rand_neg();
604.           BN_RECP_CTX_set(recp, b, ctx);
605.           BN_div_recp(d, c, a, recp, ctx);
               ^
606.           if (bp != NULL) {
607.               if (!results) {

crypto/bn/bn_recp.c:132:1: Parameter `*recp->Nr.d`
  130.   }
  131.   
  132. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
  133.                   BN_RECP_CTX *recp, BN_CTX *ctx)
  134.   {

crypto/bn/bn_recp.c:188:10: Call
  186.       if (!BN_rshift(a, m, recp->num_bits))
  187.           goto err;
  188.       if (!BN_mul(b, a, &(recp->Nr), ctx))
                  ^
  189.           goto err;
  190.       if (!BN_rshift(d, b, i - recp->num_bits))

crypto/bn/bn_mul.c:883:1: Parameter `*b->d`
    881.   #endif                          /* BN_RECURSION */
    882.   
    883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    884.   {
    885.       int ret = 0;

crypto/bn/bn_mul.c:964:17: Call
    962.                   if (bn_wexpand(rr, k * 4) == NULL)
    963.                       goto err;
    964.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    965.                                         j, al - j, bl - j, t->d);
    966.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:534:1: Parameter `*b`
      532.    */
      533.   /* tnX may not be negative but less than n */
      534. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      535.                              int tna, int tnb, BN_ULONG *t)
      536.   {

crypto/bn/bn_mul.c:542:9: Call
      540.   
      541.       if (n < 8) {
      542.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      543.           return;
      544.       }

crypto/bn/bn_mul.c:1037:1: <Length trace>
1035.   }
1036.   
1037. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1038.   {
1039.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1037:1: Parameter `*b`
        1035.   }
        1036.   
        1037. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        1038.   {
        1039.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1072:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_div_recp` 
        1070.           if (--nb <= 0)
        1071.               return;
        1072.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1073.           rr += 4;
        1074.           r += 4;
