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


test/bntest.c:243:9: Call
241.           a->neg = rand_neg();
242.           b->neg = rand_neg();
243.           BN_RECP_CTX_set(recp, b, ctx);
               ^
244.           BN_div_recp(d, c, a, recp, ctx);
245.           BN_mul(e, d, b, ctx);

crypto/bn/bn_recp.c:44:1: Parameter `*recp->N.d`
  42.   }
  43.   
  44. > int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))

crypto/bn/bn_recp.c:46:10: Call
  44.   int BN_RECP_CTX_set(BN_RECP_CTX *recp, const BIGNUM *d, BN_CTX *ctx)
  45.   {
  46.       if (!BN_copy(&(recp->N), d))
                 ^
  47.           return 0;
  48.       BN_zero(&(recp->Nr));

crypto/bn/bn_lib.c:322:1: Parameter `*a->d`
    320.   }
    321.   
    322. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    323.   {
    324.       bn_check_top(b);

test/bntest.c:244:9: Call
242.           b->neg = rand_neg();
243.           BN_RECP_CTX_set(recp, b, ctx);
244.           BN_div_recp(d, c, a, recp, ctx);
               ^
245.           BN_mul(e, d, b, ctx);
246.           BN_add(d, e, c);

crypto/bn/bn_recp.c:83:1: Parameter `*recp->N.d`
  81.   }
  82.   
  83. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
  84.                   BN_RECP_CTX *recp, BN_CTX *ctx)
  85.   {

crypto/bn/bn_recp.c:145:10: Call
  143.       d->neg = 0;
  144.   
  145.       if (!BN_mul(b, &(recp->N), d, ctx))
                  ^
  146.           goto err;
  147.       if (!BN_usub(r, m, b))

crypto/bn/bn_mul.c:495:1: Parameter `*a->d`
    493.   #endif                          /* BN_RECURSION */
    494.   
    495. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    496.   {
    497.       int ret = 0;

crypto/bn/bn_mul.c:575:17: Call
    573.                   if (bn_wexpand(rr, k * 4) == NULL)
    574.                       goto err;
    575.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    576.                                         j, al - j, bl - j, t->d);
    577.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:320:1: Parameter `n`
      318.    */
      319.   /* tnX may not be negative but less than n */
      320. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      321.                              int tna, int tnb, BN_ULONG *t)
      322.   {

crypto/bn/bn_mul.c:333:10: Call
      331.   
      332.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      333.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                      ^
      334.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
      335.       neg = 0;

crypto/bn/bn_lib.c:733:1: Parameter `cl`
        731.    */
        732.   
        733. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        734.   {
        735.       int n, i;

crypto/bn/bn_lib.c:750:12: Call
        748.           }
        749.       }
        750.       return bn_cmp_words(a, b, cl);
                          ^
        751.   }
        752.   

crypto/bn/bn_lib.c:706:1: <Offset trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

crypto/bn/bn_lib.c:706:1: Parameter `n`
          704.   }
          705.   
          706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          707.   {
          708.       int i;

crypto/bn/bn_lib.c:715:10: Assignment
          713.       if (aa != bb)
          714.           return ((aa > bb) ? 1 : -1);
          715.       for (i = n - 2; i >= 0; i--) {
                          ^
          716.           aa = a[i];
          717.           bb = b[i];

crypto/bn/bn_lib.c:706:1: <Length trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

crypto/bn/bn_lib.c:706:1: Parameter `*b`
          704.   }
          705.   
          706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          707.   {
          708.       int i;

crypto/bn/bn_lib.c:717:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_div_recp` 
          715.       for (i = n - 2; i >= 0; i--) {
          716.           aa = a[i];
          717.           bb = b[i];
                              ^
          718.           if (aa != bb)
          719.               return ((aa > bb) ? 1 : -1);
