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


crypto/bn/bn_gf2m.c:606:21: Call
604.   {
605.       int ret = 0;
606.       const int max = BN_num_bits(p) + 1;
                           ^
607.       int *arr = NULL;
608.   

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:606:5: Assignment
604.   {
605.       int ret = 0;
606.       const int max = BN_num_bits(p) + 1;
           ^
607.       int *arr = NULL;
608.   

crypto/bn/bn_gf2m.c:611:16: Call
609.       bn_check_top(a);
610.       bn_check_top(p);
611.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                      ^
612.           goto err;
613.       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:611:10: Assignment
609.       bn_check_top(a);
610.       bn_check_top(p);
611.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                ^
612.           goto err;
613.       ret = BN_GF2m_poly2arr(p, arr, max);

crypto/bn/bn_gf2m.c:618:11: Call
616.           goto err;
617.       }
618.       ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
                 ^
619.       bn_check_top(r);
620.    err:

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_sqr_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];
