crypto/bn/bn_word.c:78: error: BUFFER_OVERRUN_L3
  Offset added: [0, 512] Size: [0, 67108856] by call to `BN_lshift`.
Showing all 21 steps of the trace


crypto/bn/bn_word.c:76:20: Call
74.   
75.       /* normalize input (so bn_div_words doesn't complain) */
76.       j = BN_BITS2 - BN_num_bits_word(w);
                         ^
77.       w <<= j;
78.       if (!BN_lshift(a, a, j))

crypto/bn/bn_lib.c:93:17: Assignment
  91.   {
  92.       BN_ULONG x, mask;
  93.       int bits = (l != 0);
                        ^
  94.   
  95.   #if BN_BITS2 > 32

crypto/bn/bn_lib.c:93:5: Assignment
  91.   {
  92.       BN_ULONG x, mask;
  93.       int bits = (l != 0);
            ^
  94.   
  95.   #if BN_BITS2 > 32

crypto/bn/bn_lib.c:99:5: Assignment
  97.       mask = (0 - x) & BN_MASK2;
  98.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  99.       bits += 32 & mask;
             ^
  100.       l ^= (x ^ l) & mask;
  101.   #endif

crypto/bn/bn_lib.c:106:5: Assignment
  104.       mask = (0 - x) & BN_MASK2;
  105.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  106.       bits += 16 & mask;
             ^
  107.       l ^= (x ^ l) & mask;
  108.   

crypto/bn/bn_lib.c:112:5: Assignment
  110.       mask = (0 - x) & BN_MASK2;
  111.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  112.       bits += 8 & mask;
             ^
  113.       l ^= (x ^ l) & mask;
  114.   

crypto/bn/bn_lib.c:118:5: Assignment
  116.       mask = (0 - x) & BN_MASK2;
  117.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  118.       bits += 4 & mask;
             ^
  119.       l ^= (x ^ l) & mask;
  120.   

crypto/bn/bn_lib.c:124:5: Assignment
  122.       mask = (0 - x) & BN_MASK2;
  123.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  124.       bits += 2 & mask;
             ^
  125.       l ^= (x ^ l) & mask;
  126.   

crypto/bn/bn_lib.c:130:5: Assignment
  128.       mask = (0 - x) & BN_MASK2;
  129.       mask = (0 - (mask >> (BN_BITS2 - 1)));
  130.       bits += 1 & mask;
             ^
  131.   
  132.       return bits;

crypto/bn/bn_lib.c:132:5: Assignment
  130.       bits += 1 & mask;
  131.   
  132.       return bits;
             ^
  133.   }
  134.   

crypto/bn/bn_word.c:76:5: Assignment
74.   
75.       /* normalize input (so bn_div_words doesn't complain) */
76.       j = BN_BITS2 - BN_num_bits_word(w);
          ^
77.       w <<= j;
78.       if (!BN_lshift(a, a, j))

crypto/bn/bn_word.c:78:10: Call
76.       j = BN_BITS2 - BN_num_bits_word(w);
77.       w <<= j;
78.       if (!BN_lshift(a, a, j))
               ^
79.           return (BN_ULONG)-1;
80.   

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:115:5: Array access: Offset added: [0, 512] Size: [0, 67108856] by call to `BN_lshift` 
  113.               t[nw + i] = (l << lb) & BN_MASK2;
  114.           }
  115.       memset(t, 0, sizeof(*t) * nw);
             ^
  116.       r->top = a->top + nw + 1;
  117.       bn_correct_top(r);
