BinaryRecurrenceSequence is not throwing an error when there is not a simple period.
For instance, the sequence given by S = BinaryRecurrenceSequence(3,2,u0=0,u1=1) considered mod 4 has terms when considered individually: 0, 1, 3, 3, 3, ..... It does (eventually) have a period, it's just not a simple one.
When, however I try S.period(4), sagemath just stops working without throwing an error and I have to kill the kernel. Is there a method to test whether there are non-simple periods, or which otherwise picks up on sequences like this?
Often I run scripts over multiple sequences with different values for the coefficients, so it's not a case of being able to test each sequence in turn whether there will be an issue.
