crypto/ec/ecdh_ossl.c:136: error: BUFFER_OVERRUN_L3
  Offset: [32, +oo] Size: [0, 8388607] by call to `BN_mul`.
Showing all 11 steps of the trace


crypto/ec/ecdh_ossl.c:135:14: Call
133.   
134.       if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {
135.           if (!EC_GROUP_get_cofactor(group, x, NULL) ||
                    ^
136.               !BN_mul(x, x, priv_key, ctx)) {
137.               ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);

crypto/ec/ec_lib.c:380:1: Parameter `cofactor->d`
  378.   }
  379.   
  380. > int EC_GROUP_get_cofactor(const EC_GROUP *group, BIGNUM *cofactor,
  381.                             BN_CTX *ctx)
  382.   {

crypto/ec/ecdh_ossl.c:136:14: Call
134.       if (EC_KEY_get_flags(ecdh) & EC_FLAG_COFACTOR_ECDH) {
135.           if (!EC_GROUP_get_cofactor(group, x, NULL) ||
136.               !BN_mul(x, x, priv_key, ctx)) {
                    ^
137.               ECerr(EC_F_ECDH_SIMPLE_COMPUTE_KEY, ERR_R_MALLOC_FAILURE);
138.               goto err;

crypto/bn/bn_mul.c:882:1: Parameter `a->top`
  880.   #endif                          /* BN_RECURSION */
  881.   
  882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  883.   {
  884.       int ret = 0;

crypto/bn/bn_mul.c:899:5: Assignment
  897.       bn_check_top(r);
  898.   
  899.       al = a->top;
             ^
  900.       bl = b->top;
  901.   

crypto/bn/bn_mul.c:971:17: Call
  969.                   if (bn_wexpand(rr, k * 2) == NULL)
  970.                       goto err;
  971.                   bn_mul_recursive(rr->d, a->d, b->d, j, al - j, bl - j, t->d);
                         ^
  972.               }
  973.               rr->top = top;

crypto/bn/bn_mul.c:386:1: <Offset trace>
384.    */
385.   /* dnX may not be positive, but n2/2+dnX has to be */
386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
387.                         int dna, int dnb, BN_ULONG *t)
388.   {

crypto/bn/bn_mul.c:386:1: Parameter `n2`
    384.    */
    385.   /* dnX may not be positive, but n2/2+dnX has to be */
    386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
    387.                         int dna, int dnb, BN_ULONG *t)
    388.   {

crypto/bn/bn_mul.c:386:1: <Length trace>
384.    */
385.   /* dnX may not be positive, but n2/2+dnX has to be */
386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
387.                         int dna, int dnb, BN_ULONG *t)
388.   {

crypto/bn/bn_mul.c:386:1: Parameter `*t`
    384.    */
    385.   /* dnX may not be positive, but n2/2+dnX has to be */
    386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
    387.                         int dna, int dnb, BN_ULONG *t)
    388.   {

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