crypto/ec/ecdh_ossl.c:69: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 17 steps of the trace


crypto/ec/ecdh_ossl.c:68:14: Call
66.   
67.       if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {
68.           if (!EC_GROUP_get_cofactor(group, x, NULL) ||
                   ^
69.               !BN_mul(x, x, priv_key, ctx)) {
70.               ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);

crypto/ec/ec_lib.c:340:1: Parameter `cofactor->d`
  338.   }
  339.   
  340. > int EC_GROUP_get_cofactor(const EC_GROUP *group, BIGNUM *cofactor,
  341.                             BN_CTX *ctx)
  342.   {

crypto/ec/ecdh_ossl.c:69:14: Call
67.       if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {
68.           if (!EC_GROUP_get_cofactor(group, x, NULL) ||
69.               !BN_mul(x, x, priv_key, ctx)) {
                   ^
70.               ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);
71.               goto err;

crypto/bn/bn_mul.c:497:1: Parameter `*a->d`
  495.   #endif                          /* BN_RECURSION */
  496.   
  497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
  497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                       ^
  500.   
  501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `*a->d`
    505.   }
    506.   
    507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    508.   {
    509.       int ret = 0;

crypto/bn/bn_mul.c:587:17: Call
    585.                   if (bn_wexpand(rr, k * 4) == NULL)
    586.                       goto err;
    587.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    588.                                         j, al - j, bl - j, t->d);
    589.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
      320.    */
      321.   /* tnX may not be negative but less than n */
      322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      323.                              int tna, int tnb, BN_ULONG *t)
      324.   {

crypto/bn/bn_mul.c:335:10: Call
      333.   
      334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
                      ^
      336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
      337.       neg = 0;

crypto/bn/bn_lib.c:706:1: Parameter `cl`
        704.    */
        705.   
        706. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        707.   {
        708.       int n, i;

crypto/bn/bn_lib.c:723:12: Call
        721.           }
        722.       }
        723.       return bn_cmp_words(a, b, cl);
                          ^
        724.   }
        725.   

crypto/bn/bn_lib.c:679:1: <Offset trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `n`
          677.   }
          678.   
          679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          680.   {
          681.       int i;

crypto/bn/bn_lib.c:688:10: Assignment
          686.       if (aa != bb)
          687.           return ((aa > bb) ? 1 : -1);
          688.       for (i = n - 2; i >= 0; i--) {
                          ^
          689.           aa = a[i];
          690.           bb = b[i];

crypto/bn/bn_lib.c:679:1: <Length trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `*b`
          677.   }
          678.   
          679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          680.   {
          681.       int i;

crypto/bn/bn_lib.c:690:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
          688.       for (i = n - 2; i >= 0; i--) {
          689.           aa = a[i];
          690.           bb = b[i];
                              ^
          691.           if (aa != bb)
          692.               return ((aa > bb) ? 1 : -1);
