#include "test_helpers.h"
#include <math.h>
#include "ulong_extras.h"
#include "nmod_vec.h"
#include "fmpz.h"
TEST_FUNCTION_START(fmpz_is_prime_morrison, state)
{
int i, result;
for (i = 0; i < 30 * flint_test_multiplier(); i++)
{
fmpz_t p, F, R;
nn_ptr pp1;
slong num_pp1;
double logd;
ulong limit;
fmpz_init(p);
fmpz_init(F);
fmpz_init(R);
do {
fmpz_randbits(p, state, n_randint(state, 330) + 2);
fmpz_abs(p, p);
} while (!fmpz_is_probabprime(p) || fmpz_cmp_ui(p, 2) == 0);
logd = log(fmpz_get_d(p));
limit = (ulong) (logd*logd*logd/10.0) + 2;
pp1 = _nmod_vec_init((ulong) logd + 2);
_fmpz_np1_trial_factors(p, pp1, &num_pp1, limit);
result = fmpz_is_prime_morrison(F, R, p, pp1, num_pp1);
if (!result)
{
flint_printf("FAIL:\n");
fmpz_print(p); printf("\n");
fflush(stdout);
flint_abort();
}
_nmod_vec_clear(pp1);
fmpz_clear(p);
fmpz_clear(F);
fmpz_clear(R);
}
TEST_FUNCTION_END(state);
}