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


crypto/bn/bn_prime.c:151:1: Parameter `a->top`
149.   }
150.   
151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
152.                               int do_trial_division, BN_GENCB *cb)
153.   {

crypto/bn/bn_prime.c:160:9: Call
158.       BN_MONT_CTX *mont = NULL;
159.   
160.       if (BN_cmp(a, BN_value_one()) <= 0)
               ^
161.           return 0;
162.   

crypto/bn/bn_lib.c:569:1: Parameter `a->top`
  567.   }
  568.   
  569. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  570.   {
  571.       int i;

crypto/bn/bn_prime.c:167:10: Call
165.   
166.       /* first look for small factors */
167.       if (!BN_is_odd(a))
                ^
168.           /* a is even => a is prime if and only if a == 2 */
169.           return BN_is_word(a, 2);

crypto/bn/bn_lib.c:859:1: Parameter `a->top`
  857.   }
  858.   
  859. > int BN_is_odd(const BIGNUM *a)
  860.   {
  861.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_prime.c:195:10: Call
193.   
194.       /* compute A1 := a - 1 */
195.       if (!BN_copy(A1, a))
                ^
196.           goto err;
197.       if (!BN_sub_word(A1, 1))

crypto/bn/bn_lib.c:312:1: Parameter `b->top`
  310.   }
  311.   
  312. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  313.   {
  314.       bn_check_top(b);

crypto/bn/bn_prime.c:215:10: Call
213.       if (mont == NULL)
214.           goto err;
215.       if (!BN_MONT_CTX_set(mont, a, ctx))
                ^
216.           goto err;
217.   

crypto/bn/bn_mont.c:252:9: Call
  250.       BIGNUM *Ri, *R;
  251.   
  252.       if (BN_is_zero(mod))
                 ^
  253.           return 0;
  254.   

crypto/bn/bn_lib.c:844:1: Parameter `a->top`
    842.   }
    843.   
    844. > int BN_is_zero(const BIGNUM *a)
    845.   {
    846.       return a->top == 0;

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

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

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

crypto/bn/bn_exp.c:296:1: Parameter `m->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:598:1: Parameter `m->top`
      596.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      597.    */
      598. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      599.                                 const BIGNUM *m, BN_CTX *ctx,
      600.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:619:10: Call
      617.       bn_check_top(m);
      618.   
      619.       if (!BN_is_odd(m)) {
                      ^
      620.           BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME, BN_R_CALLED_WITH_EVEN_MODULUS);
      621.           return 0;

crypto/bn/bn_lib.c:859:1: Parameter `a->top`
        857.   }
        858.   
        859. > int BN_is_odd(const BIGNUM *a)
        860.   {
        861.       return (a->top > 0) && (a->d[0] & 1);

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

crypto/bn/bn_mod.c:13:1: Parameter `d->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:199:31: Call
          197.   
          198.       /* First we normalise the numbers */
          199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                               ^
          200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          201.           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:199:5: Assignment
          197.   
          198.       /* First we normalise the numbers */
          199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                     ^
          200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
          201.           goto err;

crypto/bn/bn_div.c:200:11: Call
          198.       /* First we normalise the numbers */
          199.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
          200.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                           ^
          201.           goto err;
          202.       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:940:1: Parameter `*a->d`
              938.   }
              939.   
              940. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              941.   {
              942.       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.           }
