crypto/objects/obj_dat.c:499: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_add_word`.
Showing all 10 steps of the trace


crypto/objects/obj_dat.c:508:22: Call
506.                   if (bl == NULL && (bl = BN_new()) == NULL)
507.                       goto err;
508.                   if (!BN_set_word(bl, l))
                            ^
509.                       goto err;
510.                   use_bn = 1;

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
  518.   }
  519.   
  520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  521.   {
  522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
  521.   {
  522.       bn_check_top(a);
  523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  524.           return (0);
  525.       a->neg = 0;

crypto/bn/bn_lcl.h:777:1: Parameter `*a->d`
    775.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
    776.   
    777. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
    778.   {
    779.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/objects/obj_dat.c:499:22: Call
497.                   goto err;
498.               if (use_bn) {
499.                   if (!BN_add_word(bl, c & 0x7f))
                            ^
500.                       goto err;
501.               } else

crypto/bn/bn_word.c:122:1: Parameter `*a->d`
  120.   }
  121.   
  122. > int BN_add_word(BIGNUM *a, BN_ULONG w)
  123.   {
  124.       BN_ULONG l;

crypto/bn/bn_word.c:139:13: Call
  137.       if (a->neg) {
  138.           a->neg = 0;
  139.           i = BN_sub_word(a, w);
                     ^
  140.           if (!BN_is_zero(a))
  141.               a->neg = !(a->neg);

crypto/bn/bn_word.c:158:1: <Length trace>
156.   }
157.   
158. > int BN_sub_word(BIGNUM *a, BN_ULONG w)
159.   {
160.       int i;

crypto/bn/bn_word.c:158:1: Parameter `*a->d`
    156.   }
    157.   
    158. > int BN_sub_word(BIGNUM *a, BN_ULONG w)
    159.   {
    160.       int i;

crypto/bn/bn_word.c:184:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_add_word` 
    182.   
    183.       if ((a->top == 1) && (a->d[0] < w)) {
    184.           a->d[0] = w - a->d[0];
                   ^
    185.           a->neg = 1;
    186.           return (1);
