feat: assert that there is at most one ELIF/ELSE

Author: ibbem

src/main/java/org/variantsync/diffdetective/variation/diff/DiffNode.java

@@ -747,6 +747,14 @@ public void assertConsistency() {
             });
         }
 
+        // check that there is at most one ELIF/ELSE
+        Time.forAll(time ->
+            Assert.assertTrue(
+                getChildOrder(time).stream().filter(c -> c.isElif() || c.isElse()).count() <= 1,
+                "There is more than one ELIF/ELSE node"
+            )
+        );
+
         final DiffNode<L> pb = getParent(BEFORE);
         final DiffNode<L> pa = getParent(AFTER);
 

src/main/java/org/variantsync/diffdetective/variation/tree/VariationNode.java

@@ -537,6 +537,12 @@ public void assertConsistency() {
                 "The root has to have the feature mapping 'true'");
         }
 
+        // check that there is at most one ELIF/ELSE
+        Assert.assertTrue(
+            getChildren().stream().filter(c -> c.isElif() || c.isElse()).count() <= 1,
+            "There is more than one ELIF/ELSE node"
+        );
+
         // check consistency of children lists and edges
         for (var child : getChildren()) {
             Assert.assertTrue(