test/bntest.c:1328: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_arr2poly`.
Showing all 15 steps of the trace


test/bntest.c:1327:5: Call
1325.       h = BN_new();
1326.   
1327.       BN_GF2m_arr2poly(p0, b[0]);
            ^
1328.       BN_GF2m_arr2poly(p1, b[1]);
1329.   

crypto/bn/bn_gf2m.c:1280:1: Parameter `*a->d`
  1278.    * bit-string.  The array must be terminated by -1.
  1279.    */
  1280. > int BN_GF2m_arr2poly(const int p[], BIGNUM *a)
  1281.   {
  1282.       int i;

crypto/bn/bn_gf2m.c:1285:5: Call
  1283.   
  1284.       bn_check_top(a);
  1285.       BN_zero(a);
              ^
  1286.       for (i = 0; p[i] != -1; i++) {
  1287.           if (BN_set_bit(a, p[i]) == 0)

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

test/bntest.c:1328:5: Call
1326.   
1327.       BN_GF2m_arr2poly(p0, b[0]);
1328.       BN_GF2m_arr2poly(p1, b[1]);
            ^
1329.   
1330.       for (i = 0; i < num0; i++) {

crypto/bn/bn_gf2m.c:1280:1: Parameter `*a->d`
  1278.    * bit-string.  The array must be terminated by -1.
  1279.    */
  1280. > int BN_GF2m_arr2poly(const int p[], BIGNUM *a)
  1281.   {
  1282.       int i;

crypto/bn/bn_gf2m.c:1285:5: Call
  1283.   
  1284.       bn_check_top(a);
  1285.       BN_zero(a);
              ^
  1286.       for (i = 0; p[i] != -1; i++) {
  1287.           if (BN_set_bit(a, p[i]) == 0)

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_lib.c:533:9: Call
    531.   {
    532.       bn_check_top(a);
    533.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    534.           return (0);
    535.       a->neg = 0;

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
      388.    */
      389.   
      390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      391.   {
      392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
      393.   
      394.       if (words > b->dmax) {
      395.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      396.           if (!a)
      397.               return NULL;

crypto/bn/bn_lib.c:300:1: <Length trace>
298.   /* This is used by bn_expand2() */
299.   /* The caller MUST check that words > b->dmax before calling this */
300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
301.   {
302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:300:1: Parameter `*b->d`
        298.   /* This is used by bn_expand2() */
        299.   /* The caller MUST check that words > b->dmax before calling this */
        300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
        301.   {
        302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:335:5: Assignment
        333.   
        334.   #if 1
        335.       B = b->d;
                   ^
        336.       /* Check if the previous number needs to be copied */
        337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_arr2poly` 
        350.               a1 = B[1];
        351.               a2 = B[2];
        352.               a3 = B[3];
                                ^
        353.               A[0] = a0;
        354.               A[1] = a1;
