test/bntest.c:1964: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_div`.
Showing all 16 steps of the trace


test/bntest.c:1962:5: Call
1960.       if (a == NULL || b == NULL || zero == NULL || mont == NULL)
1961.           goto err;
1962.       BN_zero(zero);
            ^
1963.   
1964.       if (BN_div(a, b, BN_value_one(), zero, ctx)) {

crypto/bn/bn_lib.c:393:1: Parameter `a->top`
  391.   }
  392.   
  393. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  394.   {
  395.       bn_check_top(a);

test/bntest.c:1964:9: Call
1962.       BN_zero(zero);
1963.   
1964.       if (BN_div(a, b, BN_value_one(), zero, ctx)) {
                ^
1965.           fprintf(stderr, "Division by zero succeeded!\n");
1966.           goto err;

crypto/bn/bn_div.c:205:31: Call
  203.   
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                       ^
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  207.           goto err;

crypto/bn/bn_lib.c:167:9: Assignment
    165.   
    166.       if (BN_is_zero(a))
    167.           return 0;
                   ^
    168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
    169.   }

crypto/bn/bn_div.c:205:5: Assignment
  203.   
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
             ^
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
  207.           goto err;

crypto/bn/bn_div.c:206:11: Call
  204.       /* First we normalise the numbers */
  205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
  206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                   ^
  207.           goto err;
  208.       sdiv->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:946:1: Parameter `*a->d`
      944.   }
      945.   
      946. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      947.   {
      948.       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_div` 
    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.           }
