crypto/bn/bn_gf2m.c:560: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, +oo] by call to `BN_GF2m_mod_mul_arr`.
Showing all 16 steps of the trace


crypto/bn/bn_gf2m.c:548:21: Call
546.   {
547.       int ret = 0;
548.       const int max = BN_num_bits(p) + 1;
                           ^
549.       int *arr = NULL;
550.       bn_check_top(a);

crypto/bn/bn_lib.c:221:9: Assignment
  219.   
  220.       if (BN_is_zero(a))
  221.           return 0;
                 ^
  222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
  223.   }

crypto/bn/bn_gf2m.c:548:5: Assignment
546.   {
547.       int ret = 0;
548.       const int max = BN_num_bits(p) + 1;
           ^
549.       int *arr = NULL;
550.       bn_check_top(a);

crypto/bn/bn_gf2m.c:553:16: Call
551.       bn_check_top(b);
552.       bn_check_top(p);
553.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                      ^
554.           goto err;
555.       ret = BN_GF2m_poly2arr(p, arr, max);

crypto/mem.c:125:9: Assignment
  123.   
  124.       if (num <= 0)
  125.           return NULL;
                 ^
  126.   
  127.       allow_customize = 0;

crypto/bn/bn_gf2m.c:553:10: Assignment
551.       bn_check_top(b);
552.       bn_check_top(p);
553.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                ^
554.           goto err;
555.       ret = BN_GF2m_poly2arr(p, arr, max);

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: Parameter `*p`
  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:500:16: Call
  498.   
  499.       if (a == b) {
  500.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  501.       }
  502.   

crypto/bn/bn_gf2m.c:568:1: Parameter `*p`
    566.   
    567.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    568. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
    569.                           BN_CTX *ctx)
    570.   {

crypto/bn/bn_gf2m.c:588:10: Call
    586.       s->top = 2 * a->top;
    587.       bn_correct_top(s);
    588.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    589.           goto err;
    590.       bn_check_top(r);

crypto/bn/bn_gf2m.c:409:14: <Offset trace>
407.           z[j] = 0;
408.   
409.           for (k = 1; p[k] != 0; k++) {
                    ^
410.               /* reducing component t^p[k] */
411.               n = p[0] - p[k];

crypto/bn/bn_gf2m.c:409:14: Assignment
      407.           z[j] = 0;
      408.   
      409.           for (k = 1; p[k] != 0; k++) {
                          ^
      410.               /* reducing component t^p[k] */
      411.               n = p[0] - p[k];

crypto/bn/bn_gf2m.c:371:1: <Length trace>
369.   
370.   /* Performs modular reduction of a and store result in r.  r could be a. */
371. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
372.   {
373.       int j, k;

crypto/bn/bn_gf2m.c:371:1: Parameter `*p`
      369.   
      370.   /* Performs modular reduction of a and store result in r.  r could be a. */
      371. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
      372.   {
      373.       int j, k;

crypto/bn/bn_gf2m.c:409:21: Array access: Offset: [1, +oo] Size: [0, +oo] by call to `BN_GF2m_mod_mul_arr` 
      407.           z[j] = 0;
      408.   
      409.           for (k = 1; p[k] != 0; k++) {
                                 ^
      410.               /* reducing component t^p[k] */
      411.               n = p[0] - p[k];
