crypto/ec/ec2_mult.c:239: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_add`.
Showing all 15 steps of the trace


crypto/ec/ec2_mult.c:217:10: Call
215.       if (!group->meth->field_mul(group, x1, z2, x1, ctx))
216.           goto err;
217.       if (!BN_GF2m_add(z2, z2, x2))
                ^
218.           goto err;
219.   

crypto/bn/bn_gf2m.c:331:1: Parameter `*r->d`
  329.    * could be equal; r is the bitwise XOR of a and b.
  330.    */
  331. > int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  332.   {
  333.       int i;

crypto/bn/bn_gf2m.c:347:9: Call
  345.       }
  346.   
  347.       if (bn_wexpand(r, at->top) == NULL)
                 ^
  348.           return 0;
  349.   

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
    993.   }
    994.   
    995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/ec/ec2_mult.c:239:10: Call
237.       if (!group->meth->field_mul(group, x2, x1, t3, ctx))
238.           goto err;
239.       if (!BN_GF2m_add(z2, x2, x))
                ^
240.           goto err;
241.   

crypto/bn/bn_gf2m.c:331:1: Parameter `*r->d`
  329.    * could be equal; r is the bitwise XOR of a and b.
  330.    */
  331. > int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
  332.   {
  333.       int i;

crypto/bn/bn_gf2m.c:347:9: Call
  345.       }
  346.   
  347.       if (bn_wexpand(r, at->top) == NULL)
                 ^
  348.           return 0;
  349.   

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
    993.   }
    994.   
    995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
    995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
    996.   {
    997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                ^
    998.   }
    999.   

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_add` 
        350.               a1 = B[1];
        351.               a2 = B[2];
        352.               a3 = B[3];
                                ^
        353.               A[0] = a0;
        354.               A[1] = a1;
