Basic idea:
Pick a fixed number of prime registers, say 1 to 10.
Randomly generate exponents in the numerators/denominators.
Run it for up to 100 steps w/o cycle detection. Run it for 1..10-length cycle detection and for each, verify the steps listed in the cycle detected result match the manual run. If it cycle detects an infinite loop, verify it by checking the logic registers one cycle forward. Last part is important because the self interpeters both failed by way of infinite loop.
Rinse and repeat. Run this overnight or whatever. Make sure to simulate a failure and check that it actually reports what input failed correctly so I don't waste my CPU.
Basic idea:
Pick a fixed number of prime registers, say 1 to 10.
Randomly generate exponents in the numerators/denominators.
Run it for up to 100 steps w/o cycle detection. Run it for 1..10-length cycle detection and for each, verify the steps listed in the cycle detected result match the manual run. If it cycle detects an infinite loop, verify it by checking the logic registers one cycle forward. Last part is important because the self interpeters both failed by way of infinite loop.
Rinse and repeat. Run this overnight or whatever. Make sure to simulate a failure and check that it actually reports what input failed correctly so I don't waste my CPU.