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


crypto/bn/bn_gf2m.c:751:7: Call
749.   	if ((u = BN_CTX_get(ctx)) == NULL) goto err;
750.   	
751.   	if (!BN_GF2m_mod_arr(u, a, p)) goto err;
             ^
752.   	
753.   	n = BN_num_bits(b) - 1;

crypto/bn/bn_gf2m.c:261:1: Parameter `r->top`
  259.   
  260.   /* Performs modular reduction of a and store result in r.  r could be a. */
  261. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
  262.   	{
  263.   	int j, k;

crypto/bn/bn_gf2m.c:756:8: Call
754.   	for (i = n - 1; i >= 0; i--)
755.   		{
756.   		if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx)) goto err;
              ^
757.   		if (BN_is_bit_set(b, i))
758.   			{

crypto/bn/bn_gf2m.c:461:1: <LHS trace>
459.   
460.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
461. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
462.   	{
463.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:461:1: Parameter `a->top`
  459.   
  460.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  461. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
  462.   	{
  463.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:471:7: Binary operation: ([0, +oo] - 1):unsigned64 by call to `BN_GF2m_mod_sqr_arr` 
  469.   	if (!bn_wexpand(s, 2 * a->top)) goto err;
  470.   
  471.   	for (i = a->top - 1; i >= 0; i--)
               ^
  472.   		{
  473.   		s->d[2*i+1] = SQR1(a->d[i]);
