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


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: Parameter `r->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:759:9: Call
757.   		if (BN_is_bit_set(b, i))
758.   			{
759.   			if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx)) goto err;
               ^
760.   			}
761.   		}

crypto/bn/bn_gf2m.c:384:1: Parameter `a->top`
  382.    * the result in r.  r could be a or b; a could be b.
  383.    */
  384. > int	BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const int p[], BN_CTX *ctx)
  385.   	{
  386.   	int zlen, i, j, k, ret = 0;

crypto/bn/bn_gf2m.c:395:10: Call
  393.   	if (a == b)
  394.   		{
  395.   		return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                  ^
  396.   		}
  397.   

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_mul_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]);
