crypto/bn/bn_mont.c:351: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_inverse`.
Showing all 23 steps of the trace


crypto/bn/bn_mont.c:272:15: Call
270.   
271.       BN_CTX_start(ctx);
272.       if ((Ri = BN_CTX_get(ctx)) == NULL)
                     ^
273.           goto err;
274.       R = &(mont->RR);            /* grab RR as a temp */

crypto/bn/bn_ctx.c:219:5: Call
  217.       }
  218.       /* OK, make sure the returned bignum is "zero" */
  219.       BN_zero(ret);
             ^
  220.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  221.       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_mont.c:351:19: Call
349.           if (BN_is_one(&tmod))
350.               BN_zero(Ri);
351.           else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
                         ^
352.               goto err;
353.           if (!BN_lshift(Ri, Ri, BN_BITS2))

crypto/bn/bn_gcd.c:124:1: Parameter `*in->d`
  122.                                           BN_CTX *ctx);
  123.   
  124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  126.   {

crypto/bn/bn_gcd.c:129:10: Call
  127.       BIGNUM *rv;
  128.       int noinv;
  129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  130.       if (noinv)
  131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `*in->d`
    133.   }
    134.   
    135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    137.                              int *pnoinv)

crypto/bn/bn_gcd.c:155:16: Call
    153.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
    154.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
    155.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                          ^
    156.       }
    157.   

crypto/bn/bn_gcd.c:458:1: Parameter `*in->d`
      456.    * not contain branches that may leak sensitive information.
      457.    */
      458. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      459.                                           const BIGNUM *a, const BIGNUM *n,
      460.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:606:18: Call
      604.           /* Y*a == 1  (mod |n|) */
      605.           if (!Y->neg && BN_ucmp(Y, n) < 0) {
      606.               if (!BN_copy(R, Y))
                              ^
      607.                   goto err;
      608.           } else {

crypto/bn/bn_lib.c:281:1: Parameter `*a->d`
        279.   }
        280.   
        281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        282.   {
        283.       bn_check_top(b);

crypto/bn/bn_lib.c:287:9: Call
        285.       if (a == b)
        286.           return a;
        287.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        288.           return NULL;
        289.   

crypto/bn/bn_lib.c:960:1: Parameter `*a->d`
          958.   }
          959.   
          960. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          961.   {
          962.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:962:37: Call
          960.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
          961.   {
          962.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                     ^
          963.   }
          964.   

crypto/bn/bn_lib.c:245:1: Parameter `*b->d`
            243.    */
            244.   
            245. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            246.   {
            247.       if (words > b->dmax) {

crypto/bn/bn_lib.c:248:23: Call
            246.   {
            247.       if (words > b->dmax) {
            248.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            249.           if (!a)
            250.               return NULL;

crypto/bn/bn_lib.c:209:1: <Offset trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `b->top`
              207.   /* This is used by bn_expand2() */
              208.   /* The caller MUST check that words > b->dmax before calling this */
              209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              210.   {
              211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: <Length trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `*b->d`
              207.   /* This is used by bn_expand2() */
              208.   /* The caller MUST check that words > b->dmax before calling this */
              209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              210.   {
              211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:232:9: Array access: Offset added: [8, +oo] Size: [0, +oo] by call to `BN_mod_inverse` 
              230.       assert(b->top <= words);
              231.       if (b->top > 0)
              232.           memcpy(a, b->d, sizeof(*a) * b->top);
                             ^
              233.   
              234.       return a;
