tests: Add example where new Algorithm should fail

This formula is not aconjunctive and should be wrongly declared as
satisfiable by the algorithm that assumes aconjunctivity.

This doesn't work right now: The new algorithm also answers with
"unsat".

src/testsuite/cool-testsuite.ml

@@ -56,6 +56,7 @@ let aconjunctive_testcases: satCheck list =
   ; c Unsat "ν x. ν y. ([r] x & <r> y & False)"
   (* These formulas aren't *)
   ; c Unsat "μ x. μ y. ([r] x & <r> y)"
+  ; c Unsat "(ν x. (<r> True & [r] x)) & (μ x. ((p0 | [r] x) & (~p0 | [r] x)))"
   ]
 
 let nominal_testcases =