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


crypto/bn/bn_gf2m.c:899:8: Call
897.   	bn_check_top(p);
898.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
899.   	ret = BN_GF2m_poly2arr(p, arr, max);
              ^
900.   	if (!ret || ret > max)
901.   		{

crypto/bn/bn_gf2m.c:1030:1: Parameter `*p`
  1028.    * number of coefficients that would be extracted if array was large enough.
  1029.    */
  1030. > int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max)
  1031.   	{
  1032.   	int i, j, k = 0;

crypto/bn/bn_gf2m.c:905:8: Call
903.   		goto err;
904.   		}
905.   	ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
              ^
906.   	bn_check_top(r);
907.   err:

crypto/bn/bn_gf2m.c:860:1: <LHS trace>
858.    * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
859.    */
860. > int	BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
861.   	{
862.   	int ret = 0;

crypto/bn/bn_gf2m.c:860:1: Parameter `*p`
  858.    * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
  859.    */
  860. > int	BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
  861.   	{
  862.   	int ret = 0;

crypto/bn/bn_gf2m.c:875:7: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqrt_arr` 
  873.   	
  874.   	if (!BN_zero(u)) goto err;
  875.   	if (!BN_set_bit(u, p[0] - 1)) goto err;
               ^
  876.   	ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
  877.   	bn_check_top(r);
