crypto/bn/bn_exp.c:359: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `bn_to_mont_fixed_top`.
Showing all 14 steps of the trace


crypto/bn/bn_exp.c:296:1: Parameter `in_mont->N.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:359:10: Call
357.       } else
358.           aa = a;
359.       if (!bn_to_mont_fixed_top(val[0], aa, mont, ctx))
                ^
360.           goto err;               /* 1 */
361.   

crypto/bn/bn_mont.c:210:1: Parameter `mont->N.top`
  208.   }
  209.   
  210. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  211.                            BN_CTX *ctx)
  212.   {

crypto/bn/bn_mont.c:213:12: Call
  211.                            BN_CTX *ctx)
  212.   {
  213.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                    ^
  214.   }
  215.   

crypto/bn/bn_mont.c:37:1: Parameter `mont->N.top`
    35.   }
    36.   
    37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    39.   {

crypto/bn/bn_mont.c:75:10: Call
    73.       /* reduce from aRR to aR */
    74.   #ifdef MONT_WORD
    75.       if (!bn_from_montgomery_word(r, tmp, mont))
                   ^
    76.           goto err;
    77.   #else

crypto/bn/bn_mont.c:123:21: <Offset trace>
121.        * includes |carry| which is stored separately.
122.        */
123.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                           ^
124.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
125.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:123:21: Assignment
      121.        * includes |carry| which is stored separately.
      122.        */
      123.       for (carry = 0, i = 0; i < nl; i++, rp++) {
                                 ^
      124.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
      125.           v = (v + carry + rp[nl]) & BN_MASK2;

crypto/bn/bn_mont.c:88:1: <Length trace>
86.   
87.   #ifdef MONT_WORD
88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
89.   {
90.       BIGNUM *n;

crypto/bn/bn_mont.c:88:1: Parameter `*r->d`
      86.   
      87.   #ifdef MONT_WORD
      88. > static int bn_from_montgomery_word(BIGNUM *ret, BIGNUM *r, BN_MONT_CTX *mont)
      89.   {
      90.       BIGNUM *n;

crypto/bn/bn_mont.c:102:9: Call
      100.   
      101.       max = (2 * nl);             /* carry is stored separately */
      102.       if (bn_wexpand(r, max) == NULL)
                     ^
      103.           return 0;
      104.   

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
        946.   }
        947.   
        948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        949.   {
        950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mont.c:107:5: Assignment
      105.       r->neg ^= n->neg;
      106.       np = n->d;
      107.       rp = r->d;
                 ^
      108.   
      109.       /* clear the top words of T */

crypto/bn/bn_mont.c:125:26: Array access: Offset: [1, +oo] (⇐ [0, +oo] + [1, +oo]) Size: [0, 8388607] by call to `bn_to_mont_fixed_top` 
      123.       for (carry = 0, i = 0; i < nl; i++, rp++) {
      124.           v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2);
      125.           v = (v + carry + rp[nl]) & BN_MASK2;
                                      ^
      126.           carry |= (v != rp[nl]);
      127.           carry &= (v <= rp[nl]);
