diff --git a/.verify-helper/timestamps.remote.json b/.verify-helper/timestamps.remote.json
index 4e8f9fcb..1c285d10 100644
--- a/.verify-helper/timestamps.remote.json
+++ b/.verify-helper/timestamps.remote.json
@@ -8,7 +8,7 @@
 "tests/library_checker_aizu_tests/data_structures/bit.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/bit_inc.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/bit_inc_walk.test.cpp": "2026-07-10 20:39:22 -0700",
-"tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/data_structures/bit_rupq.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/bit_rurq.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/data_structures/bit_walk.test.cpp": "2026-07-10 20:39:22 -0700",
@@ -22,14 +22,14 @@
 "tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp": "2026-07-07 10:02:09 -0700",
 "tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp": "2026-07-07 10:02:09 -0700",
 "tests/library_checker_aizu_tests/data_structures/kd_bit_1d.test.cpp": "2026-07-06 13:10:16 -0700",
-"tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/data_structures/kth_smallest_wavelet_matrix.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp": "2026-07-06 13:10:16 -0700",
 "tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc_constructor.test.cpp": "2026-07-06 13:10:16 -0700",
 "tests/library_checker_aizu_tests/data_structures/merge_sort_tree.test.cpp": "2026-07-06 13:10:16 -0700",
-"tests/library_checker_aizu_tests/data_structures/mode_query.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/data_structures/mode_query.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/data_structures/permutation_tree.test.cpp": "2026-07-09 23:01:31 -0500",
 "tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp": "2026-07-07 10:02:09 -0700",
 "tests/library_checker_aizu_tests/data_structures/persistent_seg_tree.test.cpp": "2026-07-07 10:02:09 -0700",
@@ -49,9 +49,9 @@
 "tests/library_checker_aizu_tests/dsu/dsu_bipartite.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/dsu/dsu_weighted_aizu.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/dsu/dsu_weighted_lib_checker.test.cpp": "2026-07-07 12:06:00 -0700",
-"tests/library_checker_aizu_tests/dsu/kruskal_tree_aizu.test.cpp": "2026-07-12 10:49:50 -0700",
+"tests/library_checker_aizu_tests/dsu/kruskal_tree_aizu.test.cpp": "2026-07-19 14:11:46 -0700",
 "tests/library_checker_aizu_tests/dsu/line_tree_aizu.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/dsu/line_tree_lib_checker.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/dsu/line_tree_lib_checker.test.cpp": "2026-07-19 14:11:46 -0700",
 "tests/library_checker_aizu_tests/dsu/range_parallel_dsu.test.cpp": "2026-07-09 23:01:31 -0500",
 "tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2026-04-06 14:41:55 -0600",
@@ -74,7 +74,7 @@
 "tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-07-07 12:06:00 -0700",
-"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2026-07-07 12:06:00 -0700",
@@ -82,7 +82,7 @@
 "tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/kd_bit.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/kth_par.test.cpp": "2026-07-10 20:39:22 -0700",
-"tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-07-19 14:11:46 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2026-07-07 12:06:00 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/mod_division.test.cpp": "2026-07-08 09:28:48 -0700",
@@ -119,15 +119,15 @@
 "tests/library_checker_aizu_tests/strings/lcp_array.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/strings/lcp_query_palindrome.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/strings/lcp_query_zfunc.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/lcs_dp.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/lcs_queries.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/lcs_queries_merge_sort_tree.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/manacher.test.cpp": "2026-07-12 10:49:50 -0700",
+"tests/library_checker_aizu_tests/strings/lcs_dp.test.cpp": "2026-07-19 14:11:46 -0700",
+"tests/library_checker_aizu_tests/strings/lcs_queries.test.cpp": "2026-07-19 14:11:46 -0700",
+"tests/library_checker_aizu_tests/strings/lcs_queries_merge_sort_tree.test.cpp": "2026-07-19 14:11:46 -0700",
+"tests/library_checker_aizu_tests/strings/manacher.test.cpp": "2026-07-19 14:11:46 -0700",
 "tests/library_checker_aizu_tests/strings/multi_matching_bs.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/strings/prefix_function.test.cpp": "2026-07-06 13:10:16 -0700",
 "tests/library_checker_aizu_tests/strings/sa_cmp.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/strings/single_matching_bs.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp": "2026-07-19 14:36:01 -0700",
+"tests/library_checker_aizu_tests/strings/single_matching_bs.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/strings/suffix_array.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/strings/suffix_array_short.test.cpp": "2026-07-12 12:50:20 -0700",
 "tests/library_checker_aizu_tests/strings/trie.test.cpp": "2026-07-06 13:10:16 -0700",
@@ -142,12 +142,12 @@
 "tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp": "2026-07-10 20:39:22 -0700",
 "tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp": "2026-07-10 20:39:22 -0700",
-"tests/library_checker_aizu_tests/trees/kth_path_hagerup.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/trees/kth_path_hagerup.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/trees/kth_path_ladder.test.cpp": "2026-07-09 23:01:31 -0500",
 "tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp": "2026-07-10 20:39:22 -0700",
-"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-07-12 12:50:20 -0700",
-"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-07-12 12:50:20 -0700",
+"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-07-19 14:36:01 -0700",
+"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-07-19 14:36:01 -0700",
+"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-07-19 14:36:01 -0700",
 "tests/library_checker_aizu_tests/trees/shallowest_aizu_tree_height.test.cpp": "2026-07-07 09:27:22 -0700",
 "tests/library_checker_aizu_tests/trees/shallowest_lib_checker_tree_path_composite.test.cpp": "2026-07-07 09:27:22 -0700",
 "tests/library_checker_aizu_tests/trees/subtree_isomorphism.test.cpp": "2026-07-07 09:27:22 -0700"
