crypto/bn/bn_prime.c:223: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `witness`.
Showing all 22 steps of the trace


crypto/bn/bn_prime.c:198:10: Call
196.   
197.       /* compute A1 := a - 1 */
198.       if (!BN_copy(A1, a) || !BN_sub_word(A1, 1))
                ^
199.           goto err;
200.       /* compute A3 := a - 3 */

crypto/bn/bn_lib.c:285:1: Parameter `a->top`
  283.   }
  284.   
  285. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  286.   {
  287.       bn_check_top(b);

crypto/bn/bn_prime.c:223:13: Call
221.               goto err;
222.   
223.           j = witness(check, a, A1, A1_odd, k, ctx, mont);
                   ^
224.           if (j == -1)
225.               goto err;

crypto/bn/bn_prime.c:245:1: Parameter `w->top`
  243.   }
  244.   
  245. > static int witness(BIGNUM *w, const BIGNUM *a, const BIGNUM *a1,
  246.                      const BIGNUM *a1_odd, int k, BN_CTX *ctx,
  247.                      BN_MONT_CTX *mont)

crypto/bn/bn_prime.c:249:10: Call
  247.                      BN_MONT_CTX *mont)
  248.   {
  249.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                  ^
  250.           return -1;
  251.       if (BN_is_one(w))

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
    294.   }
    295.   
    296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    298.   {

crypto/bn/bn_exp.c:310:16: Call
    308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
    309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
    310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    311.       }
    312.   

crypto/bn/bn_exp.c:596:1: Parameter `a->top`
      594.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      595.    */
      596. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      597.                                 const BIGNUM *m, BN_CTX *ctx,
      598.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:755:14: Call
      753.       /* prepare a^1 in Montgomery domain */
      754.       if (a->neg || BN_ucmp(a, m) >= 0) {
      755.           if (!BN_nnmod(&am, a, m, ctx))
                          ^
      756.               goto err;
      757.           if (!BN_to_montgomery(&am, &am, mont, ctx))

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:137:1: Parameter `num->top`
          135.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
          136.    */
          137. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
          138.              BN_CTX *ctx)
          139.   {

crypto/bn/bn_div.c:204:11: Call
          202.       sdiv->neg = 0;
          203.       norm_shift += BN_BITS2;
          204.       if (!(BN_lshift(snum, num, norm_shift)))
                           ^
          205.           goto err;
          206.       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:941:1: Parameter `*a->d`
              939.   }
              940.   
              941. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              942.   {
              943.       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 `witness` 
            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.           }
