crypto/ec/ec2_oct.c:61: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_arr`.
Showing all 16 steps of the trace


crypto/ec/ec2_oct.c:54:11: Call
52.   
53.       BN_CTX_start(ctx);
54.       tmp = BN_CTX_get(ctx);
                ^
55.       x = BN_CTX_get(ctx);
56.       y = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:221:5: Call
  219.       }
  220.       /* OK, make sure the returned bignum is "zero" */
  221.       BN_zero(ret);
             ^
  222.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  223.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:368:15: Assignment
    366.       a->neg = 0;
    367.       a->d[0] = w;
    368.       a->top = (w ? 1 : 0);
                         ^
    369.       a->flags &= ~BN_FLG_FIXED_TOP;
    370.       bn_check_top(a);

crypto/bn/bn_lib.c:368:5: Assignment
    366.       a->neg = 0;
    367.       a->d[0] = w;
    368.       a->top = (w ? 1 : 0);
               ^
    369.       a->flags &= ~BN_FLG_FIXED_TOP;
    370.       bn_check_top(a);

crypto/ec/ec2_oct.c:61:10: Call
59.           goto err;
60.   
61.       if (!BN_GF2m_mod_arr(x, x_, group->poly))
               ^
62.           goto err;
63.       if (BN_is_zero(x)) {

crypto/bn/bn_gf2m.c:292:1: Parameter `*r->d`
  290.   
  291.   /* Performs modular reduction of a and store result in r.  r could be a. */
  292. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
  293.   {
  294.       int j, k;

crypto/bn/bn_gf2m.c:311:14: Call
  309.        */
  310.       if (a != r) {
  311.           if (!bn_wexpand(r, a->top))
                      ^
  312.               return 0;
  313.           for (j = 0; j < a->top; j++) {

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

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

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, 536870848] by call to `BN_GF2m_mod_arr` 
        230.       assert(b->top <= words);
        231.       if (b->top > 0)
        232.           memcpy(a, b->d, sizeof(*a) * b->top);
                       ^
        233.   
        234.       return a;
