crypto/ec/ecdh_ossl.c:69: error: BUFFER_OVERRUN_L3
  Offset: [32, +oo] Size: [0, 8388607] by call to `BN_mul`.
Showing all 13 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 `*r->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->top`
    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:524:5: Assignment
    522.       bn_check_top(r);
    523.   
    524.       al = a->top;
               ^
    525.       bl = b->top;
    526.   

crypto/bn/bn_mul.c:595:17: Call
    593.                   if (bn_wexpand(rr, k * 2) == NULL)
    594.                       goto err;
    595.                   bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
                           ^
    596.               }
    597.               rr->top = top;

crypto/bn/bn_mul.c:175:1: <Offset trace>
173.    */
174.   /* dnX may not be positive, but n2/2+dnX has to be */
175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
176.                         int dna, int dnb, BN_ULONG *t)
177.   {

crypto/bn/bn_mul.c:175:1: Parameter `n2`
      173.    */
      174.   /* dnX may not be positive, but n2/2+dnX has to be */
      175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      176.                         int dna, int dnb, BN_ULONG *t)
      177.   {

crypto/bn/bn_mul.c:175:1: <Length trace>
173.    */
174.   /* dnX may not be positive, but n2/2+dnX has to be */
175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
176.                         int dna, int dnb, BN_ULONG *t)
177.   {

crypto/bn/bn_mul.c:175:1: Parameter `*t`
      173.    */
      174.   /* dnX may not be positive, but n2/2+dnX has to be */
      175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      176.                         int dna, int dnb, BN_ULONG *t)
      177.   {

crypto/bn/bn_mul.c:266:9: Array access: Offset: [32, +oo] Size: [0, 8388607] by call to `BN_mul` 
      264.   # endif                         /* BN_MUL_COMBA */
      265.       {
      266.           p = &(t[n2 * 2]);
                     ^
      267.           if (!zero)
      268.               bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
