crypto/rsa/rsa_crpt.c:98: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_sub`.
Showing all 18 steps of the trace


crypto/rsa/rsa_crpt.c:92:10: Call
90.   
91.       BN_CTX_start(ctx);
92.       r0 = BN_CTX_get(ctx);
               ^
93.       r1 = BN_CTX_get(ctx);
94.       r2 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
    461.   }
    462.   
    463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    464.   {
    465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
    464.   {
    465.       bn_check_top(a);
    466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    467.           return (0);
    468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
      674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      675.   
      676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      677.   {
      678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/rsa/rsa_crpt.c:98:10: Call
96.           goto err;
97.   
98.       if (!BN_sub(r1, p, BN_value_one()))
                ^
99.           goto err;
100.       if (!BN_sub(r2, q, BN_value_one()))

crypto/bn/bn_add.c:150:1: Parameter `*r->d`
  148.   }
  149.   
  150. > int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  151.   {
  152.       int max;

crypto/bn/bn_add.c:183:14: Call
  181.   
  182.       if (add) {
  183.           if (!BN_uadd(r, a, b))
                      ^
  184.               return 0;
  185.           r->neg = neg;

crypto/bn/bn_add.c:58:1: Parameter `*r->d`
    56.   
    57.   /* unsigned add of b to a */
    58. > int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
    59.   {
    60.       int max, min, dif;

crypto/bn/bn_add.c:78:9: Call
    76.       dif = max - min;
    77.   
    78.       if (bn_wexpand(r, max + 1) == NULL)
                  ^
    79.           return 0;
    80.   

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
      1014.   }
      1015.   
      1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1017.   {
      1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:1018:37: Call
      1016.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1017.   {
      1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      1019.   }
      1020.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
        321.    */
        322.   
        323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        324.   {
        325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
        326.   
        327.       if (words > b->dmax) {
        328.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        329.           if (!a)
        330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
          270.   
          271.   #if 1
          272.       B = b->d;
                     ^
          273.       /* Check if the previous number needs to be copied */
          274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_sub` 
          287.               a1 = B[1];
          288.               a2 = B[2];
          289.               a3 = B[3];
                                  ^
          290.               A[0] = a0;
          291.               A[1] = a1;
