crypto/bn/bn_gf2m.c:1100: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_sqr_arr`.
Showing all 16 steps of the trace


crypto/bn/bn_gf2m.c:1097:18: Call
1095.                   goto err;
1096.               BN_zero(z);
1097.               if (!BN_copy(w, rho))
                         ^
1098.                   goto err;
1099.               for (j = 1; j <= p[0] - 1; j++) {

crypto/bn/bn_lib.c:323:1: Parameter `a->top`
  321.   }
  322.   
  323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  324.   {
  325.       bn_check_top(b);

crypto/bn/bn_gf2m.c:1100:22: Call
1098.                   goto err;
1099.               for (j = 1; j <= p[0] - 1; j++) {
1100.                   if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx))
                             ^
1101.                       goto err;
1102.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))

crypto/bn/bn_gf2m.c:497:1: Parameter `*r->d`
  495.   
  496.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  497. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  498.                           BN_CTX *ctx)
  499.   {

crypto/bn/bn_gf2m.c:517:10: Call
  515.       s->top = 2 * a->top;
  516.       bn_correct_top(s);
  517.       if (!BN_GF2m_mod_arr(r, s, p))
                  ^
  518.           goto err;
  519.       bn_check_top(r);

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

crypto/bn/bn_gf2m.c:319:14: Call
    317.        */
    318.       if (a != r) {
    319.           if (!bn_wexpand(r, a->top))
                        ^
    320.               return 0;
    321.           for (j = 0; j < a->top; j++) {

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
      946.   }
      947.   
      948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      949.   {
      950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:950:37: Call
      948.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      949.   {
      950.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      951.   }
      952.   

crypto/bn/bn_lib.c:284:1: Parameter `*b->d`
        282.    */
        283.   
        284. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        285.   {
        286.       bn_check_top(b);

crypto/bn/bn_lib.c:289:23: Call
        287.   
        288.       if (words > b->dmax) {
        289.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        290.           if (!a)
        291.               return NULL;

crypto/bn/bn_lib.c:246:1: <Offset 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 = NULL;

crypto/bn/bn_lib.c:246:1: Parameter `b->top`
          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 = 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 = 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 = NULL;

crypto/bn/bn_lib.c:271:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_GF2m_mod_sqr_arr` 
          269.       assert(b->top <= words);
          270.       if (b->top > 0)
          271.           memcpy(a, b->d, sizeof(*a) * b->top);
                         ^
          272.   
          273.       return a;
