crypto/ec/ec2_oct.c:176: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_is_odd`.
Showing all 9 steps of the trace


crypto/ec/ec2_oct.c:163:13: Call
161.           BN_CTX_start(ctx);
162.           used_ctx = 1;
163.           x = BN_CTX_get(ctx);
                   ^
164.           y = BN_CTX_get(ctx);
165.           yxi = 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.       /* 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/ec/ec2_oct.c:176:17: Call
174.               if (!group->meth->field_div(group, yxi, y, x, ctx))
175.                   goto err;
176.               if (BN_is_odd(yxi))
                       ^
177.                   buf[0]++;
178.           }

crypto/bn/bn_lib.c:858:1: <Length trace>
856.   }
857.   
858. > int BN_is_odd(const BIGNUM *a)
859.   {
860.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_lib.c:858:1: Parameter `*a->d`
  856.   }
  857.   
  858. > int BN_is_odd(const BIGNUM *a)
  859.   {
  860.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_lib.c:860:29: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_is_odd` 
  858.   int BN_is_odd(const BIGNUM *a)
  859.   {
  860.       return (a->top > 0) && (a->d[0] & 1);
                                     ^
  861.   }
  862.   
