crypto/objects/obj_dat.c:437: 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:446:22: Call
444.                   if (bl == NULL && (bl = BN_new()) == NULL)
445.                       goto err;
446.                   if (!BN_set_word(bl, l))
                            ^
447.                       goto err;
448.                   use_bn = 1;

crypto/bn/bn_lib.c:398:1: Parameter `*a->d`
  396.   }
  397.   
  398. > int BN_set_word(BIGNUM *a, BN_ULONG w)
  399.   {
  400.       bn_check_top(a);

crypto/bn/bn_lib.c:401:9: Call
  399.   {
  400.       bn_check_top(a);
  401.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                 ^
  402.           return (0);
  403.       a->neg = 0;

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

crypto/objects/obj_dat.c:437:22: Call
435.                   goto err;
436.               if (use_bn) {
437.                   if (!BN_add_word(bl, c & 0x7f))
                            ^
438.                       goto err;
439.               } else

crypto/bn/bn_word.c:98:1: Parameter `*a->d`
  96.   }
  97.   
  98. > int BN_add_word(BIGNUM *a, BN_ULONG w)
  99.   {
  100.       BN_ULONG l;

crypto/bn/bn_word.c:115:13: Call
  113.       if (a->neg) {
  114.           a->neg = 0;
  115.           i = BN_sub_word(a, w);
                     ^
  116.           if (!BN_is_zero(a))
  117.               a->neg = !(a->neg);

crypto/bn/bn_word.c:134:1: <Length trace>
132.   }
133.   
134. > int BN_sub_word(BIGNUM *a, BN_ULONG w)
135.   {
136.       int i;

crypto/bn/bn_word.c:134:1: Parameter `*a->d`
    132.   }
    133.   
    134. > int BN_sub_word(BIGNUM *a, BN_ULONG w)
    135.   {
    136.       int i;

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