crypto/bn/bn_gf2m.c:864: 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:858:8: Call
856.   	unsigned int *arr=NULL, ret = 0;
857.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
858.   	ret = BN_GF2m_poly2arr(p, arr, max);
              ^
859.   	if (!ret || ret > max)
860.   		{

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

crypto/bn/bn_gf2m.c:864:8: Call
862.   		goto err;
863.   		}
864.   	ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
              ^
865.   	bn_check_top(r);
866.     err:

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

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

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