diff --git a/subprojects/common/analysis/src/main/java/hu/bme/mit/theta/analysis/algorithm/ArgStructuralEquality.java b/subprojects/common/analysis/src/main/java/hu/bme/mit/theta/analysis/algorithm/ArgStructuralEquality.java
index ab6821cca0..c9d7bf3a3e 100644
--- a/subprojects/common/analysis/src/main/java/hu/bme/mit/theta/analysis/algorithm/ArgStructuralEquality.java
+++ b/subprojects/common/analysis/src/main/java/hu/bme/mit/theta/analysis/algorithm/ArgStructuralEquality.java
@@ -19,8 +19,6 @@
import hu.bme.mit.theta.analysis.Action;
import hu.bme.mit.theta.analysis.State;
-import java.util.LinkedHashMap;
-import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
@@ -33,13 +31,11 @@
* An ARG is uniquely identifiable using its leaf nodes.
* An ArgTrace is uniquely identifiable using its last node.
*
- * We perform caching for the hash codes, but equals() checks will always traverse the ancestors of
- * a node (and edge). However, this traversal only goes towards the root, rather than in all
- * directions.
+ * We don't perform caching for the hash codes, and equals() checks will always traverse the
+ * ancestors of a node (and edge). However, this traversal only goes towards the root, rather than
+ * in all directions.
*/
public final class ArgStructuralEquality {
- private static final Map