Now one step in the debugger removes exactly one element from the queue
(if it's not empty). If this action empties the queue, nominals are
propagated.

This fixes an assertion that failed for the PML+K formula

   sat "({>= 3/5} (False + <R1> True & <R2> True) & {>= 2/5} ({>= 1/10} p0 & {>= 1/10} (~ p0) + False ) + False)"

which is satisfiable.

The actual box of PML (in GMLMIP) is: less probable than. The Diamond
is: At least Probable than.

So now you have ¬[p] C = <p> C.