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


crypto/bn/bn_prime.c:363:8: Call
361.   	while (--k)
362.   		{
363.   		if (!BN_mod_mul(w, w, w, a, ctx)) /* w := w^2 mod a */
              ^
364.   			return -1;
365.   		if (BN_is_one(w))

crypto/bn/bn_mod.c:178:1: Parameter `r->top`
  176.   
  177.   /* slow but works */
  178. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  179.   	BN_CTX *ctx)
  180.   	{

crypto/bn/bn_prime.c:368:7: Call
366.   			return 1; /* 'a' is composite, otherwise a previous 'w' would
367.   			           * have been == -1 (mod 'a') */
368.   		if (BN_cmp(w, a1) == 0)
             ^
369.   			return 0; /* w == -1 (mod a), 'a' is probably prime */
370.   		}

crypto/bn/bn_lib.c:678:1: <LHS trace>
676.   	}
677.   
678. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
679.   	{
680.   	int i;

crypto/bn/bn_lib.c:678:1: Parameter `a->top`
  676.   	}
  677.   
  678. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
  679.   	{
  680.   	int i;

crypto/bn/bn_lib.c:709:7: Binary operation: ([0, +oo] - 1):unsigned64 by call to `BN_cmp` 
  707.   	if (a->top > b->top) return(gt);
  708.   	if (a->top < b->top) return(lt);
  709.   	for (i=a->top-1; i>=0; i--)
               ^
  710.   		{
  711.   		t1=a->d[i];
