crypto/ec/ec_asn1.c:884: error: INTEGER_OVERFLOW_L2
  ([-oo, 9223372036854775807] + 1):signed32 by call to `EC_GROUP_new_from_ecpkparameters`.
Showing all 8 steps of the trace


crypto/ec/ec_asn1.c:884:18: Call
882.       }
883.   
884.       if ((group = EC_GROUP_new_from_ecpkparameters(params)) == NULL) {
                        ^
885.           ECerr(EC_F_D2I_ECPKPARAMETERS, EC_R_PKPARAMETERS2GROUP_FAILURE);
886.           ECPKPARAMETERS_free(params);

crypto/ec/ec_asn1.c:834:1: Parameter `params->value.parameters->fieldID->p.char_two->m`
  832.   }
  833.   
  834. > EC_GROUP *EC_GROUP_new_from_ecpkparameters(const ECPKPARAMETERS *params)
  835.   {
  836.       EC_GROUP *ret = NULL;

crypto/ec/ec_asn1.c:854:15: Call
  852.       } else if (params->type == 1) { /* the parameters are given by a
  853.                                        * ECPARAMETERS structure */
  854.           ret = EC_GROUP_new_from_ecparameters(params->value.parameters);
                       ^
  855.           if (!ret) {
  856.               ECerr(EC_F_EC_GROUP_NEW_FROM_ECPKPARAMETERS, ERR_R_EC_LIB);

crypto/ec/ec_asn1.c:600:1: Parameter `params->fieldID->p.char_two->m`
    598.   }
    599.   
    600. > EC_GROUP *EC_GROUP_new_from_ecparameters(const ECPARAMETERS *params)
    601.   {
    602.       int ok = 0, tmp;

crypto/ec/ec_asn1.c:679:18: Call
    677.               if (!BN_set_bit(p, (int)char_two->m))
    678.                   goto err;
    679.               if (!BN_set_bit(p, (int)tmp_long))
                            ^
    680.                   goto err;
    681.               if (!BN_set_bit(p, 0))

crypto/bn/bn_lib.c:616:1: <LHS trace>
614.   }
615.   
616. > int BN_set_bit(BIGNUM *a, int n)
617.   {
618.       int i, j, k;

crypto/bn/bn_lib.c:616:1: Parameter `a->top`
      614.   }
      615.   
      616. > int BN_set_bit(BIGNUM *a, int n)
      617.   {
      618.       int i, j, k;

crypto/bn/bn_lib.c:628:37: Binary operation: ([-oo, 9223372036854775807] + 1):signed32 by call to `EC_GROUP_new_from_ecpkparameters` 
      626.           if (bn_wexpand(a, i + 1) == NULL)
      627.               return 0;
      628.           for (k = a->top; k < i + 1; k++)
                                                 ^
      629.               a->d[k] = 0;
      630.           a->top = i + 1;
