 This logic fits the sabotage game closely. On top, it is a natural fragment of the first-order language of graphs. Surprisingly, this logic is undecidable (Löding &amp; Rohde 2003), making it one of the simplest examples of an undecidable modal logic over arbitrary models.