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


crypto/bn/bn_gcd.c:159:5: Assignment
157.   {
158.       BIGNUM *t;
159.       int shifts = 0;
           ^
160.   
161.       bn_check_top(a);

crypto/bn/bn_gcd.c:212:14: Call
210.   
211.       if (shifts) {
212.           if (!BN_lshift(a, a, shifts))
                    ^
213.               goto err;
214.       }

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
  143.   
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
             ^
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
  147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
  128.   }
  129.   
  130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
  131.   {
  132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
  144.       r->neg = a->neg;
  145.       nw = n / BN_BITS2;
  146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                 ^
  147.           return (0);
  148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
    993.   }
    994.   
    995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
  149.       rb = BN_BITS2 - lb;
  150.       f = a->d;
  151.       t = r->d;
             ^
  152.       t[a->top + nw] = 0;
  153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_lshift` 
  157.           for (i = a->top - 1; i >= 0; i--) {
  158.               l = f[i];
  159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                     ^
  160.               t[nw + i] = (l << lb) & BN_MASK2;
  161.           }
