crypto/bn/bn_gcd.c:187: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_nnmod`.
Showing all 16 steps of the trace


crypto/bn/bn_gcd.c:181:9: Call
179.       BN_one(X);
180.       BN_zero(Y);
181.       if (BN_copy(B, a) == NULL)
               ^
182.           goto err;
183.       if (BN_copy(A, n) == NULL)

crypto/bn/bn_lib.c:281:1: Parameter `a->top`
  279.   }
  280.   
  281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  282.   {
  283.       bn_check_top(b);

crypto/bn/bn_gcd.c:187:14: Call
185.       A->neg = 0;
186.       if (B->neg || (BN_ucmp(B, A) >= 0)) {
187.           if (!BN_nnmod(B, B, A, ctx))
                    ^
188.               goto err;
189.       }

crypto/bn/bn_mod.c:13:1: Parameter `m->top`
  11.   #include "bn_lcl.h"
  12.   
  13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
  14.   {
  15.       /*

crypto/bn/bn_mod.c:20:11: Call
  18.        */
  19.   
  20.       if (!(BN_mod(r, m, d, ctx)))
                  ^
  21.           return 0;
  22.       if (!r->neg)

crypto/bn/bn_div.c:188:1: Parameter `num->top`
    186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    187.    */
    188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    189.              BN_CTX *ctx)
    190.   {

crypto/bn/bn_div.c:255:11: Call
    253.       sdiv->neg = 0;
    254.       norm_shift += BN_BITS2;
    255.       if (!(BN_lshift(snum, num, norm_shift)))
                     ^
    256.           goto err;
    257.       snum->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
      81.   }
      82.   
      83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      84.   {
      85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
      95.       }
      96.   
      97.       nw = n / BN_BITS2;
                 ^
      98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
      99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
      81.   }
      82.   
      83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
      84.   {
      85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
      96.   
      97.       nw = n / BN_BITS2;
      98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                     ^
      99.           return 0;
      100.       r->neg = a->neg;

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
        937.   }
        938.   
        939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        940.   {
        941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
      102.       rb = BN_BITS2 - lb;
      103.       f = a->d;
      104.       t = r->d;
                 ^
      105.       t[a->top + nw] = 0;
      106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_nnmod` 
      110.           for (i = a->top - 1; i >= 0; i--) {
      111.               l = f[i];
      112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                         ^
      113.               t[nw + i] = (l << lb) & BN_MASK2;
      114.           }
