crypto/bn/bn_gf2m.c:944: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_solve_quad_arr`.
Showing all 8 steps of the trace


crypto/bn/bn_gf2m.c:939:6: Call
937.   	unsigned int *arr=NULL, ret = 0;
938.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
939.   	if (BN_GF2m_poly2arr(p, arr, max) > max)
            ^
940.   		{
941.   		BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD,BN_R_INVALID_LENGTH);

crypto/bn/bn_gf2m.c:955:1: Parameter `*p`
  953.    * number of coefficients that would be extracted if array was large enough.
  954.    */
  955. > int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max)
  956.   	{
  957.   	int i, j, k;

crypto/bn/bn_gf2m.c:944:8: Call
942.   		goto err;
943.   		}
944.   	ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
              ^
945.     err:
946.   	if (arr) OPENSSL_free(arr);

crypto/bn/bn_gf2m.c:854:1: <LHS trace>
852.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
853.    */
854. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
855.   	{
856.   	int ret = 0, count = 0;

crypto/bn/bn_gf2m.c:854:1: Parameter `*p`
  852.    * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
  853.    */
  854. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
  855.   	{
  856.   	int ret = 0, count = 0;

crypto/bn/bn_gf2m.c:866:7: Call
  864.   	if (w == NULL) goto err;
  865.   
  866.   	if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
               ^
  867.   	
  868.   	if (BN_is_zero(a))

crypto/bn/bn_gf2m.c:320:1: Parameter `*p`
    318.   
    319.   /* Performs modular reduction of a and store result in r.  r could be a. */
    320. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[])
    321.   	{
    322.   	int j, k;

crypto/bn/bn_gf2m.c:878:15: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_solve_quad_arr` 
  876.   		/* compute half-trace of a */
  877.   		if (!BN_copy(z, a)) goto err;
  878.   		for (j = 1; j <= (p[0] - 1) / 2; j++)
                       ^
  879.   			{
  880.   			if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
