!7

p-experiment {
  for (Pair<S> p : katzeLog_pairsCloseInTime()) {
    S s = longestCommonSubstring(p.a, p.b);
    if (empty(s)) continue;
    print(s + ": " + a + " -> " + b);
  }
}