crypto/bn/bn_exp.c:220: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_mul_reciprocal`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:192:10: Call
190.   
191.       BN_CTX_start(ctx);
192.       aa = BN_CTX_get(ctx);
                ^
193.       val[0] = BN_CTX_get(ctx);
194.       if (val[0] == NULL)

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  231.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:359:1: Parameter `*a->d`
    357.   }
    358.   
    359. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    360.   {
    361.       bn_check_top(a);

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_exp.c:220:14: Call
218.       window = BN_window_bits_for_exponent_size(bits);
219.       if (window > 1) {
220.           if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
                    ^
221.               goto err;           /* 2 */
222.           j = 1 << (window - 1);

crypto/bn/bn_recp.c:55:1: Parameter `*x->d`
  53.   }
  54.   
  55. > int BN_mod_mul_reciprocal(BIGNUM *r, const BIGNUM *x, const BIGNUM *y,
  56.                             BN_RECP_CTX *recp, BN_CTX *ctx)
  57.   {

crypto/bn/bn_recp.c:77:11: Call
  75.           ca = x;                 /* Just do the mod */
  76.   
  77.       ret = BN_div_recp(NULL, r, ca, recp, ctx);
                  ^
  78.    err:
  79.       BN_CTX_end(ctx);

crypto/bn/bn_recp.c:84:1: Parameter `*m->d`
    82.   }
    83.   
    84. > int BN_div_recp(BIGNUM *dv, BIGNUM *rem, const BIGNUM *m,
    85.                   BN_RECP_CTX *recp, BN_CTX *ctx)
    86.   {

crypto/bn/bn_recp.c:132:10: Call
    130.        *    = |m/N|
    131.        */
    132.       if (!BN_rshift(a, m, recp->num_bits))
                    ^
    133.           goto err;
    134.       if (!BN_mul(b, a, &(recp->Nr), ctx))

crypto/bn/bn_shift.c:153:1: <Length trace>
151.   }
152.   
153. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
154.   {
155.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:153:1: Parameter `*a->d`
      151.   }
      152.   
      153. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
      154.   {
      155.       int i, j, nw, lb, rb;

crypto/bn/bn_shift.c:184:5: Assignment
      182.       }
      183.   
      184.       f = &(a->d[nw]);
                 ^
      185.       t = r->d;
      186.       j = a->top - nw;

crypto/bn/bn_shift.c:193:15: Assignment
      191.               *(t++) = *(f++);
      192.       } else {
      193.           l = *(f++);
                           ^
      194.           for (i = j - 1; i != 0; i--) {
      195.               tmp = (l >> rb) & BN_MASK2;

crypto/bn/bn_shift.c:196:17: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_mul_reciprocal` 
      194.           for (i = j - 1; i != 0; i--) {
      195.               tmp = (l >> rb) & BN_MASK2;
      196.               l = *(f++);
                             ^
      197.               *(t++) = (tmp | (l << lb)) & BN_MASK2;
      198.           }
