python: remove uninformative headers

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgBasicBlockAnnotationGap.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of BasicBlockAnnotationGap.
  *
- * Original:
  * Checks that within a basic block, if a node is annotated then its
  * successor is also annotated (or excluded). A gap in annotations
  * within a basic block indicates a missing annotation, since there

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgBasicBlockOrdering.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of BasicBlockOrdering.
  *
- * Original:
  * Checks that within a single basic block, annotations appear in
  * increasing minimum-timestamp order.
  */

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgConsecutiveTimestamps.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of ConsecutiveTimestamps.
  *
- * Original:
  * Checks that consecutive annotated nodes have consecutive timestamps:
  * for each annotation with timestamp `a`, some CFG node for that annotation
  * must have a next annotation containing `a + 1`.

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgNeverReachable.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of NeverReachable.
  *
- * Original:
  * Checks that expressions annotated with `t.never` either have no CFG
  * node, or if they do, that the node is not reachable from its scope's
  * entry (including within the same basic block).

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgNoBackwardFlow.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of NoBackwardFlow.
  *
- * Original:
  * Checks that time never flows backward between consecutive timer annotations
  * in the CFG. For each pair of consecutive annotated nodes (A -> B), there must
  * exist timestamps a in A and b in B with a < b.

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgNoSharedReachable.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of NoSharedReachable.
  *
- * Original:
  * Checks that two annotations sharing a timestamp value are on
  * mutually exclusive CFG paths (neither can reach the other).
  */

python/ql/test/library-tests/ControlFlow/evaluation-order/NewCfgStrictForward.ql

@@ -1,7 +1,6 @@
 /**
  * New-CFG version of StrictForward.
  *
- * Original:
  * Stronger version of NoBackwardFlow: for consecutive annotated nodes
  * A -> B that both have a single timestamp (non-loop code) and B does
  * NOT dominate A (forward edge), requires max(A) < min(B).