No, nothing is lost, I just want to get the small ones done first.

As a random example (edited for brevity):

Code:

Starting factorization of 14156161707358647804728644991232561131993674306133067594227858606703236064990613537256494257288902246641757583573171692305069299841687536
div: found prime factor = 2
div: found prime factor = 2
div: found prime factor = 2
div: found prime factor = 2
div: found prime factor = 3
div: found prime factor = 271
div: found prime factor = 1831
scheduled 30 curves at B1=2000 toward target pretesting depth of 43.00
prp13 = 2893511660873 (curve 4 stg2 B1=2000 sigma=303770396 thread=0)
Finished 4 curves using Lenstra ECM method on C129 input, B1=2K, B2=gmp-ecm default
Finished 26 curves using Lenstra ECM method on C117 input, B1=2K, B2=gmp-ecm default
Finished 74 curves using Lenstra ECM method on C117 input, B1=11K, B2=gmp-ecm default
Finished 216 curves using Lenstra ECM method on C117 input, B1=50K, B2=gmp-ecm default
pm1: starting B1 = 3750K, B2 = gmp-ecm default on C117
prp29 = 32895160657610218397548809017 (curve 40 stg2 B1=250000 sigma=303537196 thread=0)
Finished 240 curves using Lenstra ECM method on C117 input, B1=250K, B2=gmp-ecm default
prp28 = 3347338785154139067312669731 (curve 30 stg2 B1=250000 sigma=1688092289 thread=2)
Finished 180 curves using Lenstra ECM method on C88 input, B1=250K, B2=gmp-ecm default
final ECM pretested depth: 30.44
c61 cofactor = 1865476249140792141927330175598826930439956399426237147045167
Total factoring time = 90.5932 seconds

We end up with a c61 at the end which would take not even a second to to split into p30+p32, but with the

pretest option enabled siqs can't run. I would like it to be allowed to run for "small" numbers (according to the parameter I specify) but not run for larger numbers (e.g. I'll come back and deal with those later, or on a different machine).