crypto/bn/bn_gf2m.c:908: 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:902:8: Call
900.   	bn_check_top(p);
901.   	if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
902.   	ret = BN_GF2m_poly2arr(p, arr, max);
              ^
903.   	if (!ret || ret > max)
904.   		{

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

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

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

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

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