test/bntest.c:1463: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_div`.
Showing all 12 steps of the trace


test/bntest.c:1463:13: Call
1461.           BN_bntest_rand(c, 512, 0, 0);
1462.           for (j = 0; j < 2; j++) {
1463.               BN_GF2m_mod_div(d, a, c, b[j], ctx);
                    ^
1464.               BN_GF2m_mod_mul(e, d, c, b[j], ctx);
1465.               BN_GF2m_mod_div(f, a, e, b[j], ctx);

crypto/bn/bn_gf2m.c:831:1: Parameter `r->top`
  829.    * or y, x could equal y.
  830.    */
  831. > int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x,
  832.                       const BIGNUM *p, BN_CTX *ctx)
  833.   {

test/bntest.c:1463:13: Call
1461.           BN_bntest_rand(c, 512, 0, 0);
1462.           for (j = 0; j < 2; j++) {
1463.               BN_GF2m_mod_div(d, a, c, b[j], ctx);
                    ^
1464.               BN_GF2m_mod_mul(e, d, c, b[j], ctx);
1465.               BN_GF2m_mod_div(f, a, e, b[j], ctx);

crypto/bn/bn_gf2m.c:831:1: Parameter `*y->d`
  829.    * or y, x could equal y.
  830.    */
  831. > int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x,
  832.                       const BIGNUM *p, BN_CTX *ctx)
  833.   {

crypto/bn/bn_gf2m.c:848:10: Call
  846.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
  847.           goto err;
  848.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))
                  ^
  849.           goto err;
  850.       bn_check_top(r);

crypto/bn/bn_gf2m.c:544:1: Parameter `*a->d`
    542.    * BN_GF2m_mod_mul_arr function.
    543.    */
    544. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    545.                       const BIGNUM *p, BN_CTX *ctx)
    546.   {

crypto/bn/bn_gf2m.c:560:11: Call
    558.           goto err;
    559.       }
    560.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                     ^
    561.       bn_check_top(r);
    562.    err:

crypto/bn/bn_gf2m.c:489:1: <Offset trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `a->top`
      487.    * the result in r.  r could be a or b; a could be b.
      488.    */
      489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      490.                           const int p[], BN_CTX *ctx)
      491.   {

crypto/bn/bn_gf2m.c:489:1: <Length trace>
487.    * the result in r.  r could be a or b; a could be b.
488.    */
489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
490.                           const int p[], BN_CTX *ctx)
491.   {

crypto/bn/bn_gf2m.c:489:1: Parameter `*a->d`
      487.    * the result in r.  r could be a or b; a could be b.
      488.    */
      489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
      490.                           const int p[], BN_CTX *ctx)
      491.   {

crypto/bn/bn_gf2m.c:520:44: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_div` 
      518.           for (i = 0; i < a->top; i += 2) {
      519.               x0 = a->d[i];
      520.               x1 = ((i + 1) == a->top) ? 0 : a->d[i + 1];
                                                        ^
      521.               bn_GF2m_mul_2x2(zz, x1, x0, y1, y0);
      522.               for (k = 0; k < 4; k++)