diff --git a/library/dsu/kruskal_tree.hpp b/library/dsu/kruskal_tree.hpp
index 55f49f99..18beb231 100644
--- a/library/dsu/kruskal_tree.hpp
+++ b/library/dsu/kruskal_tree.hpp
@@ -1,6 +1,7 @@
 #pragma once
 //! https://mzhang2021.github.io/cp-blog/kruskal/
-//! requires n >= 1 (2*n-1 allocation underflows when n == 0)
+//! requires n >= 1 (2*n-1 allocation underflows when n ==
+//! 0)
 //! @time O(n log n)
 //! @space O(n)
 struct kr_tree {
diff --git a/library/strings/longest_common_subsequence/lcs_dp.hpp b/library/strings/longest_common_subsequence/lcs_dp.hpp
index 1892c709..ba6eafe0 100644
--- a/library/strings/longest_common_subsequence/lcs_dp.hpp
+++ b/library/strings/longest_common_subsequence/lcs_dp.hpp
@@ -10,7 +10,9 @@
 template<class T> struct lcs_dp {
   T t;
   vi dp;
-  lcs_dp(const T& t): t(t), dp(sz(t)) { ranges::iota(dp, 0); }
+  lcs_dp(const T& t): t(t), dp(sz(t)) {
+    ranges::iota(dp, 0);
+  }
   void push_onto_s(int c) {
     int v = -1;
     rep(i, 0, sz(t)) if (c == t[i] || dp[i] < v)
diff --git a/library/strings/manacher/manacher.hpp b/library/strings/manacher/manacher.hpp
index 10ea292c..bb9d38ff 100644
--- a/library/strings/manacher/manacher.hpp
+++ b/library/strings/manacher/manacher.hpp
@@ -14,7 +14,8 @@
 //! string b a a b a
 //! center  1 3 5 7
 //!
-//! requires n >= 1 (2*n-1 allocation underflows when n == 0)
+//! requires n >= 1 (2*n-1 allocation underflows when n ==
+//! 0)
 //! @time O(n)
 //! @space O(n)
 vi manacher(const auto& s) {
diff --git a/tests/.config/.cppcheck_suppression_list b/tests/.config/.cppcheck_suppression_list
index 49d1b2cf..fd9aef02 100644
--- a/tests/.config/.cppcheck_suppression_list
+++ b/tests/.config/.cppcheck_suppression_list
@@ -39,9 +39,9 @@ syntaxError:../library/loops/submasks.hpp:8
 syntaxError:../library/loops/supermasks.hpp:8
 syntaxError:../library/math/prime_sieve/mobius.hpp:6
 syntaxError:../library/trees/lca_rmq/iterate_subtree.hpp:6
-knownConditionTrueFalse:../library/strings/suffix_array/suffix_array.hpp:62
-knownConditionTrueFalse:../library/strings/suffix_array/suffix_array_short.hpp:34
-knownConditionTrueFalse:../library/dsu/kruskal_tree.hpp:13
+knownConditionTrueFalse:../library/strings/suffix_array/suffix_array.hpp:63
+knownConditionTrueFalse:../library/strings/suffix_array/suffix_array_short.hpp:35
+knownConditionTrueFalse:../library/dsu/kruskal_tree.hpp:15
 knownConditionTrueFalse:../library/dsu/dsu.hpp:11
 knownConditionTrueFalse:../library/dsu/dsu_weighted.hpp:29
 constVariable:../kactl/content/numerical/NumberTheoreticTransform.h:30
@@ -62,3 +62,9 @@ unusedFunction:../kactl/stress-tests/utilities/genTree.h:49
 containerOutOfBounds:../library/data_structures_[l,r)/uncommon/permutation_tree.hpp:85
 ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/bit.hpp:12
 ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/lazy_seg_tree.hpp:4
+mismatchingContainerExpression:../library/trees/extra_members/virtual_tree.hpp:19
+mismatchingContainerExpression:library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp:20
+mismatchingContainerExpression:library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp:13
+mismatchingContainerExpression:library_checker_aizu_tests/data_structures/mode_query.test.cpp:13
+mismatchingContainerExpression:library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp:13
+mismatchingContainerExpression:library_checker_aizu_tests/strings/single_matching_bs.test.cpp:73
diff --git a/tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp
index 0f5ee379..1bf99923 100644
--- a/tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp
+++ b/tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp
@@ -17,7 +17,8 @@ int main() {
     compress.push_back(x);
   }
   ranges::sort(compress);
-  compress.erase(begin(ranges::unique(compress)), end(compress));
+  compress.erase(begin(ranges::unique(compress)),
+    end(compress));
   BIT bit(sz(compress));
   auto get_compressed_idx = [&](int val) -> int {
     int l = 0, r = sz(compress);
diff --git a/tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp b/tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp
index 7a9a3ba5..f2e92d05 100644
--- a/tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp
+++ b/tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp
@@ -10,7 +10,8 @@ int main() {
   for (int& x : arr) cin >> x;
   vi compress(arr);
   ranges::sort(compress);
-  compress.erase(begin(ranges::unique(compress)), end(compress));
+  compress.erase(begin(ranges::unique(compress)),
+    end(compress));
   for (int& x : arr) {
     int l = -1, r = int(sz(compress));
     while (r - l > 1) {