diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2
new file mode 100644
index 000000000..bad938003
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_0.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2
new file mode 100644
index 000000000..c9c9e879d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_1.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2
new file mode 100644
index 000000000..c4c1d6854
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_10.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2
new file mode 100644
index 000000000..4aeff7e22
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_100.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2
new file mode 100644
index 000000000..d7b849dfb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_101.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2
new file mode 100644
index 000000000..56889e611
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_102.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2
new file mode 100644
index 000000000..0cce11290
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_103.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2
new file mode 100644
index 000000000..ac22612ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_104.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2
new file mode 100644
index 000000000..b3b516d08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_105.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2
new file mode 100644
index 000000000..e4e17ffb9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_106.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2
new file mode 100644
index 000000000..bb23295ad
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_107.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2
new file mode 100644
index 000000000..61a187a28
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_108.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2
new file mode 100644
index 000000000..eaa24c7d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_109.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2
new file mode 100644
index 000000000..12763c364
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_11.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2
new file mode 100644
index 000000000..f67291155
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_110.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2
new file mode 100644
index 000000000..5e1622325
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_111.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2
new file mode 100644
index 000000000..a53d6d1f8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_112.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2
new file mode 100644
index 000000000..c0227a03d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_113.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2
new file mode 100644
index 000000000..b208a9135
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_114.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2
new file mode 100644
index 000000000..4dfc3327c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_115.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2
new file mode 100644
index 000000000..9107834e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_116.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2
new file mode 100644
index 000000000..675080f40
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_117.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2
new file mode 100644
index 000000000..eae4f0b5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_118.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2
new file mode 100644
index 000000000..a5eb030ba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_119.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2
new file mode 100644
index 000000000..f6ad2bcb9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_12.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2
new file mode 100644
index 000000000..84d6f060c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_120.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2
new file mode 100644
index 000000000..6651d6de4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_121.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2
new file mode 100644
index 000000000..c39b85881
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_122.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2
new file mode 100644
index 000000000..2a4383dfc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_123.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2
new file mode 100644
index 000000000..629fdba08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_124.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2
new file mode 100644
index 000000000..e8e553145
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_125.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2
new file mode 100644
index 000000000..e2423011e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_126.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2
new file mode 100644
index 000000000..2b7b7d238
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_127.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2
new file mode 100644
index 000000000..9408a6203
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_128.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2
new file mode 100644
index 000000000..8a5e744d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_129.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2
new file mode 100644
index 000000000..40edff044
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_13.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2
new file mode 100644
index 000000000..1a979af90
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_130.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2
new file mode 100644
index 000000000..63186accf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_131.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2
new file mode 100644
index 000000000..48919be26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_132.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2
new file mode 100644
index 000000000..8a3297a81
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_133.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2
new file mode 100644
index 000000000..ee9a6ee0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_134.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2
new file mode 100644
index 000000000..7da608f4f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_135.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2
new file mode 100644
index 000000000..ff59e6ede
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_136.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2
new file mode 100644
index 000000000..2b960481b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_137.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2
new file mode 100644
index 000000000..dadd94af6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_138.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2
new file mode 100644
index 000000000..7132e8897
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_139.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2
new file mode 100644
index 000000000..1281a0de4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_14.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2
new file mode 100644
index 000000000..125afd823
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_140.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2
new file mode 100644
index 000000000..cd5c7d811
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_141.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2
new file mode 100644
index 000000000..690e3c46b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_142.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2
new file mode 100644
index 000000000..86f2d7214
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_143.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2
new file mode 100644
index 000000000..6ac1ea244
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_144.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2
new file mode 100644
index 000000000..9afc56ce7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_145.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2
new file mode 100644
index 000000000..dc8e09a95
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_146.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2
new file mode 100644
index 000000000..52b88f2f9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_147.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2
new file mode 100644
index 000000000..0603be851
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_148.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2
new file mode 100644
index 000000000..e27217c78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_149.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2
new file mode 100644
index 000000000..feec4d517
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_15.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2
new file mode 100644
index 000000000..1222993ae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_150.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2
new file mode 100644
index 000000000..7ab443d06
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_151.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2
new file mode 100644
index 000000000..83e359d16
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_152.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2
new file mode 100644
index 000000000..2a4babf04
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_153.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2
new file mode 100644
index 000000000..2b3fe5183
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_154.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2
new file mode 100644
index 000000000..c54d8113b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_155.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2
new file mode 100644
index 000000000..159848554
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_156.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2
new file mode 100644
index 000000000..01de0f0c1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_157.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2
new file mode 100644
index 000000000..0055ef4d3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_158.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2
new file mode 100644
index 000000000..befe6ef35
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_159.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2
new file mode 100644
index 000000000..c20c8cd80
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_16.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2
new file mode 100644
index 000000000..9b4b0ef0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_160.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2
new file mode 100644
index 000000000..7747ec942
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_161.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2
new file mode 100644
index 000000000..63a55bdb5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_162.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2
new file mode 100644
index 000000000..9423c9194
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_163.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2
new file mode 100644
index 000000000..f81c3b053
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_164.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2
new file mode 100644
index 000000000..72cffafc0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_165.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2
new file mode 100644
index 000000000..afe083a8e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_166.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2
new file mode 100644
index 000000000..0d761fa43
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_167.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2
new file mode 100644
index 000000000..006526f45
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_168.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2
new file mode 100644
index 000000000..3296851e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_169.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2
new file mode 100644
index 000000000..a0c663bc9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_17.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2
new file mode 100644
index 000000000..9d5a29bcb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_170.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2
new file mode 100644
index 000000000..c28779b21
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_171.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2
new file mode 100644
index 000000000..e341e432c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_172.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2
new file mode 100644
index 000000000..29c8cf230
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_173.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2
new file mode 100644
index 000000000..63aed9cc3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_174.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2
new file mode 100644
index 000000000..54c0e4b8b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_175.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2
new file mode 100644
index 000000000..d32fd8021
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_176.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2
new file mode 100644
index 000000000..5fea66116
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_177.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2
new file mode 100644
index 000000000..70db2c99c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_178.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2
new file mode 100644
index 000000000..79d329d15
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_179.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2
new file mode 100644
index 000000000..798b11b5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_18.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2
new file mode 100644
index 000000000..c0afa4dcd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_180.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2
new file mode 100644
index 000000000..36b163154
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_181.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2
new file mode 100644
index 000000000..288606777
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_182.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2
new file mode 100644
index 000000000..856fe97db
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_183.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2
new file mode 100644
index 000000000..cdd209144
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_184.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2
new file mode 100644
index 000000000..07224ff1f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_185.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2
new file mode 100644
index 000000000..c5222263c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_186.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2
new file mode 100644
index 000000000..7cb0bd280
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_187.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2
new file mode 100644
index 000000000..cef4e52bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_188.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2
new file mode 100644
index 000000000..c73fac96a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_189.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2
new file mode 100644
index 000000000..5d65a7c8d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_19.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2
new file mode 100644
index 000000000..c58717d57
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_190.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2
new file mode 100644
index 000000000..13e6b0a08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_191.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2
new file mode 100644
index 000000000..b14dd6b23
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_192.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2
new file mode 100644
index 000000000..15d498b5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_193.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2
new file mode 100644
index 000000000..345a6507d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_194.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2
new file mode 100644
index 000000000..b41b83ff1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_195.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2
new file mode 100644
index 000000000..76f281eb7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_196.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2
new file mode 100644
index 000000000..ccf3fc5ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_197.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2
new file mode 100644
index 000000000..5b66d7623
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_198.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2
new file mode 100644
index 000000000..62e8f77b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_199.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2
new file mode 100644
index 000000000..03b47fb41
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_2.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2
new file mode 100644
index 000000000..4fa967a84
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_20.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2
new file mode 100644
index 000000000..b73f20223
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_200.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2
new file mode 100644
index 000000000..f6b4e1a19
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_201.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2
new file mode 100644
index 000000000..cc57aa304
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_202.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2
new file mode 100644
index 000000000..b9fd6b042
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_203.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2
new file mode 100644
index 000000000..64c74be1c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_204.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2
new file mode 100644
index 000000000..e2ab78e02
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_205.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2
new file mode 100644
index 000000000..91770146d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_206.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2
new file mode 100644
index 000000000..87efd44d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_207.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2
new file mode 100644
index 000000000..e7a87fb47
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_208.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2
new file mode 100644
index 000000000..878323937
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_209.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2
new file mode 100644
index 000000000..5213315fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_21.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2
new file mode 100644
index 000000000..1c47a40d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_210.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2
new file mode 100644
index 000000000..0a41727e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_211.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2
new file mode 100644
index 000000000..327d6571f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_212.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2
new file mode 100644
index 000000000..23cd2c490
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_213.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2
new file mode 100644
index 000000000..a0d8fefe3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_214.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2
new file mode 100644
index 000000000..787b03b17
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_215.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2
new file mode 100644
index 000000000..a6103edd0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_216.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2
new file mode 100644
index 000000000..24fe59083
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_217.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2
new file mode 100644
index 000000000..f4dcb7ed5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_218.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2
new file mode 100644
index 000000000..de7775805
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_219.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2
new file mode 100644
index 000000000..dc5860131
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_22.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2
new file mode 100644
index 000000000..77a92709d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_220.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2
new file mode 100644
index 000000000..7d4e5d7fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_221.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2
new file mode 100644
index 000000000..65913fb9a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_222.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2
new file mode 100644
index 000000000..7d624a17c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_223.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2
new file mode 100644
index 000000000..e5542732f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_224.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2
new file mode 100644
index 000000000..83991626d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_225.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2
new file mode 100644
index 000000000..014f5f717
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_226.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2
new file mode 100644
index 000000000..a6b17fc3e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_227.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2
new file mode 100644
index 000000000..4fa36e316
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_228.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2
new file mode 100644
index 000000000..2833e1301
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_229.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2
new file mode 100644
index 000000000..be4ea3429
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_23.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2
new file mode 100644
index 000000000..6668d16a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_230.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2
new file mode 100644
index 000000000..508de8056
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_231.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2
new file mode 100644
index 000000000..1329675f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_232.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2
new file mode 100644
index 000000000..620790a22
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_233.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2
new file mode 100644
index 000000000..3b88a8164
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_234.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2
new file mode 100644
index 000000000..b6686ed0b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_235.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2
new file mode 100644
index 000000000..9d939a1f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_236.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2
new file mode 100644
index 000000000..ef48ceb15
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_237.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2
new file mode 100644
index 000000000..65ba482d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_238.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2
new file mode 100644
index 000000000..efcae4ad4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_239.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2
new file mode 100644
index 000000000..4437f595d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_24.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2
new file mode 100644
index 000000000..54a1d984d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_240.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2
new file mode 100644
index 000000000..01743dda2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_241.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2
new file mode 100644
index 000000000..3fc3497f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_242.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2
new file mode 100644
index 000000000..8cccf0d5d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_243.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2
new file mode 100644
index 000000000..c9163ae5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_244.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2
new file mode 100644
index 000000000..9afaab16b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_245.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2
new file mode 100644
index 000000000..a80856593
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_246.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2
new file mode 100644
index 000000000..6b9e555df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_247.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2
new file mode 100644
index 000000000..272219571
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_248.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2
new file mode 100644
index 000000000..9fc8491f9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_249.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2
new file mode 100644
index 000000000..223c8ffd7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_25.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2
new file mode 100644
index 000000000..9abdf9ab5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_250.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2
new file mode 100644
index 000000000..c60cb3da0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_251.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2
new file mode 100644
index 000000000..8b841617f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_252.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2
new file mode 100644
index 000000000..cb6423ddf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_253.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2
new file mode 100644
index 000000000..e30526913
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_254.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2
new file mode 100644
index 000000000..a168aadae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_255.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2
new file mode 100644
index 000000000..fff9d2070
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_256.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2
new file mode 100644
index 000000000..464f937a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_257.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2
new file mode 100644
index 000000000..49cd0bec3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_258.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2
new file mode 100644
index 000000000..ad127c16b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_259.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2
new file mode 100644
index 000000000..f5460f417
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_26.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2
new file mode 100644
index 000000000..8e6674914
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_260.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2
new file mode 100644
index 000000000..eaae699a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_261.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2
new file mode 100644
index 000000000..e13945863
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_262.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2
new file mode 100644
index 000000000..f5b4e24b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_263.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2
new file mode 100644
index 000000000..b8dc48e21
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_264.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2
new file mode 100644
index 000000000..9f7d545da
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_265.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2
new file mode 100644
index 000000000..ccc088ad4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_266.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2
new file mode 100644
index 000000000..cf8cda4c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_267.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2
new file mode 100644
index 000000000..f6fd4345f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_268.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2
new file mode 100644
index 000000000..bbe9fef26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_269.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2
new file mode 100644
index 000000000..f6dfe993c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_27.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2
new file mode 100644
index 000000000..ae38d7a21
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_270.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2
new file mode 100644
index 000000000..8da1159be
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_271.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2
new file mode 100644
index 000000000..7ec1bf77c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_272.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2
new file mode 100644
index 000000000..c189fb8a8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_273.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2
new file mode 100644
index 000000000..5a58d5096
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_274.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2
new file mode 100644
index 000000000..4d7c0cbf5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_275.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2
new file mode 100644
index 000000000..7f8725240
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_276.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2
new file mode 100644
index 000000000..e66a0a4c6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_277.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2
new file mode 100644
index 000000000..bdc3b8262
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_278.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2
new file mode 100644
index 000000000..04fe4d726
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_279.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2
new file mode 100644
index 000000000..1530edcfc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_28.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2
new file mode 100644
index 000000000..3e8c398e8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_280.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2
new file mode 100644
index 000000000..904014414
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_281.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2
new file mode 100644
index 000000000..76e094b84
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_282.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2
new file mode 100644
index 000000000..6bb065190
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_283.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2
new file mode 100644
index 000000000..496966605
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_284.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2
new file mode 100644
index 000000000..ff3545008
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_285.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2
new file mode 100644
index 000000000..943bddd57
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_286.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2
new file mode 100644
index 000000000..2d8d95e3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_287.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2
new file mode 100644
index 000000000..dce1b257f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_288.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2
new file mode 100644
index 000000000..1ac5b898d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_289.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2
new file mode 100644
index 000000000..10211fef0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_29.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2
new file mode 100644
index 000000000..1333716d1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_290.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2
new file mode 100644
index 000000000..47f72b0e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_291.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2
new file mode 100644
index 000000000..150db9ccb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_292.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2
new file mode 100644
index 000000000..0a99e1001
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_293.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2
new file mode 100644
index 000000000..25935bd49
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_294.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2
new file mode 100644
index 000000000..13b2ae1a8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_295.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2
new file mode 100644
index 000000000..21524ef5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_296.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2
new file mode 100644
index 000000000..e945a74ef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_297.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2
new file mode 100644
index 000000000..8a12ff8a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_298.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2
new file mode 100644
index 000000000..fd900bf42
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_299.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2
new file mode 100644
index 000000000..9fb4e07f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_3.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2
new file mode 100644
index 000000000..5e54f8021
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_30.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2
new file mode 100644
index 000000000..2598d133b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_300.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2
new file mode 100644
index 000000000..1889f69f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_301.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2
new file mode 100644
index 000000000..67c7026fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_302.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2
new file mode 100644
index 000000000..641c2901a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_303.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2
new file mode 100644
index 000000000..bd514017d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_304.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2
new file mode 100644
index 000000000..8bd12c24d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_305.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2
new file mode 100644
index 000000000..2242cc5ea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_306.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2
new file mode 100644
index 000000000..a3cbf8fa4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_307.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2
new file mode 100644
index 000000000..89e2fe82f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_308.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2
new file mode 100644
index 000000000..773263b12
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_309.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2
new file mode 100644
index 000000000..1f1600b71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_31.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2
new file mode 100644
index 000000000..dc5edc238
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_310.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2
new file mode 100644
index 000000000..d6f4e0551
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_311.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2
new file mode 100644
index 000000000..39dba5a7b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_312.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2
new file mode 100644
index 000000000..3ba1a59a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_313.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2
new file mode 100644
index 000000000..56fbfb8b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_314.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2
new file mode 100644
index 000000000..b739e6f7b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_315.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2
new file mode 100644
index 000000000..a5f2ef2bf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_316.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2
new file mode 100644
index 000000000..34b3fa907
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_317.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2
new file mode 100644
index 000000000..dc1ba2a01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_318.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2
new file mode 100644
index 000000000..b19bd05df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_319.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2
new file mode 100644
index 000000000..e7db835d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_32.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2
new file mode 100644
index 000000000..ddd24d008
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_320.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2
new file mode 100644
index 000000000..77b781b9a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_321.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2
new file mode 100644
index 000000000..13ee4ef82
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_322.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2
new file mode 100644
index 000000000..1906a5374
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_323.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2
new file mode 100644
index 000000000..81de4ff0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_324.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2
new file mode 100644
index 000000000..dd10f1407
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_325.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2
new file mode 100644
index 000000000..eaae80f81
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_326.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2
new file mode 100644
index 000000000..d5c12b3b7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_327.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2
new file mode 100644
index 000000000..75a0a921f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_328.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2
new file mode 100644
index 000000000..8340ea45b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_329.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2
new file mode 100644
index 000000000..403f7f314
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_33.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2
new file mode 100644
index 000000000..7fa3216b5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_330.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2
new file mode 100644
index 000000000..d3d0ca230
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_331.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2
new file mode 100644
index 000000000..fb7eadc78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_332.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2
new file mode 100644
index 000000000..fbc553197
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_333.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2
new file mode 100644
index 000000000..de4e957ac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_334.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2
new file mode 100644
index 000000000..d2487864c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_335.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2
new file mode 100644
index 000000000..685c66981
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_336.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2
new file mode 100644
index 000000000..9e39c4aa8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_337.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2
new file mode 100644
index 000000000..ed90027bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_338.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2
new file mode 100644
index 000000000..4bf66b26b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_339.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2
new file mode 100644
index 000000000..090b1a79b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_34.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2
new file mode 100644
index 000000000..f09cde4c2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_340.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2
new file mode 100644
index 000000000..b24e0993f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_341.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2
new file mode 100644
index 000000000..e8d1d9856
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_342.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2
new file mode 100644
index 000000000..4b098f205
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_343.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2
new file mode 100644
index 000000000..8e23214ee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_344.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2
new file mode 100644
index 000000000..dca815936
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_345.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2
new file mode 100644
index 000000000..5ddc090a8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_346.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2
new file mode 100644
index 000000000..84450839b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_347.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2
new file mode 100644
index 000000000..a04c16436
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_348.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2
new file mode 100644
index 000000000..264f7c026
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_349.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2
new file mode 100644
index 000000000..94127a0fc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_35.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2
new file mode 100644
index 000000000..77d4a6850
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_350.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2
new file mode 100644
index 000000000..51a484708
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_351.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2
new file mode 100644
index 000000000..85dfb23a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_352.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2
new file mode 100644
index 000000000..150621713
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_353.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2
new file mode 100644
index 000000000..eae243fd2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_354.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2
new file mode 100644
index 000000000..e517664ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_355.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2
new file mode 100644
index 000000000..c3fd89016
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_356.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2
new file mode 100644
index 000000000..0ae6a1b75
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_357.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2
new file mode 100644
index 000000000..3c267928f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_358.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2
new file mode 100644
index 000000000..029efa528
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_359.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2
new file mode 100644
index 000000000..b2030e300
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_36.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2
new file mode 100644
index 000000000..eb5e92235
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_360.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2
new file mode 100644
index 000000000..34b94ac89
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_361.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2
new file mode 100644
index 000000000..40ebc5c02
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_362.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2
new file mode 100644
index 000000000..2c44967ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_363.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2
new file mode 100644
index 000000000..3d50632c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_364.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2
new file mode 100644
index 000000000..86f617a1c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_365.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2
new file mode 100644
index 000000000..b50284d52
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_366.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2
new file mode 100644
index 000000000..0960183fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_367.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2
new file mode 100644
index 000000000..0f473a9c8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_368.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2
new file mode 100644
index 000000000..fb37e1f76
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_369.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2
new file mode 100644
index 000000000..994ece26c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_37.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2
new file mode 100644
index 000000000..ffddcdac6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_370.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2
new file mode 100644
index 000000000..6b1bfa580
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_371.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2
new file mode 100644
index 000000000..80c539d51
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_372.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2
new file mode 100644
index 000000000..7b93f3e92
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_373.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2
new file mode 100644
index 000000000..4eb878644
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_374.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2
new file mode 100644
index 000000000..c9a8b7fa2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_375.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2
new file mode 100644
index 000000000..db618d5bc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_376.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2
new file mode 100644
index 000000000..6c810875d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_377.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2
new file mode 100644
index 000000000..10fcc1bf7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_378.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2
new file mode 100644
index 000000000..cfcf0a1ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_379.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2
new file mode 100644
index 000000000..4edac95de
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_38.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2
new file mode 100644
index 000000000..f4dc2e542
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_380.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2
new file mode 100644
index 000000000..bf72347ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_381.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2
new file mode 100644
index 000000000..7441b3804
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_382.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2
new file mode 100644
index 000000000..987d1b5e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_383.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2
new file mode 100644
index 000000000..ddee59424
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_384.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2
new file mode 100644
index 000000000..4b1dbbae9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_385.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2
new file mode 100644
index 000000000..eedc9c364
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_386.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2
new file mode 100644
index 000000000..bab845e53
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_387.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2
new file mode 100644
index 000000000..7b3c27a07
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_388.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2
new file mode 100644
index 000000000..9aaf9472d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_389.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2
new file mode 100644
index 000000000..bb3079b8c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_39.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2
new file mode 100644
index 000000000..3cfee84c6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_390.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2
new file mode 100644
index 000000000..a588eeeb4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_391.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2
new file mode 100644
index 000000000..e9f322f95
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_392.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2
new file mode 100644
index 000000000..377d57eac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_393.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2
new file mode 100644
index 000000000..43020b054
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_394.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2
new file mode 100644
index 000000000..2745e3500
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_395.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2
new file mode 100644
index 000000000..49bfd89c3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_396.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2
new file mode 100644
index 000000000..e431d9068
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_397.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2
new file mode 100644
index 000000000..1cce61df7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_398.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2
new file mode 100644
index 000000000..d6e65a80f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_399.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2
new file mode 100644
index 000000000..5d846875e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_4.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2
new file mode 100644
index 000000000..69ffece9f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_40.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2
new file mode 100644
index 000000000..08cf5e423
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_400.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2
new file mode 100644
index 000000000..a80c242cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_401.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2
new file mode 100644
index 000000000..8e681eab2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_402.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2
new file mode 100644
index 000000000..ec7a4636d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_403.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2
new file mode 100644
index 000000000..d55047b22
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_404.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2
new file mode 100644
index 000000000..e259ea274
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_405.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2
new file mode 100644
index 000000000..85d6fe0f9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_406.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2
new file mode 100644
index 000000000..71c3ced9d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_407.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2
new file mode 100644
index 000000000..b20e85385
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_408.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2
new file mode 100644
index 000000000..09ae0909c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_409.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2
new file mode 100644
index 000000000..9345c212d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_41.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2
new file mode 100644
index 000000000..e1d9c7cf2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_410.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2
new file mode 100644
index 000000000..9d9854d0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_411.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2
new file mode 100644
index 000000000..1813ee3fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_412.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2
new file mode 100644
index 000000000..cfe62c21d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_413.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2
new file mode 100644
index 000000000..35bccd7e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_414.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2
new file mode 100644
index 000000000..8b2a18301
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_415.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2
new file mode 100644
index 000000000..86a7f869f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_416.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2
new file mode 100644
index 000000000..2a1347aa1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_417.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2
new file mode 100644
index 000000000..324b0c99c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_418.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2
new file mode 100644
index 000000000..0f978f4f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_419.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2
new file mode 100644
index 000000000..6da7570b0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_42.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2
new file mode 100644
index 000000000..5d31f7164
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_420.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2
new file mode 100644
index 000000000..5531eb532
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_421.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2
new file mode 100644
index 000000000..64bf5b9e3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_422.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2
new file mode 100644
index 000000000..0c3559f22
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_423.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2
new file mode 100644
index 000000000..f0cc557bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_424.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2
new file mode 100644
index 000000000..3d42a1c56
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_425.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2
new file mode 100644
index 000000000..4d86ff9ac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_426.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2
new file mode 100644
index 000000000..41cd57994
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_427.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2
new file mode 100644
index 000000000..0c00ca75f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_428.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2
new file mode 100644
index 000000000..630fb3089
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_429.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2
new file mode 100644
index 000000000..081c2b464
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_43.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2
new file mode 100644
index 000000000..56766cad7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_430.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2
new file mode 100644
index 000000000..54c45d4f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_431.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2
new file mode 100644
index 000000000..8e3c311f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_432.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2
new file mode 100644
index 000000000..04af95876
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_433.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2
new file mode 100644
index 000000000..6e64652c2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_434.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2
new file mode 100644
index 000000000..f993c53fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_435.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2
new file mode 100644
index 000000000..612941206
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_436.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2
new file mode 100644
index 000000000..6bb9f2227
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_437.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2
new file mode 100644
index 000000000..752edc4b2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_438.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2
new file mode 100644
index 000000000..21f91a96c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_439.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2
new file mode 100644
index 000000000..dc2514cfe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_44.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2
new file mode 100644
index 000000000..f15bc2c29
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_440.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2
new file mode 100644
index 000000000..fd132dae4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_441.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2
new file mode 100644
index 000000000..f0666795b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_442.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2
new file mode 100644
index 000000000..814536ec7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_443.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2
new file mode 100644
index 000000000..ed9ddd3ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_444.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2
new file mode 100644
index 000000000..aa518af04
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_445.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2
new file mode 100644
index 000000000..a8d3f53a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_446.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2
new file mode 100644
index 000000000..e486e00e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_447.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2
new file mode 100644
index 000000000..6d832e5cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_448.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2
new file mode 100644
index 000000000..e6f3f6717
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_449.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2
new file mode 100644
index 000000000..2eb3849a4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_45.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2
new file mode 100644
index 000000000..7bd2f4a52
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_450.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2
new file mode 100644
index 000000000..bcb9f289d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_451.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2
new file mode 100644
index 000000000..0b74a5a12
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_452.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2
new file mode 100644
index 000000000..17da07cfa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_453.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2
new file mode 100644
index 000000000..ec528c6fa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_454.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2
new file mode 100644
index 000000000..4846b6abd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_455.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2
new file mode 100644
index 000000000..4e89dfce5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_456.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2
new file mode 100644
index 000000000..9e396995c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_457.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2
new file mode 100644
index 000000000..a7283664d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_458.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2
new file mode 100644
index 000000000..78041dac0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_459.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2
new file mode 100644
index 000000000..8483c05fa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_46.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2
new file mode 100644
index 000000000..8ca5adf7d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_460.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2
new file mode 100644
index 000000000..21f1470b8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_461.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2
new file mode 100644
index 000000000..ee7bb72b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_462.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2
new file mode 100644
index 000000000..1e39fbad7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_463.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2
new file mode 100644
index 000000000..8026e809e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_464.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2
new file mode 100644
index 000000000..6cfc7b91f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_465.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2
new file mode 100644
index 000000000..029493d8a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_466.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2
new file mode 100644
index 000000000..c3412f842
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_467.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2
new file mode 100644
index 000000000..d187cb510
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_468.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2
new file mode 100644
index 000000000..13d974ae0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_469.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2
new file mode 100644
index 000000000..da35f4215
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_47.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2
new file mode 100644
index 000000000..5bef82f11
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_470.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2
new file mode 100644
index 000000000..fc5299def
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_471.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2
new file mode 100644
index 000000000..5e43d663d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_472.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2
new file mode 100644
index 000000000..ee2f0b19e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_473.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2
new file mode 100644
index 000000000..25d1a259a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_474.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2
new file mode 100644
index 000000000..01339dbc9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_475.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2
new file mode 100644
index 000000000..b2d7e0cca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_476.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2
new file mode 100644
index 000000000..a3c5a0949
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_477.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2
new file mode 100644
index 000000000..c70a744dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_478.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2
new file mode 100644
index 000000000..1a7f083d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_479.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2
new file mode 100644
index 000000000..00e9b3d2d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_48.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2
new file mode 100644
index 000000000..c70cdde9f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_480.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2
new file mode 100644
index 000000000..49ec3b58b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_481.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2
new file mode 100644
index 000000000..7317c2f2e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_482.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2
new file mode 100644
index 000000000..7b42dafaf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_483.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2
new file mode 100644
index 000000000..64a7a0391
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_484.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2
new file mode 100644
index 000000000..d2fccb3ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_485.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2
new file mode 100644
index 000000000..33918db3d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_486.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2
new file mode 100644
index 000000000..3e516a2c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_487.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2
new file mode 100644
index 000000000..ac90adfca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_488.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2
new file mode 100644
index 000000000..af4b34d50
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_489.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2
new file mode 100644
index 000000000..4c3a9880a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_49.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2
new file mode 100644
index 000000000..c20147a98
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_490.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2
new file mode 100644
index 000000000..edd057f56
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_491.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2
new file mode 100644
index 000000000..a3dcc6cec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_492.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2
new file mode 100644
index 000000000..e0e84350c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_493.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2
new file mode 100644
index 000000000..7a7d92506
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_494.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2
new file mode 100644
index 000000000..eccb78dc8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_495.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2
new file mode 100644
index 000000000..cb21e4985
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_496.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2
new file mode 100644
index 000000000..2855be3e9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_497.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2
new file mode 100644
index 000000000..326c193e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_498.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2
new file mode 100644
index 000000000..8eba22acd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_499.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2
new file mode 100644
index 000000000..ea59cfe79
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_5.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2
new file mode 100644
index 000000000..87fdcbf5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_50.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2
new file mode 100644
index 000000000..a65b4036d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_51.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2
new file mode 100644
index 000000000..8795330c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_52.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2
new file mode 100644
index 000000000..3526ba226
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_53.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2
new file mode 100644
index 000000000..4aadda950
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_54.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2
new file mode 100644
index 000000000..123deb4f4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_55.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2
new file mode 100644
index 000000000..26f95058a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_56.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2
new file mode 100644
index 000000000..168a2c5c2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_57.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2
new file mode 100644
index 000000000..5770e69a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_58.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2
new file mode 100644
index 000000000..6f68beb58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_59.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2
new file mode 100644
index 000000000..fda4f8785
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_6.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2
new file mode 100644
index 000000000..559dd8fd0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_60.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2
new file mode 100644
index 000000000..ff425b483
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_61.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2
new file mode 100644
index 000000000..11cdc60e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_62.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2
new file mode 100644
index 000000000..96b31b314
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_63.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2
new file mode 100644
index 000000000..81c682a58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_64.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2
new file mode 100644
index 000000000..5b03a5947
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_65.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2
new file mode 100644
index 000000000..18d7326b8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_66.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2
new file mode 100644
index 000000000..964336cee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_67.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2
new file mode 100644
index 000000000..8832de277
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_68.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2
new file mode 100644
index 000000000..a92a5b596
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_69.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2
new file mode 100644
index 000000000..346fc9e99
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_7.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2
new file mode 100644
index 000000000..d719f99c8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_70.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2
new file mode 100644
index 000000000..8d4b22ec3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_71.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2
new file mode 100644
index 000000000..bc9fb2075
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_72.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2
new file mode 100644
index 000000000..68c0cbf6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_73.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2
new file mode 100644
index 000000000..4ab245bf9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_74.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2
new file mode 100644
index 000000000..4292061c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_75.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2
new file mode 100644
index 000000000..aba789989
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_76.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2
new file mode 100644
index 000000000..7270c67de
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_77.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2
new file mode 100644
index 000000000..0e4febfcc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_78.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "100"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2
new file mode 100644
index 000000000..ae3c7c19f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_79.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2
new file mode 100644
index 000000000..5b832aebd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_8.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "010"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2
new file mode 100644
index 000000000..01d943a21
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_80.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2
new file mode 100644
index 000000000..f9ce02f39
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_81.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2
new file mode 100644
index 000000000..18cb62ec9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_82.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "101"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2
new file mode 100644
index 000000000..62634777f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_83.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2
new file mode 100644
index 000000000..a4a2134a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_84.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2
new file mode 100644
index 000000000..77eed4af5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_85.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2
new file mode 100644
index 000000000..4f3b4c436
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_86.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2
new file mode 100644
index 000000000..8ec89ad7b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_87.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2
new file mode 100644
index 000000000..2e757ce88
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_88.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2
new file mode 100644
index 000000000..054be1b3d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_89.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "010"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2
new file mode 100644
index 000000000..6105f86cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_9.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2
new file mode 100644
index 000000000..4b1c4913e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_90.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "011"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2
new file mode 100644
index 000000000..1d585d2a4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_91.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "101"))
+(assert (= Bottom_0 "001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2
new file mode 100644
index 000000000..9c7103745
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_92.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2
new file mode 100644
index 000000000..a13c46555
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_93.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "011"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2
new file mode 100644
index 000000000..98f73f68b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_94.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "011"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2
new file mode 100644
index 000000000..7ee1b1268
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_95.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2
new file mode 100644
index 000000000..f9aa47146
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_96.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "110"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "001"))
+(assert (= Bottom_2 "110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2
new file mode 100644
index 000000000..1d809759a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_97.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2
new file mode 100644
index 000000000..7622dd2bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_98.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "001"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "100"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2
new file mode 100644
index 000000000..c1b0065f3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-3-random/pcp_instance_99.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,3] on randomly generated strings with exactly length 3.
+Most benchmarks expected to be unsat.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "000"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "110"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2
new file mode 100644
index 000000000..cc401a3cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_0.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2
new file mode 100644
index 000000000..497eeaff2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_1.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1011"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2
new file mode 100644
index 000000000..f3fc70fec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_10.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2
new file mode 100644
index 000000000..9c6edac75
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_100.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2
new file mode 100644
index 000000000..6e9ef4aef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_101.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2
new file mode 100644
index 000000000..01ead9acf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_102.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2
new file mode 100644
index 000000000..9a3a48eef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_103.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2
new file mode 100644
index 000000000..8825a60cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_104.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2
new file mode 100644
index 000000000..3cf226c34
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_105.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2
new file mode 100644
index 000000000..af85d6fc2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_106.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2
new file mode 100644
index 000000000..8b015315b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_107.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2
new file mode 100644
index 000000000..aaebdc881
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_108.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2
new file mode 100644
index 000000000..8fa574de6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_109.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2
new file mode 100644
index 000000000..7a1b6ea5c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_11.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2
new file mode 100644
index 000000000..dedc6a414
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_110.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2
new file mode 100644
index 000000000..18c2be0f3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_111.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2
new file mode 100644
index 000000000..e11e7e014
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_112.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2
new file mode 100644
index 000000000..b39442e5c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_113.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2
new file mode 100644
index 000000000..5a61b67f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_114.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2
new file mode 100644
index 000000000..841d633f9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_115.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2
new file mode 100644
index 000000000..1d15bf8ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_116.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2
new file mode 100644
index 000000000..2eb7403b8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_117.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2
new file mode 100644
index 000000000..ed9494ba1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_118.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2
new file mode 100644
index 000000000..f65f0c418
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_119.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2
new file mode 100644
index 000000000..73979019b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_12.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2
new file mode 100644
index 000000000..1b4674cd3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_120.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2
new file mode 100644
index 000000000..45d3a3384
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_121.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2
new file mode 100644
index 000000000..f6558373a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_122.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2
new file mode 100644
index 000000000..7ab495d69
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_123.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2
new file mode 100644
index 000000000..9e2c01d0d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_124.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2
new file mode 100644
index 000000000..cccb2de3f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_125.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2
new file mode 100644
index 000000000..ef5ff85cb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_126.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2
new file mode 100644
index 000000000..95330f3ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_127.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2
new file mode 100644
index 000000000..906a6ef25
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_128.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2
new file mode 100644
index 000000000..6c4eb8b3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_129.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2
new file mode 100644
index 000000000..80d7e2a5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_13.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2
new file mode 100644
index 000000000..0645748cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_130.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2
new file mode 100644
index 000000000..41ee354a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_131.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2
new file mode 100644
index 000000000..490fad202
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_132.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2
new file mode 100644
index 000000000..1df74bc58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_133.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2
new file mode 100644
index 000000000..c7593aaef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_134.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2
new file mode 100644
index 000000000..0d8ab0fa5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_135.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2
new file mode 100644
index 000000000..03a7220da
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_136.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2
new file mode 100644
index 000000000..bbee68664
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_137.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2
new file mode 100644
index 000000000..88993f091
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_138.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2
new file mode 100644
index 000000000..c5497efba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_139.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2
new file mode 100644
index 000000000..fb89e0088
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_14.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2
new file mode 100644
index 000000000..4b76b6cba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_140.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2
new file mode 100644
index 000000000..cd30caf66
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_141.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2
new file mode 100644
index 000000000..1bc61c32a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_142.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2
new file mode 100644
index 000000000..6daf0adf3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_143.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "1100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2
new file mode 100644
index 000000000..8060bae23
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_144.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2
new file mode 100644
index 000000000..9297590cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_145.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2
new file mode 100644
index 000000000..8decb36bc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_146.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2
new file mode 100644
index 000000000..89cb670ea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_147.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2
new file mode 100644
index 000000000..84e7c49ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_148.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2
new file mode 100644
index 000000000..90c3ef482
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_149.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2
new file mode 100644
index 000000000..48fe570dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_15.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2
new file mode 100644
index 000000000..41e87f56a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_150.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2
new file mode 100644
index 000000000..2a7c61ed7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_151.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2
new file mode 100644
index 000000000..70ba93913
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_152.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2
new file mode 100644
index 000000000..0102d9636
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_153.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "1010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2
new file mode 100644
index 000000000..88a78d63e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_154.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "1001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2
new file mode 100644
index 000000000..2c53c3acf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_155.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2
new file mode 100644
index 000000000..ad8cebecc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_156.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "0011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2
new file mode 100644
index 000000000..52625c6b7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_157.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "0011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2
new file mode 100644
index 000000000..90c03507e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_158.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2
new file mode 100644
index 000000000..3dc1e6502
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_159.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2
new file mode 100644
index 000000000..3ef42c692
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_16.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2
new file mode 100644
index 000000000..aeac78cdc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_160.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2
new file mode 100644
index 000000000..2c337bdd7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_161.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2
new file mode 100644
index 000000000..ae61f9d40
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_162.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2
new file mode 100644
index 000000000..9e09d52af
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_163.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2
new file mode 100644
index 000000000..630e274e8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_164.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "001"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2
new file mode 100644
index 000000000..2b2b55300
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_165.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2
new file mode 100644
index 000000000..5e6fda7e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_166.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2
new file mode 100644
index 000000000..ca90414d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_167.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2
new file mode 100644
index 000000000..0d267105c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_168.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2
new file mode 100644
index 000000000..d0e392feb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_169.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0100"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2
new file mode 100644
index 000000000..df16a4d47
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_17.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2
new file mode 100644
index 000000000..15e912415
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_170.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2
new file mode 100644
index 000000000..c06e64bf5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_171.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2
new file mode 100644
index 000000000..d5455007b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_172.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2
new file mode 100644
index 000000000..a04af40d1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_173.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2
new file mode 100644
index 000000000..9804b77b7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_174.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2
new file mode 100644
index 000000000..1a464ac69
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_175.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2
new file mode 100644
index 000000000..77ee0a97f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_176.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2
new file mode 100644
index 000000000..fa397b2ad
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_177.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2
new file mode 100644
index 000000000..280c9ee7c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_178.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2
new file mode 100644
index 000000000..4e6cedc5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_179.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2
new file mode 100644
index 000000000..a76c92586
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_18.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2
new file mode 100644
index 000000000..e60fbbabc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_180.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2
new file mode 100644
index 000000000..ce52a385d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_181.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2
new file mode 100644
index 000000000..9bf5b40cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_182.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2
new file mode 100644
index 000000000..4096460c0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_183.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2
new file mode 100644
index 000000000..d7d663262
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_184.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2
new file mode 100644
index 000000000..314ed2fb4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_185.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2
new file mode 100644
index 000000000..6cc4da04d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_186.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2
new file mode 100644
index 000000000..3b682ae86
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_187.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2
new file mode 100644
index 000000000..11406bafc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_188.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2
new file mode 100644
index 000000000..cd62b00f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_189.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2
new file mode 100644
index 000000000..069a4c5fd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_19.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2
new file mode 100644
index 000000000..90e0be5b8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_190.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2
new file mode 100644
index 000000000..bb6e6b8c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_191.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2
new file mode 100644
index 000000000..2ebb0c942
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_192.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2
new file mode 100644
index 000000000..be83cef47
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_193.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2
new file mode 100644
index 000000000..d9fb40691
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_194.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2
new file mode 100644
index 000000000..b573430ff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_195.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2
new file mode 100644
index 000000000..2d57c4c6f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_196.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2
new file mode 100644
index 000000000..cd30277d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_197.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2
new file mode 100644
index 000000000..655c97ac8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_198.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2
new file mode 100644
index 000000000..a088b6751
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_199.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2
new file mode 100644
index 000000000..f08b56647
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_2.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2
new file mode 100644
index 000000000..3bb8a90fd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_20.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2
new file mode 100644
index 000000000..203d55861
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_200.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2
new file mode 100644
index 000000000..188dc94b3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_201.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2
new file mode 100644
index 000000000..92a3a48e8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_202.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2
new file mode 100644
index 000000000..3acd96280
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_203.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2
new file mode 100644
index 000000000..6ec268115
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_204.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2
new file mode 100644
index 000000000..25cd2c145
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_205.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2
new file mode 100644
index 000000000..490f43372
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_206.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2
new file mode 100644
index 000000000..763f39800
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_207.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2
new file mode 100644
index 000000000..9d9dd876d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_208.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2
new file mode 100644
index 000000000..0cfadaf90
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_209.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2
new file mode 100644
index 000000000..6cc8c93ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_21.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2
new file mode 100644
index 000000000..f426e72a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_210.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "1101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2
new file mode 100644
index 000000000..c91236619
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_211.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2
new file mode 100644
index 000000000..d8c13369e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_212.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2
new file mode 100644
index 000000000..c68021772
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_213.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2
new file mode 100644
index 000000000..2f841516c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_214.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2
new file mode 100644
index 000000000..f079dcc64
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_215.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2
new file mode 100644
index 000000000..9fd3e59c4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_216.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "010"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2
new file mode 100644
index 000000000..03b25530e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_217.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2
new file mode 100644
index 000000000..1e7e124a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_218.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2
new file mode 100644
index 000000000..72044146b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_219.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2
new file mode 100644
index 000000000..d440235b7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_22.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2
new file mode 100644
index 000000000..d1087c0c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_220.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "1100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2
new file mode 100644
index 000000000..a1beec048
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_221.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2
new file mode 100644
index 000000000..187ebb33e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_222.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "100"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2
new file mode 100644
index 000000000..8a239e1b5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_223.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2
new file mode 100644
index 000000000..7bf5c5f69
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_224.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2
new file mode 100644
index 000000000..8ba46894d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_225.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2
new file mode 100644
index 000000000..cfa315787
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_226.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2
new file mode 100644
index 000000000..199c94f6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_227.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2
new file mode 100644
index 000000000..c432d2b31
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_228.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2
new file mode 100644
index 000000000..b25508af7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_229.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2
new file mode 100644
index 000000000..0d726903a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_23.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2
new file mode 100644
index 000000000..0ed00c66c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_230.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2
new file mode 100644
index 000000000..56f292ee1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_231.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2
new file mode 100644
index 000000000..f5af1f53b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_232.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2
new file mode 100644
index 000000000..73e9847fa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_233.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2
new file mode 100644
index 000000000..5d15c0cfb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_234.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1010"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2
new file mode 100644
index 000000000..346022b0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_235.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "0101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2
new file mode 100644
index 000000000..108699655
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_236.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "0101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2
new file mode 100644
index 000000000..cef20e7d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_237.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "0101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2
new file mode 100644
index 000000000..d96070884
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_238.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "0101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2
new file mode 100644
index 000000000..dbdb78a50
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_239.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "0101"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2
new file mode 100644
index 000000000..3379dc8a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_24.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2
new file mode 100644
index 000000000..61ce1301a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_240.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2
new file mode 100644
index 000000000..67ee8a19b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_241.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2
new file mode 100644
index 000000000..e69b914a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_242.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2
new file mode 100644
index 000000000..df8d40567
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_243.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2
new file mode 100644
index 000000000..d77438c2e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_244.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "000"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2
new file mode 100644
index 000000000..b99d747c1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_245.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2
new file mode 100644
index 000000000..ed0f77c23
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_246.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "10"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2
new file mode 100644
index 000000000..148ee3ac4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_247.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2
new file mode 100644
index 000000000..450620103
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_248.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2
new file mode 100644
index 000000000..9cae2531b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_249.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "0001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2
new file mode 100644
index 000000000..9a39f8aff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_25.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2
new file mode 100644
index 000000000..cb6ed890f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_250.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2
new file mode 100644
index 000000000..7e09ee483
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_251.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1"))
+(assert (= Bottom_1 "0110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2
new file mode 100644
index 000000000..87c09f4cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_252.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1"))
+(assert (= Bottom_1 "0110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2
new file mode 100644
index 000000000..ceeccd301
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_253.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1"))
+(assert (= Bottom_1 "0110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2
new file mode 100644
index 000000000..6276a7ff0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_254.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "111"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1"))
+(assert (= Bottom_1 "0110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2
new file mode 100644
index 000000000..1e7c34ef3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_255.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2
new file mode 100644
index 000000000..7e26424d4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_256.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2
new file mode 100644
index 000000000..2df3903e2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_257.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2
new file mode 100644
index 000000000..5142bf62e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_258.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2
new file mode 100644
index 000000000..9dd24ef63
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_259.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2
new file mode 100644
index 000000000..d5db09ddc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_26.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2
new file mode 100644
index 000000000..16b484aeb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_260.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2
new file mode 100644
index 000000000..e26d07b14
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_261.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2
new file mode 100644
index 000000000..3858cec09
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_262.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2
new file mode 100644
index 000000000..001c8ac0f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_263.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2
new file mode 100644
index 000000000..6611272a8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_264.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2
new file mode 100644
index 000000000..1d916a4fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_265.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2
new file mode 100644
index 000000000..61b90271e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_266.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2
new file mode 100644
index 000000000..7ee67201b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_267.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2
new file mode 100644
index 000000000..5065aa597
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_268.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2
new file mode 100644
index 000000000..80f0ba85b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_269.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2
new file mode 100644
index 000000000..8d699330f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_27.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2
new file mode 100644
index 000000000..6e12aa190
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_270.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2
new file mode 100644
index 000000000..39e529c9a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_271.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2
new file mode 100644
index 000000000..64b151103
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_272.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2
new file mode 100644
index 000000000..3019503d7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_273.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2
new file mode 100644
index 000000000..c7514e5d4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_274.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2
new file mode 100644
index 000000000..df852fb6c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_275.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2
new file mode 100644
index 000000000..9d4efc455
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_276.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2
new file mode 100644
index 000000000..85f93491e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_277.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2
new file mode 100644
index 000000000..70e90a88d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_278.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2
new file mode 100644
index 000000000..215f70582
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_279.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2
new file mode 100644
index 000000000..1e60a9d6f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_28.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2
new file mode 100644
index 000000000..24391f238
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_280.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2
new file mode 100644
index 000000000..122d3d947
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_281.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2
new file mode 100644
index 000000000..26c4345d8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_282.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2
new file mode 100644
index 000000000..11e4fee6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_283.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2
new file mode 100644
index 000000000..ed4c2ce3e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_284.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2
new file mode 100644
index 000000000..45b508a52
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_285.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2
new file mode 100644
index 000000000..10d5dd213
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_286.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2
new file mode 100644
index 000000000..eb03d30cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_287.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2
new file mode 100644
index 000000000..2dff30705
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_288.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2
new file mode 100644
index 000000000..f16df6dea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_289.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2
new file mode 100644
index 000000000..b7d981f6b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_29.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2
new file mode 100644
index 000000000..9ac02b604
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_290.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2
new file mode 100644
index 000000000..728d5392c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_291.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2
new file mode 100644
index 000000000..d57397ad1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_292.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2
new file mode 100644
index 000000000..46c3cfb78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_293.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2
new file mode 100644
index 000000000..19858fa81
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_294.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2
new file mode 100644
index 000000000..472a5b248
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_295.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2
new file mode 100644
index 000000000..a388d5a0f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_296.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2
new file mode 100644
index 000000000..9bc069ef3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_297.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2
new file mode 100644
index 000000000..0cbc7c57b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_298.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2
new file mode 100644
index 000000000..9080a6cdf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_299.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2
new file mode 100644
index 000000000..6d2010782
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_3.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2
new file mode 100644
index 000000000..9eb583473
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_30.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2
new file mode 100644
index 000000000..77fdc5fd9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_300.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2
new file mode 100644
index 000000000..5386ce20a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_301.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2
new file mode 100644
index 000000000..50556de99
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_302.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2
new file mode 100644
index 000000000..3cbbb316b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_303.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2
new file mode 100644
index 000000000..80c2ea7d2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_304.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2
new file mode 100644
index 000000000..aec3a3520
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_305.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2
new file mode 100644
index 000000000..b7b4c780e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_306.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2
new file mode 100644
index 000000000..7803f7a2f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_307.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2
new file mode 100644
index 000000000..1b469ba87
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_308.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2
new file mode 100644
index 000000000..9ab3c52f3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_309.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2
new file mode 100644
index 000000000..66b862f13
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_31.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2
new file mode 100644
index 000000000..569be3df9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_310.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2
new file mode 100644
index 000000000..9dc9f0ccf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_311.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2
new file mode 100644
index 000000000..67408e99c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_312.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2
new file mode 100644
index 000000000..075141e41
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_313.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2
new file mode 100644
index 000000000..e02cadc5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_314.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2
new file mode 100644
index 000000000..adf9dfa60
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_315.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2
new file mode 100644
index 000000000..664e5a9c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_316.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2
new file mode 100644
index 000000000..733662bb2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_317.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2
new file mode 100644
index 000000000..7f34d8842
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_318.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2
new file mode 100644
index 000000000..037fdfe04
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_319.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2
new file mode 100644
index 000000000..0795179be
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_32.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2
new file mode 100644
index 000000000..7048ad3a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_320.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2
new file mode 100644
index 000000000..8fbd759db
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_321.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2
new file mode 100644
index 000000000..959d5dae5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_322.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2
new file mode 100644
index 000000000..34ccf73d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_323.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2
new file mode 100644
index 000000000..6ca9c481e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_324.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2
new file mode 100644
index 000000000..ddf01d49f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_325.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2
new file mode 100644
index 000000000..5497584b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_326.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2
new file mode 100644
index 000000000..54042d8a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_327.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2
new file mode 100644
index 000000000..e3a47f824
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_328.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2
new file mode 100644
index 000000000..e0040fb28
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_329.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2
new file mode 100644
index 000000000..4572b50ac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_33.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2
new file mode 100644
index 000000000..938903845
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_330.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2
new file mode 100644
index 000000000..b393fd42c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_331.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2
new file mode 100644
index 000000000..f1d2d14d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_332.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2
new file mode 100644
index 000000000..69838b974
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_333.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2
new file mode 100644
index 000000000..09c776a5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_334.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2
new file mode 100644
index 000000000..f93a6e703
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_335.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2
new file mode 100644
index 000000000..9bd2b82aa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_336.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2
new file mode 100644
index 000000000..5bb103284
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_337.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2
new file mode 100644
index 000000000..8e5c85e99
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_338.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2
new file mode 100644
index 000000000..f073995a6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_339.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2
new file mode 100644
index 000000000..0c5086f0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_34.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2
new file mode 100644
index 000000000..71e2d9576
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_340.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2
new file mode 100644
index 000000000..d74289fe5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_341.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2
new file mode 100644
index 000000000..c1b67687b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_342.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2
new file mode 100644
index 000000000..5624abf01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_343.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2
new file mode 100644
index 000000000..4d7daa74a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_344.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2
new file mode 100644
index 000000000..c8cddccd3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_345.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2
new file mode 100644
index 000000000..0adc9ad32
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_346.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2
new file mode 100644
index 000000000..4bd700fd5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_347.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2
new file mode 100644
index 000000000..d194fef0b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_348.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2
new file mode 100644
index 000000000..4b7896ea9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_349.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2
new file mode 100644
index 000000000..6b28d270b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_35.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2
new file mode 100644
index 000000000..4730722df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_350.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2
new file mode 100644
index 000000000..a09354424
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_351.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2
new file mode 100644
index 000000000..e5a3e409d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_352.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2
new file mode 100644
index 000000000..618cc52f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_353.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2
new file mode 100644
index 000000000..0fa739b08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_354.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2
new file mode 100644
index 000000000..d55ef68d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_355.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2
new file mode 100644
index 000000000..0e9960218
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_356.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2
new file mode 100644
index 000000000..bec66ee0d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_357.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2
new file mode 100644
index 000000000..41b12ecc4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_358.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2
new file mode 100644
index 000000000..5ac07e500
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_359.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2
new file mode 100644
index 000000000..a0d85cc35
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_36.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2
new file mode 100644
index 000000000..721174782
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_360.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2
new file mode 100644
index 000000000..253ccb8a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_361.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2
new file mode 100644
index 000000000..81424bb78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_362.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2
new file mode 100644
index 000000000..44b097a6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_363.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2
new file mode 100644
index 000000000..d629d3484
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_364.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2
new file mode 100644
index 000000000..ea582a82f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_365.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2
new file mode 100644
index 000000000..d94684c5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_366.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2
new file mode 100644
index 000000000..cf47ddf75
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_367.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "101"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2
new file mode 100644
index 000000000..5ec1aba3e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_368.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2
new file mode 100644
index 000000000..c6b2fb13d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_369.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2
new file mode 100644
index 000000000..0be6d2152
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_37.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2
new file mode 100644
index 000000000..f1aaf7322
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_370.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2
new file mode 100644
index 000000000..62b2f8a40
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_371.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2
new file mode 100644
index 000000000..cd265ee16
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_372.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2
new file mode 100644
index 000000000..5cfc6cdd3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_373.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2
new file mode 100644
index 000000000..9f0b39218
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_374.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2
new file mode 100644
index 000000000..5c51e222f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_375.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2
new file mode 100644
index 000000000..5be6be0e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_376.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2
new file mode 100644
index 000000000..e8c4ece0d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_377.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2
new file mode 100644
index 000000000..0540447ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_378.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2
new file mode 100644
index 000000000..cdef576a1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_379.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2
new file mode 100644
index 000000000..87b9edcd3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_38.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2
new file mode 100644
index 000000000..d8231d574
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_380.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2
new file mode 100644
index 000000000..811795587
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_381.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2
new file mode 100644
index 000000000..ecba751b3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_382.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2
new file mode 100644
index 000000000..3428e1c82
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_383.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2
new file mode 100644
index 000000000..4b9a895fd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_384.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2
new file mode 100644
index 000000000..5664975ba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_385.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2
new file mode 100644
index 000000000..c04b46bf5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_386.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2
new file mode 100644
index 000000000..7d8ee3c82
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_387.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2
new file mode 100644
index 000000000..91ac4c721
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_388.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2
new file mode 100644
index 000000000..e25c7a8d7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_389.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2
new file mode 100644
index 000000000..eb624101f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_39.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2
new file mode 100644
index 000000000..44b181e81
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_390.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2
new file mode 100644
index 000000000..4d58ca0af
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_391.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2
new file mode 100644
index 000000000..bd9e1d4d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_392.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2
new file mode 100644
index 000000000..2a905b9d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_393.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2
new file mode 100644
index 000000000..d1b2ca8ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_394.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2
new file mode 100644
index 000000000..eca2f2e36
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_395.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2
new file mode 100644
index 000000000..d5ac0c5bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_396.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2
new file mode 100644
index 000000000..fa2b213d3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_397.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2
new file mode 100644
index 000000000..e58db78fa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_398.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2
new file mode 100644
index 000000000..1a68d3e45
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_399.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2
new file mode 100644
index 000000000..1492f5a58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_4.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2
new file mode 100644
index 000000000..9104f1d63
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_40.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2
new file mode 100644
index 000000000..b0426357e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_400.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2
new file mode 100644
index 000000000..7e06f9e6e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_401.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2
new file mode 100644
index 000000000..f9ad8acab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_402.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2
new file mode 100644
index 000000000..816dbc6c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_403.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2
new file mode 100644
index 000000000..5003434ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_404.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2
new file mode 100644
index 000000000..10f231982
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_405.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2
new file mode 100644
index 000000000..ae2e3474f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_406.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2
new file mode 100644
index 000000000..75c9e5e5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_407.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2
new file mode 100644
index 000000000..d6bfbafbd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_408.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2
new file mode 100644
index 000000000..c30588bc1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_409.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2
new file mode 100644
index 000000000..7c5da59db
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_41.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2
new file mode 100644
index 000000000..8ace755ff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_410.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2
new file mode 100644
index 000000000..9f9eb6465
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_411.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2
new file mode 100644
index 000000000..03a7dd67f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_412.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2
new file mode 100644
index 000000000..35d117ce3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_413.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2
new file mode 100644
index 000000000..3a4b4d40a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_414.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "11"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2
new file mode 100644
index 000000000..b1a0fb99d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_415.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2
new file mode 100644
index 000000000..cb386b267
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_416.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2
new file mode 100644
index 000000000..7ba7da6f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_417.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2
new file mode 100644
index 000000000..79330bec4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_418.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2
new file mode 100644
index 000000000..cdb06c5f6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_419.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2
new file mode 100644
index 000000000..a8680d578
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_42.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2
new file mode 100644
index 000000000..dd0768ce4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_420.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2
new file mode 100644
index 000000000..79a88a898
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_421.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2
new file mode 100644
index 000000000..57552384e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_422.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2
new file mode 100644
index 000000000..aee4fb795
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_423.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2
new file mode 100644
index 000000000..273f19ccd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_424.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2
new file mode 100644
index 000000000..2a7ba2f86
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_425.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2
new file mode 100644
index 000000000..334710db6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_426.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2
new file mode 100644
index 000000000..33b1ca16c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_427.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2
new file mode 100644
index 000000000..a73ed1346
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_428.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2
new file mode 100644
index 000000000..d96be8919
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_429.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2
new file mode 100644
index 000000000..d2018c43c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_43.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2
new file mode 100644
index 000000000..e2bc89320
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_430.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2
new file mode 100644
index 000000000..74827fbfe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_431.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2
new file mode 100644
index 000000000..a61ae1175
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_432.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2
new file mode 100644
index 000000000..fa5e5ef4a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_433.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2
new file mode 100644
index 000000000..38ba0e126
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_434.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2
new file mode 100644
index 000000000..9a5d35efc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_435.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2
new file mode 100644
index 000000000..ac778d45b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_436.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2
new file mode 100644
index 000000000..298e6c123
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_437.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2
new file mode 100644
index 000000000..ab13d68e4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_438.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2
new file mode 100644
index 000000000..0cafc2b21
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_439.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2
new file mode 100644
index 000000000..86a34fdbe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_44.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2
new file mode 100644
index 000000000..db4d4639f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_440.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2
new file mode 100644
index 000000000..513b2784c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_441.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2
new file mode 100644
index 000000000..05969e9d4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_442.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2
new file mode 100644
index 000000000..88df50772
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_443.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2
new file mode 100644
index 000000000..ba70afb29
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_444.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2
new file mode 100644
index 000000000..37046a3aa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_445.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2
new file mode 100644
index 000000000..eb56dc12f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_446.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2
new file mode 100644
index 000000000..cafd22b0a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_447.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2
new file mode 100644
index 000000000..618b20808
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_448.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2
new file mode 100644
index 000000000..b983d381e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_449.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2
new file mode 100644
index 000000000..f72c44c60
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_45.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2
new file mode 100644
index 000000000..bdac641a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_450.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2
new file mode 100644
index 000000000..dfcf8487d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_451.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2
new file mode 100644
index 000000000..7d006021b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_452.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2
new file mode 100644
index 000000000..f3e9b2dea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_453.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2
new file mode 100644
index 000000000..983b99c67
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_454.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2
new file mode 100644
index 000000000..fafcd2d24
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_455.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2
new file mode 100644
index 000000000..850b0a982
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_456.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2
new file mode 100644
index 000000000..fe5731541
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_457.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2
new file mode 100644
index 000000000..c2a16b7a8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_458.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2
new file mode 100644
index 000000000..6ae45f678
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_459.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2
new file mode 100644
index 000000000..ba0de77f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_46.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2
new file mode 100644
index 000000000..68849e78c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_460.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2
new file mode 100644
index 000000000..6892dc961
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_461.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2
new file mode 100644
index 000000000..8f31b4936
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_462.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2
new file mode 100644
index 000000000..f7fe286ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_463.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2
new file mode 100644
index 000000000..ac2786163
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_464.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2
new file mode 100644
index 000000000..d0a98805d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_465.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2
new file mode 100644
index 000000000..be5f103a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_466.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2
new file mode 100644
index 000000000..3ee425a03
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_467.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2
new file mode 100644
index 000000000..c3cf8257e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_468.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2
new file mode 100644
index 000000000..bf3392d3d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_469.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2
new file mode 100644
index 000000000..0d32d6ca6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_47.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1010"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2
new file mode 100644
index 000000000..207e770ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_470.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2
new file mode 100644
index 000000000..965e5cd11
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_471.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2
new file mode 100644
index 000000000..fa9e2e5c0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_472.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2
new file mode 100644
index 000000000..1c9fbcff8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_473.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2
new file mode 100644
index 000000000..533de8832
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_474.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2
new file mode 100644
index 000000000..8f40c0438
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_475.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2
new file mode 100644
index 000000000..5fcee86a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_476.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2
new file mode 100644
index 000000000..9b4b3808f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_477.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2
new file mode 100644
index 000000000..2b9bd7ea8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_478.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2
new file mode 100644
index 000000000..ac3429751
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_479.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2
new file mode 100644
index 000000000..0fe2b9913
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_48.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2
new file mode 100644
index 000000000..c59256c8b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_480.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2
new file mode 100644
index 000000000..564d6b144
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_481.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2
new file mode 100644
index 000000000..5c3f30631
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_482.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1110"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2
new file mode 100644
index 000000000..3092a9304
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_483.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "0111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2
new file mode 100644
index 000000000..8a3760d7e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_484.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2
new file mode 100644
index 000000000..c2d037a01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_485.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2
new file mode 100644
index 000000000..3088c9e2e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_486.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2
new file mode 100644
index 000000000..fa01df402
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_487.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2
new file mode 100644
index 000000000..9d5a3c392
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_488.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2
new file mode 100644
index 000000000..5565b30cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_489.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "00"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2
new file mode 100644
index 000000000..eb4c7792f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_49.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2
new file mode 100644
index 000000000..03e3de402
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_490.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2
new file mode 100644
index 000000000..60965bddb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_491.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2
new file mode 100644
index 000000000..f8fbadeac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_492.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "11"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2
new file mode 100644
index 000000000..755689aac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_493.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1100"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2
new file mode 100644
index 000000000..ed5854de4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_494.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "0"))
+(assert (= Bottom_2 "1001"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2
new file mode 100644
index 000000000..023e491c3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_495.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2
new file mode 100644
index 000000000..2870918fc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_496.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "1011"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2
new file mode 100644
index 000000000..02ab7f4ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_497.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2
new file mode 100644
index 000000000..474c2f78a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_498.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2
new file mode 100644
index 000000000..6e0ff5a74
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_499.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "11"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "110"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2
new file mode 100644
index 000000000..191e8aed7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_5.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0111"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2
new file mode 100644
index 000000000..7da18fb61
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_50.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2
new file mode 100644
index 000000000..7adaf5cde
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_51.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1001"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2
new file mode 100644
index 000000000..87c772dfb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_52.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2
new file mode 100644
index 000000000..facf29e83
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_53.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2
new file mode 100644
index 000000000..3c1220fb5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_54.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2
new file mode 100644
index 000000000..3cb5cd40b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_55.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2
new file mode 100644
index 000000000..517844bf2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_56.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2
new file mode 100644
index 000000000..4bb84a61f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_57.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2
new file mode 100644
index 000000000..a3a5b4cd8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_58.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2
new file mode 100644
index 000000000..fc5f9d449
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_59.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2
new file mode 100644
index 000000000..5b5f28acd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_6.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2
new file mode 100644
index 000000000..e8ae11e54
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_60.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0000"))
+(assert (= Bottom_1 "000"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2
new file mode 100644
index 000000000..43a2d3766
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_61.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "0"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2
new file mode 100644
index 000000000..ab398d4bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_62.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2
new file mode 100644
index 000000000..20fe00981
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_63.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2
new file mode 100644
index 000000000..7cd6109df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_64.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "00"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2
new file mode 100644
index 000000000..a8d1cbf85
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_65.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2
new file mode 100644
index 000000000..41541a641
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_66.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2
new file mode 100644
index 000000000..71b49f61a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_67.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2
new file mode 100644
index 000000000..c0d75fc19
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_68.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "11"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "00"))
+(assert (= Bottom_2 "0"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2
new file mode 100644
index 000000000..af71f4ef3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_69.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2
new file mode 100644
index 000000000..6f8d426bc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_7.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2
new file mode 100644
index 000000000..2d98e630a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_70.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2
new file mode 100644
index 000000000..6d2a203f9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_71.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2
new file mode 100644
index 000000000..09cc504f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_72.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2
new file mode 100644
index 000000000..52dcfd869
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_73.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2
new file mode 100644
index 000000000..fd30be5f4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_74.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2
new file mode 100644
index 000000000..43b347eff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_75.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2
new file mode 100644
index 000000000..7cb41ee3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_76.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2
new file mode 100644
index 000000000..ca318017a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_77.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1011"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2
new file mode 100644
index 000000000..cb5609a6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_78.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "110"))
+(assert (= Bottom_1 "1"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2
new file mode 100644
index 000000000..9adf2ab41
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_79.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2
new file mode 100644
index 000000000..394d1ab4a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_8.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2
new file mode 100644
index 000000000..5bef599a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_80.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "10"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "01"))
+(assert (= Bottom_2 "0101"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2
new file mode 100644
index 000000000..593f5b30b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_81.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2
new file mode 100644
index 000000000..18e09db59
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_82.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2
new file mode 100644
index 000000000..2b826c366
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_83.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2
new file mode 100644
index 000000000..2e6069ac0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_84.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1010"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2
new file mode 100644
index 000000000..b6485d455
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_85.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2
new file mode 100644
index 000000000..df7a780f4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_86.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2
new file mode 100644
index 000000000..11c8b5871
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_87.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2
new file mode 100644
index 000000000..937232f4c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_88.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2
new file mode 100644
index 000000000..c184b43ee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_89.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0101"))
+(assert (= Bottom_1 "01"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "10"))
+(assert (= Bottom_2 "1010"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2
new file mode 100644
index 000000000..76e8aba2f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_9.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "1110"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2
new file mode 100644
index 000000000..d2ee01e77
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_90.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0011"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2
new file mode 100644
index 000000000..be7fd04e4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_91.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "111"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2
new file mode 100644
index 000000000..1109064d7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_92.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2
new file mode 100644
index 000000000..9358d5cd5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_93.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "0001"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2
new file mode 100644
index 000000000..7e7a5a182
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_94.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "111"))
+(assert (= Bottom_1 "1111"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "000"))
+(assert (= Bottom_2 "0"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2
new file mode 100644
index 000000000..001eaea56
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_95.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "11"))
+(assert (= Bottom_2 "111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2
new file mode 100644
index 000000000..f828aff5d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_96.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "1111"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2
new file mode 100644
index 000000000..1cb11931b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_97.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "000"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2
new file mode 100644
index 000000000..724b30cbd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_98.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0100"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "00"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "0110"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2 b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2
new file mode 100644
index 000000000..36860a1bf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-pcp-string/pcp-3-4-hard/unsolved_pcp_instance_99.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of String Solvers on PCP
+Target solver: cvc5, Z3, OSTRICH
+Time limit: 60.0
+Benchmarks encoding PCP[3,4] that were considered hard to solve by the paper
+'Creating Difficult Instances of the Post Correspondence Problem'. Most were solved later with different
+techniques like Parikh Automata and Model Checking but String Solvers have not been tested.
+Most benchmarks expected to be unsat.
+Publication: Creating Difficult Instances of the Post Correspondence Problem, Further Tackling Post Correspondence Problem and
+Proof Generation
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unknown)
+
+(declare-fun TopStr () String)
+(declare-fun BottomStr () String)
+
+(declare-fun Top_0 () String)
+(declare-fun Bottom_0 () String)
+(assert (= Top_0 "1111"))
+(assert (= Bottom_0 "0000"))
+(declare-fun Top_1 () String)
+(declare-fun Bottom_1 () String)
+(assert (= Top_1 "1100"))
+(assert (= Bottom_1 "0"))
+(declare-fun Top_2 () String)
+(declare-fun Bottom_2 () String)
+(assert (= Top_2 "1"))
+(assert (= Bottom_2 "11"))
+(declare-fun replace () String)
+(assert (str.in_re replace (re.+ (re.union (str.to_re "2") (str.to_re "3") (str.to_re "4")))))
+
+(declare-fun x () String)
+(declare-fun y () String)
+(declare-fun x_0 () String)
+(declare-fun y_0 () String)
+(declare-fun x_1 () String)
+(declare-fun y_1 () String)
+(declare-fun x_2 () String)
+(declare-fun y_2 () String)
+(assert (= x_1 (str.replace_all x_0 "2" Top_0)))
+(assert (= x_2 (str.replace_all x_1 "3" Top_1)))
+(assert (= x (str.replace_all x_2 "4" Top_2)))
+(assert (= y_1 (str.replace_all y_0 "2" Bottom_0)))
+(assert (= y_2 (str.replace_all y_1 "3" Bottom_1)))
+(assert (= y (str.replace_all y_2 "4" Bottom_2)))
+(assert (= x_0 replace))
+(assert (= y_0 replace))
+
+(assert (= x y))
+(check-sat)
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2
new file mode 100644
index 000000000..fc32541ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0001.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCGCCCCCAGCCTCTAAACGTAGATCATCCTATAAGTCGTTTCTAACCTTCGCTTCGAATCGAGTAGAGAAACAACGAATGCTCGAGAAGCCTGACGTACTAACTTCTAAGTCCGCGACGCGATTGCCCTCTACGCAGGCGCTGATCCCTTGTGCGACGGCAATATGACTACACCTACTCCGGCGAACGATTACTTCCTA"))
+(assert (= z "ucucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2
new file mode 100644
index 000000000..52ae834a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0002.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCCCTGCCAGTGGACAAGCTTGGCCGCTGCGTTACTATACTCTGCTACGTGACAGGGGACTAGAAGTAGGCTGAAGCTACTTGAAGATGGGCGGGAACCGGGAAGTTTCAACCGCCGGGGACTGCTCGGACTATTTACCTTCCTTCTTCCTAGGTAGACCTCTGCAACCCACACATCACCATGGCTCGCATCGTCTTCG"))
+(assert (= z "agaaggauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2
new file mode 100644
index 000000000..4ef272779
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0003.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATAGGACTAAGGTCCGGACTGCTGCCAGGGAACCTCGAAGTGACTTGAGTATGGCTGTGACGCCTTAGGGGCCCCTGAGGGGCGTTTAAGTTGAGGTGAAGAGAGACAGTCATTGGCGACCTACTACATGTAGTACAATTTCTCCTCATAACGACACTGGCCATCCGCAAACTAATGCGCGCCAAATGGCAACAGGGCT"))
+(assert (= z "guauug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2
new file mode 100644
index 000000000..22d8b0b5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0004.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGTAATAGAAAGTCCAACTCTTCAAACCAGAGGAAAAACAGTGCGAACCGATCAGAGTTTATGCGCTCGTTCGGGTTGAAGGACATAGGTTGGGTTAGATAGGGAAGGGACGTGAGTGCCACGTTCCCGCCCTTCACTAAGTATCCTTGTACGACTCTTGTAGCTTCGGGTGAGCAGTCCGTCACGTCTTGGGGCGTAA"))
+(assert (= z "cccug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2
new file mode 100644
index 000000000..98d3e6f31
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0005.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGGGGCATCTTGGTATCCAATGTGCTAAAAGGCTGCGTTCATATAAGTACCACTCCCCTAGTGGTCAGGAACTCTGATCTACTAAGGTTGTGACGCCCAGAGCAGGTTAGATAGAGGATATCCATAACGATGTTGGTCGAGGTAATGCACTACGATGTACGGCCCCAGCTGTCGAAGCCCACCGTTTGCGTGAAGATAG"))
+(assert (= z "gccgggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2
new file mode 100644
index 000000000..709a3f0c2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0006.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCCGAACAAAATCACGAAAACGGCACGGGTAGGGCGCAACGCAAACAGGTAGTCGATGTTCATATGTCCTGTTTCCGCAATATACATGAATAATCGGCCGTATCAAAACGATTTCATGGTGATGTCTTCGGAGCGCACCTGTGCGTCTTCCACTTGGTAGTGAGTTTGCCCCGCACGACTGAGGCGCTCCAACTTATTC"))
+(assert (= z "acuuauuagccg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2
new file mode 100644
index 000000000..02f83109c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0007.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTTCCGTACCGGGAGTGCTTCCGCCAGGACACCCAACGTGGAGTTTATGAAGGCTCTGGGAATTAAGGCCTAGTTCATAGGCAGGGCGTAAAACCAGACTGTCGTCTCCCCATACAATGAGCTCGAATAAACTTGCTTAGCGACGTTGAATTTACCGAGTAACGTCACGTAAACCGACAGGTGACCGTACCTACTTCCA"))
+(assert (= z "guccuguggguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2
new file mode 100644
index 000000000..3a0aa09d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0008.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGATCAGACTGCATTAGTTTGGTGGACCATGGTAGGGATATGTTGCACCACGGGATAGATAGAAACATGACACGCCTAGGGCTCAATGGGAATGCAGTGGAGGCGTCCAGAGAAAAATTACCTGATAGCTCTGGCTCTTTATGTCTCTTCGGCCCCCCGTAAACCCGTTACAATCCAACACCTCACGGATCACAATCAA"))
+(assert (= z "uacaacguggugcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2
new file mode 100644
index 000000000..2832b4349
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0009.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACACAATCGGAGTATGATCTATAGCCATCCACGGACCAAGATAGTTTTTTGACCACGTATAATTCTGAGGTAACAATTTCGCCCCGAGCTATTTAGATTGTTGCTTTCGGAATGGTTTATTGTACGTTGCAACCAACTCACGGTATCACCAACCTACCTTCTAGTCATGGAATTGTCAGGCAGCTACTCTCGCCTTGATA"))
+(assert (= z "gauggaagauca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2
new file mode 100644
index 000000000..cf1054bb3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0010.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAGAATCTAGGCACGAAACTACCCTAGGGCTGAGCGACCCTCCTGCTAGCACAAACAGGGGAGGCTTGCTATAAAAACGTGAACGCTCTCCCGGCACTGGCGCCAGTTTTCTTTTTGGCCGCCCGAAAATATACTAAGACCGATGGGATACCACCTTGGATAAGGCGCACGGAATCACTCGCACACCTGTCTAATAGGT"))
+(assert (= z "uggacag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2
new file mode 100644
index 000000000..4ab4ce29b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0011.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCACAATTCTTGCATGCATAGTTAACTGTTCCGTATTCTGTTGAGATGTTGCTTTGTGAACGCATGAACTAGCGAGTGCATACCGACAGGCCGTACACTATACAGACCGAATTAGAAATTGAGGCCTCCCCCCGGAGCGATTTTCAAGTATTCAGGGCCCGCATCTCGGGGGTGCCTCCGCTATAGACATATCCGTTCGT"))
+(assert (= z "uggcuuaaucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2
new file mode 100644
index 000000000..6279d4fc1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0012.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGAGGTTCATGCAGCACAACGATAAATTCGAGCCCTTCTTTGCCTGGCGGTCATACCTCGGCTCGAGCAGACCATATGCACCTTGAGAGTTCCCATTGGTAACGAAAAAAGACAAGTGGATTGAGAGACAGAGACGGTACTACTAAGAACTATGTACGAGTTGAAATATCGACTACCGAGTTATCGTTTCCTCGGGTACG"))
+(assert (= z "uugcuuuuuuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2
new file mode 100644
index 000000000..27eb13a91
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0013.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAAAATGTCCTTCATAGTAACGATATCCGGAGTAGCGGCTAGACGGCGCTATCTCAAGAACTAAGTCACTACGTGCGACGATGTAGAATGACTACGAACCAATTCTCATCGGTATGCACTCCGTCTCTTTTAGTTCTGCTAGTACGTTCGAGATGCCTCATGATGCCAGAGTGTCACACGAATAGTACTGAGACCAGGT"))
+(assert (= z "cuacggaguacuacggucuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2
new file mode 100644
index 000000000..cf0c7696d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0014.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTTGTCCTCTAGACCTGGTTATCTCCATAGCTTAATTCCTGTTACCCTCGCCTCCCCTGAGTCTTTAGGGAGCTTGCATAGAATTCTAAGTCAACGGGTCGCACTGGCAAGCCGGTTCTTCCCTAGTCCTATTTCATGTGTAAAGATTGTCTATAGCAAGTCAGTTTTCTGTAGAATGCTATCCTTTGTCGTCTCAGCG"))
+(assert (= z "cuuacga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2
new file mode 100644
index 000000000..512b125b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0015.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTGTAACCCGTGCCTATACCTAATGGAGCCTGGTATTCGAACGGCTTCGTACCATGGCAATGTATACCGCGTTTTTAGAAGGACTGTCTTTCCGGGCGAGGTAAGGTATGCATTCGCTAAGTGCTCGGTAGGATAGAAGGCTGTCAGGTACGATACATTTTCTACTATGCCCCTGCTTTGGGTTCGCCCCCAAGTGAGCG"))
+(assert (= z "aaaucuuccugac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2
new file mode 100644
index 000000000..82b8f53e4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0016.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCATATTAATACTTCATGGGCTGTTACTACCTATTACCTCCCCTAAGTGCCCTTACGTGCGCGGTCTTCTCTCCGTAGAAAAGCAGTTATAGATTCGCGGGAAGTCTCGCCCAGCAAACTATTACTCTTCCTTTGTCTTATGGCTGACGAAATCCCCCGTCCGTGGTAGAGACTTCAACCGCTTTGGGACCCATCGTGA"))
+(assert (= z "auaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2
new file mode 100644
index 000000000..06f8d19f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0017.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATTTTGTAGATGAATGTAACTGGTATAGGATCTCAGCTTGCCCCCAGGAGGTTCTATGACTATTAAGTTATCCTCGACAGCGCTCGTTAGTTTGCCAGAGTTTGTGGGCACTTTAGGAAAAAGGTCAAGACGTGCAGACTGTATTAGTAGGATAAGAAGCTGTATAATCACCAACGTTACAAGGATTTAGGAGATAGAT"))
+(assert (= z "ccgugaaauccuuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2
new file mode 100644
index 000000000..4cfd390f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0018.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGATTAATTATTAGACAGTAATATTGATCCGTGGGCACAGAAATACGCACGTTTAAACCGTGAGCTTCAGGGGTATCCCCAAATTGGGCCCGCCCTGAAACGGCTCGATCAGGGCAATGCTTGACCGCACAGCTAAGAAGCTAATGGAGCTCTTCGGCCAGACGCTATGAACCGAAGCCTACTGAGCGGAACCCGTAGA"))
+(assert (= z "ucccguua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2
new file mode 100644
index 000000000..7aeaaea31
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0019.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAATCTGTACGGCGACTTTATTTAGACCGGACACTAGTAACACTCCCTTACCGTTGATACCCATCAAACGGGGTATGCGCAGTGGTTACAAAACTCATTGTAACACGACTAAGAGCCCCGACCCACAATTTACGTCATAATTACCACAACGCCTTCTACTTAAAACAGTCGAATGACCTAGCGAGGTCGTCAGAACCTGC"))
+(assert (= z "aauguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2
new file mode 100644
index 000000000..0f0c4137f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0020.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGGCGAGACGGCGGGTTTGTGCATAGTCACTGATTTATAGGTCAGCAGAGCCGGCCAAAGATGGTGCACCTATTCCCCCGATTTAACAACCGATATGATTTTCCTCATGAAGTGTGTTCGCATCCGTTTTGAAATATCAGCGCGGCGCCTTATAACAGCGCGTAGTCTAATGCCAACGAGAACGAGTACTGGGAGCAGC"))
+(assert (= z "gcucaugacccucg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2
new file mode 100644
index 000000000..190d6e59b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0021.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGCCAATGTTCGCCTAGCACACCATACCATTCCTTTTGAGACTTTAGCAGCTCGCAGGTGAAGGAGGTTTTTATACGGCCAGTTTTCCGGTATAGAGCAAACCCATAAGACCTTCTATGCATTGAATGGCGTCTTATTATGAGGAGAGTCGACTGTCCCCCGTAATGGTTTGCTCTGACGTATTCGTATGATGCCTCCA"))
+(assert (= z "aaaacuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2
new file mode 100644
index 000000000..463047643
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0022.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGTACTCTCTTTTACCAATGCCCACGCCGCCCGTGGTGCCAAACTAATCCGAATCCCCCTAGCGACCGGTGGGGTTCTCAAATTAGTTTTTACCGCATGCGCGAGTATCAATTGCTATATTGTACCACGTAAAAAGGATAGTTTCCAACAGGCAATGCGCTGATTGGACCCATGCGCTGGGCCAATGTTTCTTGCCTAC"))
+(assert (= z "aaaugguuacgggugcggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2
new file mode 100644
index 000000000..badf4ae9b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0023.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTAGTGACTGTCGTGAAGCCTGCTAAGAACCGGGTAACCTACCGAACGAACGGGCACATTGCCGACTGTCTCTTAGTCAGAGGGTCCGAAAGAGATCAGCTACCGCGTCCGTCGCGCACTGGCCGGCGAACCTCACGAGTGGTCAGCTAGCGTGCAAGCCGTCATAAAATCCGTGCTAGAGACGTGTCACACATAAGCAG"))
+(assert (= z "gcccauuggauggcuugcu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2
new file mode 100644
index 000000000..7ce53398e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0024.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAATGCACTCCTAGGCCGCATCCATCGCATACGAGCCGTCATTAGGTAGAAACTAAGAGCGCGCACCTTACAGCGGCACAATCCGCATAATTGCAGTACGGGAACCGAGTTAGTAAACTTAGCCCCCCTACGTACGGCGTCCATGCACAACCACAAGAATACTACATATAATGTGCTCTGTTGTTGCCAGGGCCTATGA"))
+(assert (= z "ugaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2
new file mode 100644
index 000000000..01604c661
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0025.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGAAGATTTGCTCTTGTTTTACGGTGGCTCAAACTCGCACAGGATAATCGAACGATCTTACGCTGTAGATCTCATTATGCTGATCAAGTTATCAAATCGTTTGAAGTTTGAATTGTGTGTTAGGTTAATAAGGAGCGAAGTCGGACCTTCGTCCGCAGGTTTTATTTGTCTGATCCCCTGAATAAGGTACCCGTCTAAG"))
+(assert (= z "uauuagcuugcuagaaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2
new file mode 100644
index 000000000..b74674015
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0026.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTAGCAGAGACAGTGTAAGCTCTCATGGTACATGTCCACTATTGGGTGAGTCCTTCTACCCGTACGAATGAAGGTAAGTAGAATGTACGGTAAACGGATGACGGGGCGGTCGAACTAAAACTGGAGGACATTAGATCCACCAGTAAATAACAACGCGGCTATTCTAAAGGACTAAAGGGTCATTCACCACCTTGCTCGG"))
+(assert (= z "cauuuauuguugcgccga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2
new file mode 100644
index 000000000..3e7471d15
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0027.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTTCACCTAACTCACATTGTGGTCACAACCTACTTAAATATCAGACGACCGATCGAATACAGCTGTGTACTTATAACCTGCCTTCTCCTACTGGCGATACCCACCCCATGTAGTCACTGGCCGTTCAGTTGCACGGAACTGGCAAACCTCACACGCTCTCCGACATGAACGGCTAGATCTTATCAAGCGCTCACTATCT"))
+(assert (= z "gugggguaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2
new file mode 100644
index 000000000..7e397d2c3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0028.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGTTTGTCAGCGCGCTTAATAAAACCTCGACCCTAGAGCTATGACTATTGATTAACCTACGGGATTACCATCATTTGTTCTTATACCCCTATATTAGAAATATTGTGCGCAGGCCTATACGAACGAATTGGAAAAATATATCGTCTGTCCGGACCTGGACAAGTCAAGGACCGAAAGGGTTCTTAGAATCGCGGCACCA"))
+(assert (= z "uuugga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2
new file mode 100644
index 000000000..b3600052d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0029.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAATACTTTCCCCGGTCATTCCGGTAGTCTAAAGGAACAAGGTGTGTCACCACCTCTGGGTGACTCGCGCGTTGGACATCACGCCAAGTGCATCAATTTGCCCCAAGCCGTTTGCATTAGTTTTCTTCATGACTAAGATGTTTGCCGCAAACCAGTAACTAATGCGCTTCCACGCTGTGGTTACCATCGCGCTGCCAGG"))
+(assert (= z "auuuccuuguuccacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2
new file mode 100644
index 000000000..dbb159338
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0030.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCCTTACTGAGTTCAACCTGGGATGCGGACAGGTGCGAAATTACTTAACACAACCTAAGCAAAAACCCAAAAGAGACCAGATAAAAGGTAGATTTGCATAACCTTCTACATTGCCGCCTGAAGTTGGCAAAATAAAATACCCTATTTTTGAGAAAAGTCAACGATCACTACATTCTTGCAAGGGCGTACATCAAACTGG"))
+(assert (= z "uuuuauggga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2
new file mode 100644
index 000000000..f5c673a05
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0031.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCTTTCACTGAACACAGATCGAAGATTTTAAGTGAGCGTATCGACAGAATGTCACTGCACTTCAAAGTTGGGGAGCCGAGCGCTAGTTCGATTTTGGCACGAGTCGTCCGCTCTTTTCACGGACTGTTGGCTCCCCACAACTGCTCTACGCTGTCAACCGTGCGAATAATAGTGCAAATTGTCCACATGCCTTGAACTC"))
+(assert (= z "cccuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2
new file mode 100644
index 000000000..67ba40cd6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0032.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGAGTTGGGAATTTTAGGCTTCCCTGAGCTGCTCGAGTCACTAGTGGGATTTTTTCGCAGAAATATTACGGCAACAAATGCGATGGCGGGTCACTGGTATATTCACCCGACCCTTAAAAGATTGCCGAGCAGGTCTTGTGGTAGATCTGTCTGGAGGGCGGAATTACGAGCATGCGACCCTTGTAACTCTCGTTCTTAGT"))
+(assert (= z "uuucuaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2
new file mode 100644
index 000000000..39e4cdb59
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0033.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCCCCGTGCGTCCGGCTTCTCCCCATGCTGAAGTATGGTATTTGGTAAGCAGCATAACCGGGTTGAGTCAAACATCTTAAACTATTCAACTCTCCAGCTACTTTAGTATTTGTGTCTTCCGTATCTTTTTCCCTTGCCATTTCTCAACAGGAAAGCACCTCGGGATACCCCTGTCCCGATATAAACACAGAATGGAAATG"))
+(assert (= z "cguauuggcccaacucag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2
new file mode 100644
index 000000000..e383a81fa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0034.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACATCCCTCTGCTAGTCCATCATAGGTCGTTCTGGTTGCTCTAAGGCATATCTGCTCTCCCTCTTCCCAAAACCATCCGAAATATCAGGCTACGTGATGGGCTACCAAATAGCAGTCTTTTACTGAGAGAGACGATGTGTGATATAACCACGGAATAACTCACGCCTCTTGTGTCGATGGACACATTTCTCTAAAACAG"))
+(assert (= z "aaugacucucucugcuaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2
new file mode 100644
index 000000000..87a0eb43e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0035.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTATCTGTGTGATCACCAGCACACTCGAGTCTAAGAGATCTGGTAAATACCAGCGGTAGGTCAATCATGAGATGGCGCTCACACCAGAACCGGTTTTGGACAGCGACAACAGGCGCTCCCCTAATTGATGTTATACCCGAAACAAGACCATGGCTTTAAGTAATCGTAATGTCCGAACACGGAGGAGGTTTGGTTAGTGC"))
+(assert (= z "cuagaccauuuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2
new file mode 100644
index 000000000..9838ea722
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0036.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCCTGCCGGTAAAAAGTTGTGTGGGTCAGCAGTTTATTCGTGTACTATTCAAGGACAGTGACTCAGTGTCCTGTGATAGTTGCACCCGATAAGATCCATCTGCGATCGTGTTTCAACCTGTAACAGGACTACCCCGAGTTCCGTGTAGGCCTCTAGTAATTCAACCAACGGTGCATCCCTCAGCCGATGTCAGGAGAGA"))
+(assert (= z "uuggacauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2
new file mode 100644
index 000000000..306bdbc57
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0037.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTATGTTCCTAAAGAGACGACGATTGCCGAACGACTTTGAAAACACTGACTTTAACCGACTGGCCGCAATGTAGAGACCATTATGAGGATCACGTACCTATATGAGGCAGAACATTTACGCTATCGCTTCCATGGCGTTTGTGATATGGTTTTAGCTTAGTCATAAATGCACGCGAGCGATGAGCAGAGCTGTAAGGTG"))
+(assert (= z "cgucucgacau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2
new file mode 100644
index 000000000..f15b32cc9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0038.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCGTCGCGTTGCTAGAGTAACTTGAACGTAGCTCAGGAAGGTAAGGGACGAGTGTCGTCTTCGCCCGTGCTTGCATCTTTCCGGCTGTGGCCTCTAAAATCTTTGTCACAAGCTTTGCGTCTTTTTTCTGGATCAGCAAATAACCAGTTCCTCACGTAGCAGCTTCCGGTTAGTAATTATTACTATGGTTTGGCAGAAT"))
+(assert (= z "ggccgacaccgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2
new file mode 100644
index 000000000..837d9274f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0039.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGATTTAGTCTCTGCCATTCTACGGAGAACTAGGCGTGGGGGATAGTGTAATAGCGCCGATTCGGGGAGTCGGCTAACGGGAGCTGAGGGTGAAGACGGTCGCAAGTTCAATGGTCAGTTTATCACTGGTCTTAGGCGTCGATACTACGTACTTCAGAATGAGGTGGTATTATTTTACTAGAAGCCTCTAGGTAGCGGAG"))
+(assert (= z "cugcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2
new file mode 100644
index 000000000..647f4b74a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0040.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCACGCGCTGGAACTAACGCCACGATCTTATCGGACAAGTTTGAAGACAAGTCAGGCGCGTTCGTCACGCATACATCGAGTGCCGGCACCGTGCCCTAGGGCGCAACACCGCAATTCGTTGGGTGGGAAGCTGACTACTCACACGGGATTGGGGCGGATTACCACCACTCCAAACTGCCTATTTGTGTCGAATGCGCAT"))
+(assert (= z "accuugauugcggug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2
new file mode 100644
index 000000000..5ce3bf0af
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0041.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAGCGGGCAGTGACGGGCATCACTCGAGCTAAAAGATACGGAGTAAGGGTGGATAGGGTTCTCAGTCACGTTCCCTCAACCTACATCCGGGATGTTGATCATCGAAATAGGCACCTAAGAACGCGGGAGGGATGCCGTTTGATATTCGGATGAGCCTTGTGGCGGGTCAACATACAGGGGGGTGTACGGCATTTTCACC"))
+(assert (= z "uacaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2
new file mode 100644
index 000000000..9f457637a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0042.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCAAATACGGATCATCCCTTTACTAAGTCCCGGATGGTGGACCCGGGATACAGCAATCAAAGGGGTTCATATAACAGGGCGGCTCTATCGTATTGAGGAAATCCCATTACTGGATGTCTACTCTCGAGCGATGAGTCAGACTGTTTAGGCGGATGCCCACCGCGCGGAAGACAATTAACAAACGGGTATTGTGCGATCAG"))
+(assert (= z "cgcuaguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2
new file mode 100644
index 000000000..13c4e6505
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0043.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCGCTTTCCGCCGATTCTGGGTAGTTAGGGCTAAGCTCACTGGTACCACCCTTAGGGTATGCGTCACTTGTGCACACGTATGTTATCAACATACTTCGCATATAGTTCTTGAACCATTACTGCACAAATATTACAAGGTGGTGGTCTTGGAGATTAAACGCCCGGCACTCAATGCACGCAGGCGATTCTAACTCAAGGT"))
+(assert (= z "auucgagugaccauggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2
new file mode 100644
index 000000000..58ba64ccf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0044.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTTGTTCCTTGCGCCACAACAGCGCCTGATTATCTGGGCTATCAGCAATTTTATAAGGTGTCAAACGGGCTACATCCGGGGCGGACGTAGCCTAATGGGCGCCTGTCTCGCTCGAGAAGGCACGACATAATCCCCTCATCTGCAGCCAAGGCAATGATAAACGCTCGTCTGACTTGGTCAGGGAACAAGAGCTGAAGAT"))
+(assert (= z "uccacaguuugcccgaugua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2
new file mode 100644
index 000000000..2073dbe22
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0045.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCAGTACCGGTTTTGAGCCTGTAGGATTGTGGGGTCACCTACGACCGCACCCACCCAGTTCGACGATTCCTTCGCCAGGGCCTCGATCCCACTACCCATCAGGCGCGACAATCTTTTAGAGCACATTAAACTGCCCAGGGCTCCCATCGTCGTCCAGCGATTGCCCGAGTAAAAGGGCACTGCGAATGTCAAGATGTCT"))
+(assert (= z "gugacgcuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2
new file mode 100644
index 000000000..ff71295f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0046.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGTAGCCTTCTGCGTGAGGTCACACATCCGCGGGGTGCTCGGCCACGGAGCCCCCGCCTCCGGGAGAACCCCGGTTTCCGCGTGACAAAGCCGGATAGTGTTTAGGTGGCTGACCCTAATTAGTCCTCAACAACAACTCGGTCGGAGTATACTACCCCGAAGTAAGTTTATCTGTTAGACTGTTAGCAGACGATATTCA"))
+(assert (= z "gacugggauuaauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2
new file mode 100644
index 000000000..56829187b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0047.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCCTGTGTTACCGGCTTCGCACTACACATCAAACAAGGATGTTTATGTGACTTTTGATCGCTACTATGCAACACTCTCTCTCTCGCGCGTTCCTACCACAAAGCGTCTGATTCATACCGTCCATCGTAGGAATCGGTTGTCTCCCTGACCCAACACAGGGTACCAGGCAAAGTTCTTCCTTCCGACTATAACCGGCTCT"))
+(assert (= z "ugauauuggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2
new file mode 100644
index 000000000..c3f506d10
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0048.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTGCTGACCTATTAGCTTTTTCAGGATCTAACAAACTCGATCCGTCCGGGATCAATTGGACTCGGCAAGTCCATGCCTCGTACTGCGACACGCCAATAACCAAGCACTAACAGGATCACCTTGGGAGCGCATTACGGTCTGTAGGTTGTATCACATGCCAGTTACCTTTCGATTGACCAATCCCTATCGGGTTTTTCGT"))
+(assert (= z "auuguuugagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2
new file mode 100644
index 000000000..a2f97cf7d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0049.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTTGAGGTAGCCTGGATCGAGGAGGATTGGTGCAGTGTGCTATTGTTTTTCATTTCCCAGCGCAGCGGACCTTGCCGAATACTCAAGCACGGGTACCACATGGGCATGGGGGGGTTAAGACTACTAGCGCTAGTACCTCGAGGAGGTGTACCCGGGCTTCATAAAATTAGAGAAACTATTTTGGAGGTCACTTCCATTA"))
+(assert (= z "cccccaauucuga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2
new file mode 100644
index 000000000..9669b768d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0050.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTTGTGTAACAAACACAATTATGGCTACCTTCCTGTCGTTCTCGTCTAGAGAGGAGCTTATGTGTCCATAGCGCTCCAAGATCTACCTAATGCTCGTTAGCTACAGGAGAGCTGATGGCGGCCTTCTTATTGATCCAATACGATAATCATAAGCGAATAAGTACAAGTTACATGGATTACGGTAAATAGTAAGGATCCG"))
+(assert (= z "uacacaggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2
new file mode 100644
index 000000000..148062b52
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0051.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGGGTAGCCTAGGCGTGCCATGGCATGGATGCTGGCGATACATCGTTTCTGCGCCGCGGGGGGAAAGGGGAGTCCTAGCTTAACTTGCGGACTATCCACGACCCAGGTCACCAGTTTCCACACCGGACAGCGCTATCACTGGCTAAAACGCCGCTTAATTATCTCTGGGCAGAAGAGATTCCAGGGTAAGTCGTAATAA"))
+(assert (= z "cccauucagcauua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2
new file mode 100644
index 000000000..ea28e4f6f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0052.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGCTTTTGATGTGTTTAAGTTAACTAATTGGCATCGTGGCATCGCGTTAAGAAAATTGTCCAACTCTATTGAGTGTCTCTATGAGAAAAGATGAATTCTACAATTCTCTAGGAGGTCGCCCTAAGAGCCAAAATAGTGCGGTTGAAGTTCCGCATTCTCTATGCCTGTCTACGAAGAAAAGGGTTGCTGGAAGTAAGCA"))
+(assert (= z "gcaauucuuuuaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2
new file mode 100644
index 000000000..cd2e1c98a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0053.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGCGGCTGCGCGTTGTTTAAAGTCTAAATAAAGACGCGGTTCGAAGAAGAGTTCGCAACGATTGCAGTAACGATGAGATGCTCCTAACTGCCCCACGATATACGGTGTACATAGAAGTCGAATATCTTCCAGAGTTTCCCCGCTGAAAATACACCTCAGGGGCCTCGAGCTGGGCATCCAGTGCGATGGCCTGGACACC"))
+(assert (= z "cgcuaccggaccug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2
new file mode 100644
index 000000000..a98d3db0b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0054.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGATGTGCGGGCCTGTGTATGTCACTAATGGCAGTCTATGAGACATATTTGTTATGGTAAGTATGCTCACCTAGCCATAAGTCGGCACCTCCGCGGGGTTCGAAATACTGCGTGGGCCTACAAATCTAGTTGACTAATAACTAATTGGGACCAGCCTGCGAGATAAGATTACGGACTCTTAATCGGTCTTGAGGAGCCAT"))
+(assert (= z "acgcccggacacauacagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2
new file mode 100644
index 000000000..6a196669a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0055.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGAGGTGCCCACCCCAACCCTCATTCCAGCCATATTACAGCGACCTGGCCGCAACGGTGGCGACAGTCTCAACAGCCGGGCTGGGCGCGGCCTTGGCTAAGCTTTTTCTGTCGGTTTTAACTCGAAAGGGGCCGGCCTATGGAGTCTGGAGCTGGAGAATACCCCGTTAGCCGGCCAAATCAGCTTTAAAAATATCTGAG"))
+(assert (= z "cacgggugggguugggagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2
new file mode 100644
index 000000000..9689465ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0056.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTTTGGCCAGTGACGTATCATTGGTAACCCCATTGGGAGCCCAAGTCAGAAATCGCTGCCACAGCTGTTGGTTCGGCGGCTTAACGCTACCCGCTCCCGGCTTGCTAATTATTTGAGGTGTTGGTAACTTTATCTGCTGACGGCCGCCCATAGGGACCGCGGTATGCGCTTCAAGGTCGAAGCGGCCTTTACTCTATAA"))
+(assert (= z "gucacugcaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2
new file mode 100644
index 000000000..8c1ca8ad9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0057.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCGGTCCCACTTGGCCTCAAAACGCACGGCATGAAATGTCAATACGAGATTGGACGCCTGGGTTACCGACGAACTTTGGGGTTATGCGTCGCCATGGTTAAGTTCCAGTTTTGTCCCAAGGTGAATTATTCATTCACGGGTGAGACTTCTCAATGCTTCCCACGTACTTTATCGTCTTTAGGGTGGTATGCTGTTAAAG"))
+(assert (= z "ccacuuaauaaguaagug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2
new file mode 100644
index 000000000..1c02b6895
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0058.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTGGGGCTTATTGTTTGCCAGCACTTAATGGTCGGCTGCTCGGTCGTCTACAGCTTTGACGGATAATTGAATGTGTAGATCAAAGCCTCCGCCGGAAGTAGAGACTCATAGTCAGGGGTATAGCGCATTTCGGACTTCACAAACTATTGGGTTAGTAACGGAGGTATAACCTCTTATATGTCACCGGTCGACTCTCTAA"))
+(assert (= z "ucugaguauca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2
new file mode 100644
index 000000000..1fbd5865d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0059.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCAACCCTATCTACTTATTCAGCTAAATCTTTCTAACATGGAAGAGGTCGATCATGTACCATATGTCAGATTGAAAGCGCAACCACGCCGGTTCAAGGGTAAGGAAATACGATCACTGTGCGGGGTCGATATTTGAGCCCGACAAAATGTCGGGTCAGCTCCCGTCTAGTCACGAATCGCCTAGGAGCAAGGCAAGCTC"))
+(assert (= z "uagaugaauaagucga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2
new file mode 100644
index 000000000..a8f5f8fec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0060.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATCCATAATGAGCCTTAGGTATTTCGGTACTTCAAGGTGCGAACCATTAACGGCGGAAATAAATTAGAACTTCATTGTCATCCCGCCAGATAGTCAGTAGTCAACGACCTCGACGCGCGATCCCCATGAAGGGACGCAGGGGCGCCTACTGATTAACATTGAATTCAATGATTATCCAGAGGGAGCCGGTCCGAAGCCC"))
+(assert (= z "gucucccucggccaggcuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2
new file mode 100644
index 000000000..9bc6c9d14
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0061.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCAAGGACCATCCAGCTATCGCTCTCACACGCTCATAGTCGACCATCTCCTCGTAAAGGCCCGGTATATTTGCTACGCTCCCCCGTGCGCCTGCTATTGAATAGGTAACCGGCCACGATCAGCATAATGCCTTAAGTAATAGATTACAAGCACCGTGGGGTACATTCAACACCGAGCGCAAGACGTTGTATCGAGACGTT"))
+(assert (= z "uaaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2
new file mode 100644
index 000000000..1ec2c9ea9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0062.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTAGCACGTGTCAGCAATAGGCAATATGGTACTTTACCGACAGATTCTAGAGGCAACCGGTAACCCTATTATGTTGGTATAGTGCTCTATTCGGTTTAGTAACGCGCGTAGCTACCGTCCCCAAAGCGATATAACTACGCCACAACTTCGACCGACACGCATCGAGAAACCAGCGTTAGCCCCGCAGCTTGTGGAATGT"))
+(assert (= z "aagccaaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2
new file mode 100644
index 000000000..d8482e04f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0063.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTACCTGTATTACTGATGTTATAGTTGTGTATGCGTCGGGCGGGTCCTCCGCGCTCCCCTGGGCCATACCAATGAGCAGATACAAAGGCTTTACTACGAAAAATGCAGACCTTAACGAGTAGGTCGGCAGTATCATTGCTTTAAAAAACTTACAGCTAGACAATCAGGATCGCTGTCACCGCTTTGAACTGGCCTGGACC"))
+(assert (= z "uggcgaaacuugac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2
new file mode 100644
index 000000000..35d2fa6e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0064.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTCTAGGCCAAAGTTGCTCTACCCCATTCACTGTGAGTGCGTGGGTGGGTCTTATCATGCGAGTGTAATATCATGTCCTAATGTTAATCTGCTTAGCGATCGGGGCTGTAACAGGTCACCAACAATCGAACTAATATGGACATCCTGAGATTTGTTTGCTCGGACTCTCTCTTTGTTGACTCGAAGTTTGGGATTCATG"))
+(assert (= z "aguacgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2
new file mode 100644
index 000000000..7c71701b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0065.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATGCATTGGATATCAGTCGGCGTTCCCTCATTGTACAATACGGCGTCGGGACGACAGGTTGTCAGTTGAGACGAGGCTACGCGTTTTAGAGTCCATTAATATCAATAAGACACACTCGGATATCCTTGAGCGACCCCGTGCTTTGGGATTCTCCGCAATCAAGGGGCTTAGCGTTTCATAGTGGTCTGCTCGTTATCAG"))
+(assert (= z "auagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2
new file mode 100644
index 000000000..68400223e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0066.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCTTGTTCGCATACACAGATAGTTGAGCTGGGTTCGTCAAGGGATAGTCTTCTTACGTCCAACAGGGGCACATACTGCGCTTTCAGAGCCTTTGATGATTGTCCTGGTGATGGACGTGGAAACCAGTATCCTTCCTTCCAGCACTAATTAACACTGCCGCCCCGGCCCGCCTAGGTCGATGTCCCACCGGGATCGACGAC"))
+(assert (= z "ccaagcaguucccuauca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2
new file mode 100644
index 000000000..ed5a107ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0067.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCGACTGGCCCCAACCAAAAAATGCAGCTTAGTAGCTCCGGAAAAAACCGGCAGTCCTCCTAATACCTCCCCACATGCAGTGTGGGCCTATCTATAAGCCCACGGACACCGACACAAGACGATGTTGCGTAACGAGTGCATCCACTCCTCAGAGGTGTCGGCAACGGGGTCAGACTGTGTGTTCACTTCCTGATACGAG"))
+(assert (= z "ggauagauauucgggugcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2
new file mode 100644
index 000000000..106d014ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0068.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCATTCGAGCGCAGATGCACGTGTGATCCAACATGTGTAGACCAGACGCGGGCGCCAATAATGTGCACTGGGCCATTAAGAGGGTAATTGCTCGTTCACACGAGCTTGCTCGTAGCATTAGTCATGTGGGCTTTGTTCGATCACTCATGTTTGCCTTCTTGATCCACAGCTGTACGAAGTTTATGATCCCTACAGCCGAC"))
+(assert (= z "caaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2
new file mode 100644
index 000000000..f831ed645
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0069.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCCTGCGAAAACGTCCACGAAACAAGCCAAACTGACATCGCAATAATCCTCGACTGTACGTCCAGGAGGAGTGACGCTCTGTGCGTCCGAGAGAGTCTCAGAAAGACCTTCGTAACGTGAACAACATACCCGATCAATTGTAATAGATCCGGCCCTGTGGCGCTTCGCATCCCAGTTCACCTCTTGCTCGGGTGTACAA"))
+(assert (= z "ggugcuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2
new file mode 100644
index 000000000..71f4afc0e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0070.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTCTATGACCAGCTTGTCCGCTTGTCCACCAGCCCCACACGCAAGCTACCCGTGAGTACTGCGAAGGATAAGAGAACAGGCGGGGGAGGTTGAAGTTACCATGCTGATAATTGTGATAGTGCCCATTCGAAATACATATCGCTAAGAGCACCACCAGCGACCGGGTTAAGTCCAGTTAGGTGCGAGCTATCCTGCGCCC"))
+(assert (= z "uucgauggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2
new file mode 100644
index 000000000..bcafb0fd2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0071.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGCTATCCGCACGGCAGCCCTCGAACTGGCCCAATACTATCTGGTCCCGCTTCCGTACCCACGTCCCTAAATCATACATCTAACATACCCTCAAGCTGAGCTCTACAATTGAAAAGGTGGCCTGCGATTATCCCTCTAAGTGGTCATAGGAAGGGTATTGATCTCCAAGGTCTGACCGTTTTGGATTTGCGCTCGGGCG"))
+(assert (= z "cgugccgucggga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2
new file mode 100644
index 000000000..d62e72c78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0072.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATGTGCATGGATTCCTTACGTCAGCCAGCAACAACTACTAAGTGCTGCTGGTTTGTCATACGTATTAGTCATCGCAGAATGGTACAACCAGTAGTAAGCTGTGCGCTAATCTGCCGTCTGTCCAGACGGGGTGTTGCTACTTTGGGCTTTGGTTTCCAATTTACGTGTCCCGGCACTTGTTCCTGTGCCAGAGATTTCT"))
+(assert (= z "augcagucggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2
new file mode 100644
index 000000000..63b341ca9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0073.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTTCTAAATCGGCTTCTGAGGTAGATCGTACCCCCATGTCATCACGTACGAGACGAGGTGAGTGACCGTCACAGTTGCGAAACCGTGCTTCTCAGCAGATTCAGTAGCATCCGTCACATTCCTAGTACGGTTCATTGGCTGAGCGCGGCCGTCATGCCAAGACTGGCTCAGATGCAACGTAGTAATGAATAATGTAACC"))
+(assert (= z "ucgucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2
new file mode 100644
index 000000000..e36511fba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0074.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCAATATCGTTCGGGCTACGGAAATTTGGTGCCAAGCCGTACGACCGCCAGCCTTGCGATAGCGTCGGCGCGCACCGCGGTACGGCCGTATGGGTATACCTTGAGTACGTCCTGCCGGGCGGCATAGAAGGCACTGTTACACCACCATAAACAGGAGCCTTATATAGAATCAAGGTAGGTACATTTCTAGCGAATTGGT"))
+(assert (= z "ccauccaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2
new file mode 100644
index 000000000..95cd7fd85
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0075.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTGGTGATGCCAGGTGGACTGAGTGACGGGACCTGGGTCACAATACCAGAGGCCTGTCCGAATGCGCGAAGGACAAGGTTTAATCTTATCAATTCTACGTCTACCTGTTCTCGTGCTCCCATCCGACATCCTTGCATTAGTCCGCGTATTAAGGCGCCATACGCTACAACACGCCAGTGCGGATTGGGTAGTAATTTCG"))
+(assert (= z "guuauggucuccggacaggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2
new file mode 100644
index 000000000..b7d376ffc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0076.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTTCCGGTTTTGGGACTGAGCCGTCCCTCGCTTAAATATGCTTTTGAGAAACAGATCTTCGTTGAGTCGAACGCACGCAGGAGCAAAGGAACCGCCCTTGCTCTAGGTACGCGTAATTGGCCAGAGCGACCCCCTTTAACCACGGCTGCTATGTCAAGGTCTAAATAGCTGCGGCCCGCAGGGTGTCAGCCTCCCGTCA"))
+(assert (= z "gucuagaagcaacuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2
new file mode 100644
index 000000000..adb17ae05
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0077.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGACACCGTAGTAAATTCTACGCGTCTAGGAGTGGCTTTACGAACAAGGGGAAGACCTTCAGATCTTCACAAACGATGAGTTGATGACGCCTCCGCTAATGATGCTAGCTGACGAGGCAACCTGCCTTTCACACAATTAAAGAACACATTCTTCCCGTCTTTTAAACCGGCGACGATCCTGTACGTAGTCAATGATTGA"))
+(assert (= z "cggaaaguguguuaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2
new file mode 100644
index 000000000..c4841f813
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0078.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCATATGTCGTTAAAGCGGCATAAATAGAATCTGCACAGTGCACGTAACTCAGAGAGTGCTATCCCTGGCGGGGAAGAAGGGCCGTTGAGTAAGGAGTACAGAACGGCTCGATACGGACAGTCCTGCCCAGCAAGTGCTTTTACGAACAGACTCCAATAAAGATGCTTCATTAGTGTGTGCCATTTGACGTTTCCCGAA"))
+(assert (= z "cgggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2
new file mode 100644
index 000000000..4e8f59d4a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0079.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGGGGACGTAGGCCCTCCCTCGGCACTTTAGCGAGCATGCTCAGGTCCCATTGGCCTACTAAGATAACACCTGGGTCCTCGGGTGACTCTTGTCGGTCTAACTTCAGCAGGTCGTGCGGCAGAGCGGAAATGATATAAATATTATACGTACCTGCTTGATAAGCAGACTTCCCCCACTTGCTAAGGCACGTACGCACCT"))
+(assert (= z "acuauucgucugaagggggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2
new file mode 100644
index 000000000..501a262eb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0080.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCTTTGGCTGAAGTGCGGTATTGCGCGCCCAACTGCTCTGCTATAACATGCTTCGTCCGCCGGACGACTCCATTGAGACGAAAGGGCTAGACTGCGCTGCACACCAAGTGGGGTACACCCTGATCACGCGGTAAGATTTAAGAAGGGTGGTACGTACTGTGTATTACTCGAAGGTACAATCGTCACCATAGTTACCTCA"))
+(assert (= z "uuagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2
new file mode 100644
index 000000000..02d9abbf8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0081.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTCCGTAAGTCTTTAGATCTGCTCGCTAATTTCGCAATAGCCAGAACACGCACTGGACGAGCTGTCATTAGCATGCATCGCTCAAGTGTTATGTTCTAGACGATTAGTCGGGGATCACCATTCCTCCTCGAGTAACCACTCCGAGCGGGCTAGGCGCTTAGATGACATTCGATCCACCGTTCCCCGGCCGTTATTAAGC"))
+(assert (= z "ggcucgcccgauccgcgaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2
new file mode 100644
index 000000000..bb7cdb0ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0082.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAAGGCGTGGTACCCGCGGGAACACGGCGTAATTGACTGAAAATGGCCCGGTTTTGGCCTTGTTAGTGCATGAATTCACGTGAACAATACTCGCGCAAGGATACCGAACTTGTCATACCGTAATAAAACAAGAAGGCCGCGCTGATGTTTTTCCTTGTTCTTGTAGTGTTCAATTTCATAGGAAGGAACCCGAGACTCG"))
+(assert (= z "uggcauuauuuuguucuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2
new file mode 100644
index 000000000..9839e964d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0083.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTAAAGTACGGTGCGTGGTATCATACTCCTGGGCATGTCCATTAGGACTGACGGCAAGCCACACGTCGCGCAGCCAATCAATTCCGTTTAAAATGAGCGCGACAACCACTTTCGCATACGGTCACGTCCAAGGATGTATGTGTTAAAACGTGTATGCTATAGAAAGCCTCGGACACTATCACGCTCTGCTTCGTGATTT"))
+(assert (= z "cuaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2
new file mode 100644
index 000000000..545a1ea53
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0084.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTTCGATTTTGTGTACGCAGCCAGATGGACTTACTGAATGGGAAACCGGGGGCAGCAAGCGGCACTGTAAGGTTCTCTCGAGTGTGGGAGTAACGTGGACATAGGTTGTAGGGCACATCGAGAGACTTAATCGGGCCTTCGTTCTTATGTCTGCACGCTAGCGTATGTATAGAAATTCGTCTCCACTTTGCCTCTACCG"))
+(assert (= z "cauugcaccugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2
new file mode 100644
index 000000000..d87ee953f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0085.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGGAGGGTAGTCGAGAGATTGGCATCAGGTACAAACGGTCTATCTCCGGCGAGCGCCACGACTGGTGTTTATATGCGACAGTTGGTATGTACACTAGACGCGTGACATCCGATTAGTTTACAACTACTATATGAGCCTCGATCGTCCTCCATATTTAGATTATAACTGTATACACGACCGTCCATTCCTTTCTCAACGC"))
+(assert (= z "guugcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2
new file mode 100644
index 000000000..e3247ecf4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0086.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTTTTTCGATAGTTTACAAAAAAAACCCCCGTCGAAACTATGCGACTGGTCTTAGGTAGCGACGCTTAGACGAGAACTCGTCATCCCAGAAACGAGCTCTTCAATAGGGCAACATCTGACTCACCCAAGGATCTCGTAATACCAACCAGGTAATCCCGAGCCATTTGCCCACGATTAAGCGAAGTTCTTCCGTACATGT"))
+(assert (= z "cuaucaaauguuuuuuuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2
new file mode 100644
index 000000000..6397f29e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0087.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGCGACAGCCGTTATGTTTAGGCATGCGTTGTAAGGGCCCCGGAGTACCCACTACACCCCAGAGGTTTACCTACGTTATGTTTCCATGAGATAAACCATGAAGCCGGGGGCTATAGTCGACCACGTGCTTGCTCCTGTCCGATGTGGGGGCCTCAGAGACAGCCGGAAGCTTTTTCGGATACTACCAACTGAAACCTCC"))
+(assert (= z "cuuuggagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2
new file mode 100644
index 000000000..1faf3bbc4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0088.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGATCAACACTCCCCAGACCCGTCAAGGTGCCTTCTTGCCGCAATGCTGAGCCTAAGAGGCGAGTAATCTTGATTTATTTCTCACTGGACAGCTAGGTCGCCCACACGCGTCAGACCAACTCTCTTCAAATCCTGGTCGCCGCTCTCCTAAGGCAACCCCCGGTGAGACTGAAGGTTCATGGTTTTCAGGTGTAAGCCTC"))
+(assert (= z "cggcguuacgacuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2
new file mode 100644
index 000000000..cc6216977
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0089.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTGTGACCTCCTCGAAGGGGCATGAGAGGACACCATGGTTAAAGTTCGCTCTTCTGCCCCGCTTGTCACATCTGTGCCTTACGCCCATATACACAGGCTAAAGTCGCCCTAACGAATTATCCTTTTACGAAACAGAATCCGAGGGGCCGACTGGATATTTACCTCTCCAGATTTACCACGTATTGTCTGAGAAAAATGC"))
+(assert (= z "caauuucaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2
new file mode 100644
index 000000000..cc49fa1cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0090.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTATCAGTTGTATTGCATGGGCAGGCTCAGCCCTCGGTGCTAACCTGCCTCAGCACAGGGTGGACGACAGTCCGAACTGGCGCTGGGGTAGTGTCTTAGTGGTACAATGCCTCGAGAGCTAGCAACCAGTCTTGCCTGGCGCGTTCTCTTACGAGCTCGTTATATATTCCAGCCGCATAATTAATTTACCGGATGCACAC"))
+(assert (= z "uggacggagucguguccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2
new file mode 100644
index 000000000..54bd6d8a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0091.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATTATCTGTGAATCCCCCCGACCTGCATAAACCACCTACTCTGCCCCGCCAGCATGGACATCCCCACAAGCTTCGGTACGCTTTCACAATCTGAAGATTTATCGGCAACGACCGCATTGCAGTTAGAGGAACGCTGCGTGGCCCCTCAACATATTATGCAGACGGGGCTGGGGCGCCGCCATTAAATCCCCACTCACCA"))
+(assert (= z "cgcggcgguaauuuagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2
new file mode 100644
index 000000000..7fb136e06
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0092.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGGAAGAGCCGATGTTAATTTGTTACGCGTTCTTTGCTCGTCGCCCGCAACACGGTACCTGGGCGGACCAAGGGACGTCTCCCGGGATGTACTACCGGCATAGACGGCGGTCAAGCAGCCGATCCGGACTCTGGAAGACGTCGTTTTCTCGTTCAAAAACTGAAATTGTAGCTGTATGGCGATGTCAAGTCCGGACGCA"))
+(assert (= z "ccgccugguucccugcagag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2
new file mode 100644
index 000000000..22f2418ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0093.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCAGTTGGACTCATCACCTGATGCACTCTTACAGCGCGGAGCAGTGCTGATGCTGCGGAAGTGGTGTGATCTTAATTGATCGGGAGTGCTGTCGCAGTAGGTCGATAAACGCGACCCCCTCTTAGTTTGCCGTAAACCATCAAGACTGGGTGACCGATAGGCCGCCATAACCGTTGGTAGAGCTAAGGGGCGTCAGCCC"))
+(assert (= z "ccacuggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2
new file mode 100644
index 000000000..e085c42f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0094.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTCCTACCAACCGAACATTTTGCTCTTTAACTACTATCGGAGATGCAAGCTGTGTTCGACGAGACTGACAGAATCCTTTCATACACACGGCAAAGGCTTTTCCTTAATCCTGACATGAATTTTACAAACTTCCTAATCAATACGTTTCACGTAGCCCGCGGCCCCTGGACGCTTGTTTGTGGTATCACGAGGGTGCAAT"))
+(assert (= z "acgagaaauugauga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2
new file mode 100644
index 000000000..bbef77088
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0095.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAAGGCCTCACCGTTCCTTCTTCCGGCGACTGTCGATGACAATGTTGTACACTGCCTGCAGGTTGTGGAGTTACGGGAGTGTGAAATGATGCGCGCTTCCTATGTGTTTGTCACCAGGACTATCAAGGTGCGTTAAGGTCTAGTCGATATTGTCACTTCTGTAAGTTTCATTAGACTTTGTTGAATTTGAATATCCGTC"))
+(assert (= z "cacgcaauuccagau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2
new file mode 100644
index 000000000..d99024f95
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0096.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCCTTCGTGGCGTCCGGTACAAGCAACCTCTATACCTTGCATTGGCTTTGAGTTACATACGAATTTGTAATATTGGTGTCAAACTAGTAACTAGGACGCTAACAGTCCATACGGCTGTACGATGATAGCCTATGGGTTAAAACTCGGGGGGAGATGCTCTCGACACGTTCAAACTTTTGGAGCGCGTGACTCGACGATT"))
+(assert (= z "uugucagguaugccgacau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2
new file mode 100644
index 000000000..15bd76d26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0097.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGAATCCGAAGCGTACATTTCATCAGCAATTTCAACACCTCAGCCCCTGGCGCCAAAGTGTCTTTTCCTGAGCCTGGCGGGACGGACTCGGTATTTTACATCTCGAGGCTTCATAGCTGTCAATCGGTACCACCGAAGAAACGCCTAACCTATGTTGTACCAACAACTTAGTCACAGTCCTGGGATGACGTCGCGCGATT"))
+(assert (= z "gacccuacugca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2
new file mode 100644
index 000000000..5e7865c91
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0098.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGTATGTACCCGAGGCCTTAGTTCATTTGGGCTCGCGCCCGGCGGACAACACACGAAGTCATGTTATTCGCATCAAGTACGTTGCTACCCGTATAGTTCCTCCGTCACCGCTAGGCAACGGAGATAGTGCCGGGAAGTCGACGGGACCTCCGGAGTGCACACCGCGCCAGAGCGGCGGATTCCTCATTAAGCGGTAAGC"))
+(assert (= z "aaacccgagcgcgggccgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2
new file mode 100644
index 000000000..cfc43db71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0099.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGAATTTGACAGTGAGCTCCGCAGGCAGCTTATTACGTGCAACCCGAAGCCATCTATCCGCAATTTACGCCATTATAACATCCCATTAGTACGCTCCAACTTGGTATCCCGGAGCTGGAGACGGTGGAAATTGACCCCAAAAATCGTTGATTAATTCTCATTCTAGCCGGCAAGAAGTAGTTTTTTATATGAGTGGTGTC"))
+(assert (= z "uaagaguaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2
new file mode 100644
index 000000000..92a2092fc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0100.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCCTCTAACGAGCCTTACGCAAAGACCTGATCCCCAGCTTCGGGGCGCACTAGGACACTCCGATTGGCAAACCCCTATGGGCAATAGTTGCAAATCAGCCTCGGTTGCGTACGATTTCCTGTGCCGGGAAAGCTTAAGTTTTTGGCTTGTTGCCTAGATGTAATTGGGACCCATTCTAGTTCGTTAATCGTATTCTACG"))
+(assert (= z "aaaccgaacaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2
new file mode 100644
index 000000000..8017dcae2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0101.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCCTATCACGCTCTAGACGGCTTTAATGGGGGCGCTTCCTGTCAGAGCGTCTTGATGTATACATCCGTGGTTACGATTAGTAATGAATCGGGCACAAGTTGAGTGCGGTCCCTGCAGGCTATTTCCGTTGAGAAATCATAGAGCTTAGCGTAAGCAAAAGTCGGGAACCAGGATGCATGTGGGATTGTTGGAAGCCGCC"))
+(assert (= z "agaucugccgaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2
new file mode 100644
index 000000000..4a63e3a48
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0102.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTACATATCGCCAGTTACCACCACTGTCGAATTCGGACAGCATCACTTCCGAGACAAGTCGGGTGTGCTCGGGCGGTCGGAAACGTAAGGCCCAGGGCCGCACGCGGTAGAAAGAGCTGACCGTAAGTACGTAGTTACGTGAGCCTTACTCTACCTTCATGAAATACAACCCACTCTCATTACTGTAGTTCGCTAGTCGT"))
+(assert (= z "gaaggcucuguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2
new file mode 100644
index 000000000..76a679d6a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0103.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGACGAAGGAACCTTAAGTATCGGAAGTGACGTCGTGGTCCAGGCACATTAGCTGACACACCTCGCCGGCATTCCAACTGTAGCCGCGAATATTGTACAGTACTGAACTATATCCATCTATGATAAGTCACCAATTGCGGAGACCCAACTGCGCTGCAAAATGTAACTGGGTGTAGGCGCATACAGTCGCCCTGGGAGGG"))
+(assert (= z "ucgacugug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2
new file mode 100644
index 000000000..b3986b81d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0104.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCAGTGAACGTTAGGTACTTGTGACTGTCGTCTATCCGGGGACCAGGCCAACTCATCTCAGTTTGGGGACTGCTAGGACCCTCCTTGACTGGATTCGTTTCCCAGCCGTTGCGGTGCGGGGGAGGCTGTCGCCCAGAAAGGGTGATGCCCAACGAGCGCTTCGAATTGTGTCGACTATTGGGTTCCTTACACGTTGTGGG"))
+(assert (= z "gcucgcga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2
new file mode 100644
index 000000000..85104c30a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0105.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATACGCCGCTTTAACTAGTGAATATTTTCGTAGTCTCGAGTCAGACCCCCCCTTGCAAAGCGAATACGCCTAATTTGGGATACTTTACGCCCCTATAACTGACTGCGAGCGAGCCTTACGAACGCTCCAAGTCCGCCACCCGTAGTGTTCAGATATGGCCCCCCATACTACCTCATACCCTTGTCAGCACCATGTGGCCG"))
+(assert (= z "ugaugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2
new file mode 100644
index 000000000..71aad8038
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0106.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATGTCTCAACGATTGCGCAGGGTGCCGTAGCCGGTGTTTTGTCAGTGGGATTAAACCTCGATCATGACAATCATAAGGCTAAACGGGTTTGCTAACCATTCTATATTATGGTGACTTTCCAACACATGCATTGGCTCTTTCGCAGGTCCGTGATATGAACTGGTGTATGACCGTATACCCGACTTGAATCTGCAAATCC"))
+(assert (= z "uuggagcuag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2
new file mode 100644
index 000000000..1971b1bfc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0107.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGATTAGACGCGCTTGCGGTGCGAGGCATAGGGCTGAGAGTGTACGGGGCGGTTTACTCGGATGATACTTTGGAGACCTCGATCTTAGGTATTCCCCTTTCCCGGCCGGCTTGTAAGCGCACCGCGCGATTGTGCCGAAATCACACACTCGGTATCGCGTAAGACTCTAGTCAACGCCCATCGCTGAGAGATTCATAGGT"))
+(assert (= z "gccuacuaugaaaccucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2
new file mode 100644
index 000000000..121a49426
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0108.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAGTTCTCTTAAGTTAGCGGATTATTTTGCTGCAGGTGCGGGTTTGTCGGGTCATTCAGACTCCGCATCCGGTGTGTTATAGACTACGTAAGAGGCCAACTGTCAAGAGGGTAAGTGATAAAGTTCCTTTATTTACCTTCCGAACTGGGATGTCAATAGCAAAAACGCGCCATATGACCCATGGAGCACCCCTTCTAAT"))
+(assert (= z "auaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2
new file mode 100644
index 000000000..f86bb9044
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0109.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCTTGGTATCGTTCTGGGCGCCGAGAGGGTCAAACATGCGTTATGTAATGATATATACCAATATGGATTATTTCGCGGGTGTATCCAACAGTCGTTGGCGTCCTATCACGGTCTATTTGACTAACTGTCAGGAGTCAAGTCTTCTGACAAGCCGTCGAAGTGACCAAAATGCTCAGCACCTTCCTATAGACCGGAAGCT"))
+(assert (= z "uaccuaauaaagcgccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2
new file mode 100644
index 000000000..de55464d1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0110.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATTCGAGTCTGTCGATTGGTTCGCTCATACCAGTACGGAACTCGGTCCCAAGTATTAGACTGCCACAGCGGATCAAGCGGGCATTCGGGACCTGCCAGTTGGTTTGTCTCTGTATACGACAGATTGTAAGCTCGGCTACCATTAAACTGGCGATTAGACACGGGGTTTTGCCGTCTGCGAAGCCACTTTGGGATGGATA"))
+(assert (= z "agccc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2
new file mode 100644
index 000000000..52d476ae2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0111.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCCGCTCCCTGACAACGTTGGAAAGTTCCTAGCGAACCAGATTCAGGCGCCGATGGAGAGTCTATGGCTACCCAACGGATTATATCCACATTTGTCGTATCACTAACATGCGATCCAATACGTTTAGGTCCCTGACGCTCACCACCTGATCTCTGAGGGCCCTGTGCGCACCAGCGTCCTCAATGGCCGCGTACCGTAC"))
+(assert (= z "aucgcuuggucua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2
new file mode 100644
index 000000000..0d81867ee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0112.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACTAGGTGACCTCGGGCTCATTCCATGCTGAAGTTCACAAAACCTGTTTGCATCGGAGAAACGCACGCGAGTGAACGCACGTCTTCTGCTGCCCATATTCTGGACGCAAGTTTCCAGATATCCTAATGACCTATGCCCAACACTTCAGCTCGCACTAAAACCAATTAGCGTTAAGCGCATAGTCGCTCAAGCTCATCTA"))
+(assert (= z "guauaagaccugcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2
new file mode 100644
index 000000000..7de3c6d45
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0113.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AACCGTAAGGCAATTCCTAGTTACAGCGAATTGGTCAATTATGACGTTGGCCCAACGCGAACCCGCGATAGGCGTGTTCGGCCGCTTCGCTGGATAGGGATCTCAGTCCTGGGCTTAAACGAGAAAGAAGACGTAGTCCGGGCGCCTTCCATTATAGAATCTCTTGAGGATAGAGTAGAGAAAGTTGTTTAATGGGAGAG"))
+(assert (= z "gcccgcggaaggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2
new file mode 100644
index 000000000..511ce3245
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0114.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTACGTTCTACCGAGAACTCCGGTACTGAGCAGGCTGAAGACGTCTTCCTCCGACTTATGCGGATACTTACTATCACCCGCTCACTCTGCCCTATTAGGCCCATTCGGTCCAAAGTAAGTGCTGGAGGATTCAAGTAACATCTGATTGCACTGTTTGATATTAGACTGGGCTGCCCTTATGTTTTGAAGAATTCCAACCT"))
+(assert (= z "guaagccagguuuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2
new file mode 100644
index 000000000..fe2c287fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0115.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTAATCCTTTATCTGCACAGCTAAGTCTACCACGTTGATGAGCAATGACGCATTACCACACGCCAGCAGACTATCCAATCCTGTGTTAATCAGGGGTATTTACCTGGGGAGCAACTGTTTACCAGGTGGCGGTGAGAATCCTGTACTCCGACATATGCAGGGCCCGTGGCGGCAGATCCGTAGACTTTTAAGAACTTCAG"))
+(assert (= z "gucgauucagaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2
new file mode 100644
index 000000000..d9b6cd016
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0116.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACGGCGGCACCGATCCTCCGAGGCCCAATACCTCCGCTCGATCTGGGATTCCATCACAGACAGAATTAAGGAGCAGGTCCCGTGGTGGCGGTGGTAAGATAGTGACCTGCAACACTGCAAACGATGGCTGTATGCTCCTATATAAGAACGTATTCGGGCAACATAACACTAGACAGCTGTATGGCCTCGCGAGTCCCGG"))
+(assert (= z "cgcucagggcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2
new file mode 100644
index 000000000..29a9dff26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0117.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATATGGGCGGAAACCAGTTATCGGCCTTTAGAACGAACGCTGCTTTCGGCTTGCGACGTGTTACGTCGCGCCCGTCAGATGTTTTATAGCTGAAGTGCCGTTCCCAGCTTGGGACGGGCCACATCGTAAACCATGTCAGCTGTGTATCACCATCTAGAGAAGCTAACATAGAAAGCGTGACCACCTGCGGATCAAGTAC"))
+(assert (= z "cgacgaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2
new file mode 100644
index 000000000..1b3417dc2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0118.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGGATTAAAGCTGGATAAGGCCGTCCGTAGAGAGTATACCGTCCACACCGGAATAGTGTTTGAAATGGGCCTCCCGTGGTCTGTGAATGATTTGCTATATTTCTGACCAACTGACTTCAACGGCCCACGCATTCCCTTCCTGATGGGCGGCTTCCTATTGAATCCTCAGCGTGAGGAATTCCTGTTTCTATGCCTAGAC"))
+(assert (= z "ggacuacccgccgaaggaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2
new file mode 100644
index 000000000..8b16dee33
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0119.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGGCTCGCCGCCCCCGGGAATCTTTTTCAGGAAACCTAGGATCAGACGGACGAGGATATATAAAAGCGAGACGACATTACTGCATGATTTTGTGACCGCGTTGTGGTTTATATGTACGTGTCGACCGATCGCTGAGTACGCTCGGAGTTCTTAGACGTAGACTCTGTTATCGGTTTGCAGCGTTTTATCCAAGTGTCGC"))
+(assert (= z "gcaucugagacaauagcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2
new file mode 100644
index 000000000..9e2c4b664
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0120.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGCTAGTAACCGGGGGACGTCAACCTCTGTACACTGACGTGGCTCAAAATAAGGTCGACTGCTCTGGGTCCCAGGTAGTAGGGCAAGTCTGAGTCATTCGGTTTATACAGGAGTCTGTAGACGGAGGATATATGATTCGGTTTCGCCAGCGGTGGGGAGAAACATCAGCGTCGTTCTGGAACCAAACGTGGTTTCCTCT"))
+(assert (= z "augug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2
new file mode 100644
index 000000000..fcb917e09
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0121.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCAACACCGACGGTGGGTATTAAGTTGGGCTTAATGGTGCTTAGTTGGAATCCACTAACATATACCTTATGAAGTCTCCCGTTCACGCCTGATCAATAAGCTTCACGCAAAAGGCGACGAAATCCTTCTCCAAACGGCTTGTCTGAATAAGACCGTTAACGTGGCGAGCGGGACAAACCAAACGCAAGATAACGATCCTG"))
+(assert (= z "gcaccgcucgcccugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2
new file mode 100644
index 000000000..fcf02b255
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0122.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACCAACCCAAGTGTAAAGTGTATGAAACGCTCTGGGCAGTCGGCTGCGTTTGAGCCGTTACTTATCGATCAACTTAATTATCGCCACTCCTTGGGGTTTTACCGGGTAGCGCACAAATGGGGGAAACGGTAGGAAGATTAGACAGTTGAGGGTTCTGTATATAGGGCGTCCTGTATAGGTCGAGACAAAGACAATTGAAG"))
+(assert (= z "caucgcguguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2
new file mode 100644
index 000000000..d51e08c87
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0123.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATAGCGTTGCTTCACTCACGTTATCCCGGTGGCTCCCTCAATTGCGTTTACGATGGGGTGACTGGAACGTTCAGAGAAGGGAAGAAAGACACCTAATGCAAGAGGCCTTTCCGCCTGGAGCCTCGGTGTAGATGGCCCAGATTCTAGCCGACTCAGGATGGCCCTTGCGCTCCCCGTCGCACGTGGATCAGGCAACGAC"))
+(assert (= z "gcaacgaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2
new file mode 100644
index 000000000..06ef35bc7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0124.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTGACGGTTCAGGGATTCGGGAGTCTCATTTTAAACGCTGGCGTTATAGTCTGGTATATCCGACTATTCATAGTTTGCCTGATAAGTTCAAGGCATCTTGCGAGCTTACCGGAAGATAGATGCTACTCTTGGATCAGTAAAGGGGCGCATACTACGATATGTAGTAAAGGATGTAACGCGTCGTCTGATGATCTATCATA"))
+(assert (= z "acgaugagaaccuagucauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2
new file mode 100644
index 000000000..9584eea10
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0125.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGAACATGAATCAAAAGGTAATTAGTCGGCTCTTCGAGTCACCAATTATCTCCGTTGCCCATTGAGCAATAAATTAATACGCCGGGTTGTGGACTCTAAAGGCACCATCTGATACAGCGTAACGGAGCGCATTCGAACGTCAAATGGGAATGTGGGTACCGCTCGGCTGGTCCATGTATGTCTAGCCGATCCCAGTATA"))
+(assert (= z "auagaggcaacgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2
new file mode 100644
index 000000000..bde7f6d4e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0126.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTAAAAGTGTTCCATGGAACGCGGGCATTGACGAGCGCCAGTCGCGAGCACTTATCCGAAACTTGAGTAAACCCTGGGATAACAGCCGTGCGAACTCTACCCTGATGCGTGCCCACTATGCCTCTTCAATTTATGCAGTTCCTAATTTACATTGGAAGTTGAGCTGCACGCGCCGAGGCCTTTTCGGAGCATATTGAAT"))
+(assert (= z "ugcgcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2
new file mode 100644
index 000000000..c6d150bd6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0127.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGCTCGTTTGACAGCAGAGTAGAAAAATAGGAGGAAGCGCGGCCTCTGCACTCGATTTCTTTCCGGATGAGGAGCGCTTCGTCGAGCTGGTCTCGGCTACCGAGGTTGAGGGCAGTTTTGAGATAACAATCATGTCTCGCGGGTTAGCTTTCACATACTAATACGGATGCTTAGCAGTTTCCCGCATCGACGTTGTTAG"))
+(assert (= z "ucgaaaguguaugauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2
new file mode 100644
index 000000000..7c32e5e52
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0128.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCTTCATTCATAGTGCTGGTGACTACGACTGTTGTGTGGGGGACTCTACAGGCTTAAAAAAAAGCGATGACATAAGATCATGAACCTCAGATAGCTGAGTCCACATATAGTGGTGTCACACAACTTGATTTCGAGCACGGCCCCACTTCTGACACCGCCGCACCACACATGTCTGCCATATACAACCACCAGCTTAAGAT"))
+(assert (= z "cugagaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2
new file mode 100644
index 000000000..6aed995c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0129.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGTATGTCATCCTGCTAGCCGATTTACAACTAGGGCTTCGCGGTTGGGTGCCATAAGCATAAAATATTAGTGAACTGAAAGTCCATCAGTCATTAGTTCTTTATACCGACAGTCGCCTGTCGCACGGACGAGTACGACCGTAACAGATCCCACAACATTTACTTATGTAGTACGACTTCTGCGTGCCAGGGGACAACGTA"))
+(assert (= z "ggcauugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2
new file mode 100644
index 000000000..bcfabcfcc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0130.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGGCGTGTTTGCGACATTGTCCGACTTAGCATCGGCTTAAACTTGGCCGGTTGATGTCGTAACCGCCCCCCCATCAACAGAGCCTTACGGAGCTTCGTAAGACATCCTGGCACACCCATGAACGACATGCGGGTCAAACAAAAAAAGGGCTTAAACAGCTCAGCGTTTCCGCCACGTTTTCGTGTTCACTACGACGTTT"))
+(assert (= z "acagcauuggcgggggggua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2
new file mode 100644
index 000000000..bf41d4228
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0131.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGAACCTCTAGCACGGCGACTAGGGCTCCAGGGGGACATTGATCTCGATACGTAAGCGCCCGTTCGCTCTGGCAGGCTTCCTCATAGATTCCACGATCTGCTTTGCTCTAATACCGGGGAAACTTTCTTTAATTGCACAACGCCATTTTGACGACTGGATCAATACGGGGATAATAGTACTAAAGTCCGAGGAAAGTTTT"))
+(assert (= z "gaccguccgaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2
new file mode 100644
index 000000000..c51e0332f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0132.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGCACTTCGCTTGAACCGGACAGCCGTCCGCTCCAATGATCTAGCAGTTGGAATCTCAAAGGCCAAAAGTTACTACCCACAGGTCGAAACTGTACAAACCTAGGTTTCCGCAATAACAGTCTAAGGTGAGGCATTCGGTGGCAATCACGCGATCTTGCAAATAATAGACCGATGCAAAAATCTGTGTACGACCTGTGGC"))
+(assert (= z "agaucgucaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2
new file mode 100644
index 000000000..d61e460ff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0133.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCGACTAACCGCGTAATAACAAAAGTTATATACGAGGACTTGCACACAACGGCTCCTAGAGGAAACTAATTTGCTTAGGAGGCTATGAAAGGACCCAGAAAGTCCAGAAAGTGCTTCCCATTCTAGCCGGATTACAACCTGGACCGGCTTTCAACGGCGGATGCTAAACACTGAGCACATCTTTCAACCTAGTGGGTGG"))
+(assert (= z "uaugcuccugaacgugug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2
new file mode 100644
index 000000000..7bb5e190c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0134.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGCTCGTGCTCTCTCCCCCTAACCACGATCCGAACCCCTGGAGGGCGCTTCCTATGAACGTAGGAAGCGGGCTTTGCACAGGTTCGGTTGTGAGTAGGTGGGACCCCAGCCCGACACGAGTCCAATACGCCGTACCAGTATGTCGTGCTATACGTCGGCAAGCTTGAGAAGCTGCTCGTACAGGGTCCGCCGCATAGTA"))
+(assert (= z "gggggauuggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2
new file mode 100644
index 000000000..93445cee3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0135.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAGTGGCGTGGCCCTATTCCTCACTAACATAGGTACTTGGCGGTGGCCGTCGGCTAATGGAAGCAGGAGCTCGAACGAAAGGTATTGACATCTGATGTAGACACGTAAGACCGGCCTACCCTCTCTAAACAATGGTCTGAGTGACCATCGGAACGTTATTGCTGCCAACTGTTCATCAGAAGCGAGAAGATGTCCATGG"))
+(assert (= z "ggaugggagagauuuguua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2
new file mode 100644
index 000000000..c70551834
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0136.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGCCAATGGATTGATGGAAGAAGCTTCTGTGAATGTGGTACCTCACTGTCTACGAGAATCTCTAAAATTTAATTTCCAGGGGAGTACTGGAGTTTATTGACTGGAGCAAAACATGCCTTGCTACGCTCGACTTGGGACCATTTATTTACCTAGTGTATGCTCCGGCAGGTACTCTCTGATTAGCTCCTAACGCATGGTT"))
+(assert (= z "uggua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2
new file mode 100644
index 000000000..df7fae211
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0137.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCCGCATATATATCCGCATCCGCTATACCTGAATTTAGGTTCCGCGTCGGTGCGTACTTCTATACGTGTCTAAGCACTGCCCGCCGCTGGCTAATGGGAAGGCCCTTTCTGCCGTCGTATTAGGCGGTTGCCCGAGCTCTGACTGAGGATGCGTTCGCATAGCCGTGGCATCTGATTTCAAGCTAATCGCTTCATAACCC"))
+(assert (= z "gacuuaaauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2
new file mode 100644
index 000000000..fbf4890f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0138.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACTTAGGGGAGACAATCACGCTGACCTAATAACCGGTGGGGAATGTAACGCGTGTTACGGCCTGTAGTCAATCCAGGAACGCGAATACTTGTAGGTGTAAGCTAGATAGACGGCGCCTGGAATTTAAAGGTGCAGTAAACAGCTCAGAGCGTCTTCTGCTACCGGTTTCGCATGGTCACTATGACTCGTGTGTGAGCCC"))
+(assert (= z "ugaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2
new file mode 100644
index 000000000..17d634fa7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0139.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAGACCAACGAGCCGCGATCTTTTCACTTTAGGCCGCCCAAAGTTCAGGAGTCGCACGCAGGACAGTACCTGTTCGTAGCACGCAAAGGATTTACTTGTAACGTGCTGGATCAAGTGGTGGTACCGCTATTCAGTACACTCGGTTTAGCGGAGTGCGGACAAAGTTGGCCCCAGTGCCAGGGACTCTAGGCGATTAACG"))
+(assert (= z "augugagccaaaucgcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2
new file mode 100644
index 000000000..84a028157
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0140.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGCGTTCTCCGACGAACTCTGAGAAGACCGAGAGGGTACTCTGCGGACCGGCGTTGTTTTGATGGACACAGGCCAAATTCGTAGGACGATCTACGGCGACCCAGGAGGTAATCAAAAACGACAAGGTTAGCCAACGCTCTACTCCAACACGCCTTTGCTCTAAGCGGCATTCCAGGATATTGTGCTTCTTTGTCTGAGG"))
+(assert (= z "ggcucucccaugagacgcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2
new file mode 100644
index 000000000..48dc1ca4e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0141.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAACGTCGTACGCGATGCTACATGTTCGGTGACTAAACTATCAGGGATTAATATGTAAAATTTGGGACATCAATAGGATGTTCCAAACGTTGTAGATAATACCTGTGCGGGCCGCTACATCTTGAACCGCTGATGTTGGCATGCGCAGTTTCACTTCATACAGTCTACGGGGTCTACTTACATGGCTCGCTTGGCGTGT"))
+(assert (= z "cgcaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2
new file mode 100644
index 000000000..3d2b5fc0d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0142.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGTAACAAGTCTCGACTTGCACCCTTGTAAAGGTACATAACATTACGAAGATGCAAACGACGCCACAGAATCTAGTAGGTCAACGAGAGGAGAGCGCAAGACGGCGTAAACAGAGGATGGGCCAGTTGCTCGGTTACAAATAACAGTTAATCGACCTTGGTATTACTGGCAACGTCCCGTGGCGAATACATCGCTCTCC"))
+(assert (= z "uguaaugcuucuacgu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2
new file mode 100644
index 000000000..9575e0d80
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0143.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGCGCAGCGGACCAGGCTGAGATATCTTATTTATCTACGGTCACAATACTTTGAAATAGGAAGACTACTCCCATTTTGATGATATTATTCCGCGCCCTTTCACCGACTATCTACGTCTGGCTCACCGGTTGACATCACACTAGTTCTTATCAGGCCTCCGTAATTGCCCTAGCCGTTCTGACACTGGTGTGTCACCGGC"))
+(assert (= z "aggca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2
new file mode 100644
index 000000000..937e9696c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0144.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CATTGGCCTTGGGCCAACGCACCTCCACTTCACAAGCTACCATGTATACTCACGAATCGAATTGTATCGCCCGGTCGAACCAACAATCCTGTGTCCGGGTTCCGTTTCACAGACCTCCCTGCCTCTTTCTGTAGTTAGTCACAGTCTGCGACTCGTGTTGGTCCCGATCCTCTATAACTAATGAGGCACAACACTCGACA"))
+(assert (= z "gacaucaaucag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2
new file mode 100644
index 000000000..2774ca6bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0145.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGTGCAAATTGTGTAGTATGGGTATCGGATGGCCCTATGTAGGATTTCTTTTCCGTGAGTCTTTAAACGCTCCACAAATTGCCCTGGACTCCGGCAGTACCGTCCCCGACTACGCACCCGACTAGCGCGTGTCGGACCTAGTGTGGAGCGGACTGAGATATCGTAAACTCAGTGCGGAACGGCTACGCTAAGACGGGTC"))
+(assert (= z "acguuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2
new file mode 100644
index 000000000..b5679812d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0146.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACCGAATTTTCCCATTGTCCACCTGTGTTAGCTCGGTCCAATTTGAAAAAAAGAGTTTCCAAACCTTGCGCCGCGTTCGAAACGCGCTTTGGTGTCTTCCTTGGATCGGCTCGTTACCTATATCATGTTCTTCTTGCCTGGCAAGTGCGGTATTACTTACGGATTGTTCAGGACGGTCTTTTCGCGAGAGAGCAGTCAG"))
+(assert (= z "ugaaugccuaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2
new file mode 100644
index 000000000..6144b4c90
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0147.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGATTATCCTACTGCGCAGTTACGTTGTCAAGCGGGTGTATCTGAACGGATTCTCACCTCTACCATGGACGGGCATACGTCCTGTCCCTGTAGTGTGTGACAATAAGTGAATGAATATGCTTGGATCTACGGGAGTTCGACTATTAGCACAGGCGACGCGTTGTTGACACCGGGATAAATAGTCCTTTTGCGATTTCCA"))
+(assert (= z "uaaaggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2
new file mode 100644
index 000000000..933a19651
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0148.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCACGGTATGAGGGCCGTATGATAGTGTTGCCGCTTAGTTCTGAGTCCACCGAGCGTAGCTGGCATTGCTTGGTGAACAACATTGAGTAGCAAGGGATAGACGCACTCGGCCATGGAAAACACGTACGTCATGGCAATATTACGTTCCTCACCAACTATTCTTTCTGTGGAGTGAGAGGTCGCTTTGGTTGACGTACATA"))
+(assert (= z "gaacca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2
new file mode 100644
index 000000000..3d83b2321
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0149.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTTCAACTGGTCGACGAGTGTCAACCGGGGGCGCCTTGCTCGTGGACGCCCGTCGGTCCCATTGTTCACACGTTGGCATAGACGCCGACCGTTCTAAATAAAATATAGCCTAAATTACAGAATCGTTACGCGGTAAACCCCGGTCTGCCCAACGACGTCTAGAAGACCGGACACCAGATATTCCCGATCTGAGTACTAA"))
+(assert (= z "uuagcaaugcgccau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2
new file mode 100644
index 000000000..391978cff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0150.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGAGCGTTACTGGGAGGGTACTAGTTTTATATTCAAGACAACGACCATATCGCCGGTATACACCTTTATGGGGGAGCTTAGTTTGCTCAATCATGAACGCGTTTGCATCTGGATTATTCAAGACAAGGGGGATGGCCCGAAACACTGCATCTTAAACGAATATCCATTCGTATATGGTCCCTGGAGGATTTATTGCGCG"))
+(assert (= z "uaccagggaccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2
new file mode 100644
index 000000000..2836640fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0151.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACGAAGGCAGAAACGCTCCCGTATGACGAATTGGACGTTGGTTAGGGTTCCCTTTCATGACCAGTTTGACGGACTACTGGTCACGATACTTTGGGTTAGATTTGCGTCTGAACTGTGAAAAGCTAGAAATGTTAGACGGCCGTATTAATGGCGAGACAAAGCTGATCACCTCTGACCGTATACAGGACCCCGATAAGCT"))
+(assert (= z "ugcaacca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2
new file mode 100644
index 000000000..3669a3527
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0152.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCACTGACGGGGCCGGTGGTTCTACTGGCTGCCAAAGGGTTCCGTCTGCGGAAGAGGCCTGCCAGACCAGGCAAGCGCCTCCTACGCGGTGGCGGTAAAGCCGATCGCGTCTTCGGGTCATTTCGACGAGCAGAACAAGTATTTTAAGGAGAAAGACCTCAGAGCGTTGTCACGGGCTGATGCGGCCACAGCATCGCCC"))
+(assert (= z "acuacgccggugucguagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2
new file mode 100644
index 000000000..9527349f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0153.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCTGGTCTCTGTGGCGGAACAGTTTCGCTCACCTATCGGATAACTTTGCTAAAGACCAACCCCTTCCCTGCAAGGGTAAACGGGCGTATGCTCCTTACAAACAGTCGTATAGGGTCGGGGAGCAACTAATCAAGAACAGCAATGCCTTAGAATCCATTACATACGAGGTAAGTTGACGTACGGTTTCTCAAAGACTTCG"))
+(assert (= z "gaggaauguuug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2
new file mode 100644
index 000000000..b8585d080
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0154.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATGTCCTCTAACGCGCTGCTAAAGACGTAGATACTACTTTCTTTGGGTGAACCTCGGAACTACAGTACCTACCCAGTTAGTTTTGTGATTTCTTGTGTTCTTGTCTTGAGCATTTAGCCGCCCTTTAGGTTAAGAGGCTCTCCAAATGGCTGATAAAATGACGCGACCTGCGGCTGCTCTCGTAAATTAAGGAGAAACA"))
+(assert (= z "acuauuuuacugc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2
new file mode 100644
index 000000000..35ac22c7c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0155.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAGTACGCCAAGCTGGCTGCACGACCACTAAATTTTCCGTGGCTGGTATGTTGTTGCTCCCTTCGCATGCGTTATAAGCCCCTTCAATTCCGTGGAGCACGTGCTGATGCTCGTTACCGAGACATCTAAAGACTTTCGGCTACTTTGTAGCTCACAACTTAACTTTAGAGCCTACTAGGCGCGAATTGGCAGTGGGATC"))
+(assert (= z "gcuuaaccgucacccua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2
new file mode 100644
index 000000000..bea9588b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0156.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATGAACAGTAATGGGCCTCGAGCACCTCAGCACTACGGCGCACATCAGTATCCTGTCACTCTTCAAAGAGCAGGGGGCCAAGCTGCTGGCGGCGTTCGGGGAATTACGGGATTCGCCGGAGATCCCACTAAGCATGCCAGTCGTTGCCCAGTGTCTCCGGTGAGACCGGTGCCCTCATACTGCTGGTCGTCTAGATGGT"))
+(assert (= z "cgugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2
new file mode 100644
index 000000000..8d1a4f71c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0157.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGTTTACTTTGTTGCACACACACCCATAACTGAGGAGCTCTGGTCGCTTACCCTCGTCCTCGGAACGCTATGCGTTCCGTTGGGCTTGACTAGGAAACCGACCCTTCGCTCCGTACATCATGGTCGTAATTCGCGCCGTACACTCAGGCCAAGCACGGTCTTCTGGAGAACTGAAATCTCCTTTCCAATCGACTCGTAT"))
+(assert (= z "ugggagcaggagccuug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2
new file mode 100644
index 000000000..db3f99025
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0158.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGTGATTCTCTAACTAAACCGCCGGGCCCAAGTGTTGAGCGAGGATCCTACGGTTTAACCTACTAGTATCCTGCAATGGTCTCTCGACTACTTCAACACATATGGATATATATAGCTGGTCCCTCAGTTCTGCGACCCCAGATCACCCACGGTGCGAACCTTATCTAAGCCGGACCATCATCTAAGTGTTTACTATCTA"))
+(assert (= z "uagauucacaaaugauaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2
new file mode 100644
index 000000000..b748a3440
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0159.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTCCCGGCAGTCTTCGTAGAGCGTCCTCAATAGGGTGAAATTGATGTCTACATCAGTAATGCAGTCTGTTAAGGTGAACTCGATCCCTCACCACGAGACGAAGGACTGGCGATAGCTAGAACGGGGCCCGTTAATCCGATCGCTTCTAGGGCAGAGCAATACTTCGCTATCAAGGGCGTCGTTACGGCAGAATGTTAGA"))
+(assert (= z "cucugcuuccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2
new file mode 100644
index 000000000..0e4379029
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0160.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTGCCGCCAACCTATGACCTAATAACTATCGCAGTTTAAGAGGGGCGGGGTTCTCATCCCGGGCGATAATTGCGACTATCGTAGCCCTTTAGTCAAGTTCGATTGAAAGGCGATATGCCTCAGTGCCCCGTCGCCGACCCGCGCTGTAATTGAGCCCAAGGCTCGGACTGTGTAAGGTCGGTACCGATAATATGGCTCT"))
+(assert (= z "cuccccgcccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2
new file mode 100644
index 000000000..262f9529c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0161.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACGTTCACTGATGAGCTCATGGTACGTTCAGATAAGTAGCGCAGCACGCCCAAAAATTCTTTTCCACTTATAAGATTGCATACGATTCGAGCTAGATTTGGAATGTTAACTAATATCCAATGCATGCAGCAAGTATCTGTTCTAACGTAATAGGTAAGATAGAACGCTTGTACTTGGATGGTTTCGGCTCCTTCTACTT"))
+(assert (= z "ugcaaguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2
new file mode 100644
index 000000000..653450358
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0162.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCGCAGTGAGTAAAGGGCAACTAAGTCATACGGCCAAGTAAAGTATCTTGGATCTCGCATATGTGATATTTTCCAGCAGACACAGGCGTATATAACGAGTCCGTCGGGGCCTTCGCACCCCTATATATCGAGCTGCGCAAACGGCCTAAGACTCGAGAGGCGCGGCCGAGTCATACAACTATCTACGACATGCACCTAT"))
+(assert (= z "cccggaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2
new file mode 100644
index 000000000..1947f4c2e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0163.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTTTCGATAATCCGGTTGAATGACATGACTGTATGTGCGGTTCTGAACTGTGTACGACGTCTCAGCTTGCGTTTTAAAAATGACTCAAGGTCGCGTAGAGGTAGGTCAAACTCGTCGGAGGCTGCTTCTGCGCGTTATTCCGAATCGTCGGAATTCATCCACTTTAGGAACTTTTTGGATATATCGACTGTCTTGCGAA"))
+(assert (= z "auuuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2
new file mode 100644
index 000000000..3e5003ffc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0164.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGGTCCAATGCTCTGTGGGGCGTCCGACTGACCTGCTGAGTGAGTATCGGCCGGCTTTCTCGCGGGCTATGCCCTCAGTACTGCCGCGTTCATCCATAGTGCTAGACAGTCCGTGGGCCGCGCTCTAGAACCTCGGCAGTTTCAAACTCCACGCCCTTCTAGGATAACAACCTTTGTCCTAATTTGAGCCAAGACGTGA"))
+(assert (= z "cccgauacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2
new file mode 100644
index 000000000..236d75f3d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0165.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTGCGGGTATGGATATTGTTATATAGTCACTTGACGTGGGATGTTCAGGTAACGCGAGTCAGGTCTCAGTAATCCTGCGCCAGCAATTGAGAGATCTTCCCATCGTCGCGCTCGCCATCCCCAATGGGGGCGCTGGCTACACGAGATTTTGCATTCAAACGACGAGGTTCGCAAAATTGCCCCGGTGCTTTAGAGGGGT"))
+(assert (= z "gguagcagcgcgagcgguag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2
new file mode 100644
index 000000000..8211af177
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0166.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGGATTTAACGCCCACATGATGAGGGTGCGCTAGCCTCGTGCTTCGTCACCGCAAATATTTCTGGGACAAAAACTGCACGAGAAGCTCCTTCCGTTCCTATGAGGATGTGTTGCTTCCCCTTTCAGAAATTCACACTATGTTAAAATGAATCCCTGTCACCGTTATTTGCCTGTCGCCACTGTTACGGTCATTCTTCCG"))
+(assert (= z "uacuccuacacaacgaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2
new file mode 100644
index 000000000..cd01e7cb9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0167.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAGCGATCGCTTCGGAGACAGTAGTAGCATTGGGTGGAGTGTAGGTCCGTGGGCGGTTGATAGAGGGAGGGTAAGGTCACCTAGCTTGCCCTGAATTTGTTGGATTTAACGCGTTGTCCTTATCCTGTGGCAACTCCCGATCTCGTTCTACGTCCGAAATATGGAGATATGGCTAAGGCAGTGTCGCGAACATCCTAAA"))
+(assert (= z "uugcgcaacag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2
new file mode 100644
index 000000000..86150ef19
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0168.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCCCGTCAGGCACAAAACTTATAATCCGCGCGCCTGGAGTATCCACGCAGGTCTTTACGAACTCCATCCCTACAATTCGAGGATACTTGGTCAATCGATCCATATAATGGGATTCCAGTTGATTGGATCTCCATCCATTGACCTTTGTTCCAGTCTTTTTCAATCACTGAGTTTACCATAGCAGCACTACTCAATGCTG"))
+(assert (= z "ugaacca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2
new file mode 100644
index 000000000..7a4e4aa75
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0169.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCTGTGATAACGGATGAGGCGCTGTTCTGGACCTGCCCATTAGAACTACGTTTGGCCGGTAAAATAAAAAATCGAGGCTCCTCACACCCTTCACGTGGATTCCTGATAGTCTGCCGATTTTATTAGAGGCTGATTGATACTATAAACTGTGTCACGCTTATTACCTGATAAAAGGTGTGGGCGCGGATATAACACCCTT"))
+(assert (= z "gacacagugcgaauaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2
new file mode 100644
index 000000000..a76e515b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0170.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGAGGTACGAAACCTGTCACGGTAAGACACTTAGCTCAAGTACGACGTAGCGTAATGTTCCGGATCGATTTCATGTCAGGACGCGCTTAATTGGTGAAGCTCGCCTTACTTTACGTCGCTCCGTGTATGCGGTCGCGGTACGGGAAACGCTCTCGAGGCGGTAGTTCGTTTAAGTCAGGAGCGGTGTAGGCCAAACCAG"))
+(assert (= z "uaaagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2
new file mode 100644
index 000000000..341fe9f91
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0171.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGACATCTATAATACTACAGGAACATTACCGAACGTTCACTGACCAAAGGCCAACGGGATAATTGGGATCGCATGCTGGGGCCCATGATCAAGCCCGACGCATGGTCCTTATAGTTGGGAATGTGTCTTGCCGGACAAGGGGCCTATAAGTAGCTCAATTGAGCGCCATAACTGGAGGGATTATTTGTGCTGGCCCGGA"))
+(assert (= z "acggccuguuccccggau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2
new file mode 100644
index 000000000..d76163377
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0172.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGTTATGACCCTATGTGTCGCCGATATTTGGCGCCGTAAAAAATAGGATACAGAACTCAGCTAGGAGAAGAAAGGGCTTGCCAGCGATCCACATCTGTAACTTGGGGGCGCAGGACGACAGGCCATAATCTTTTCGTGGGAACGGTAATCACTCCGTATGGTATCTGTTAGGTGATCGCTTTAATGACGGAGCTATGCG"))
+(assert (= z "ugucuugagucga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2
new file mode 100644
index 000000000..214f07784
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0173.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGTGGTCGATATGTGTCATGATCCACCCTCCGCTCGTTTTCGTCCTGGCTTCGTAAGGGTTCTAATTCCAAGATCTTTAGAATTAACAGGATTCAAATCGGGGGAACCCTCAAGGATCTGGAAATGCTACTGCACTACCGGTATCCTCACTACGGGGGATACTCAACATGCAGTATACACACGTCACCGTATGCCTCTG"))
+(assert (= z "aagcagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2
new file mode 100644
index 000000000..dca0f2d71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0174.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAGCCACAGGTTCTGCTGAAGACAAGAGGCTGGTCTGACTAAGTGGATAAATCGTAAGAAAGCCACGCCAAATGCACTGTCAGACCGTTATAGCCATTGATGCCGCGGAACGCCGGAAGAAAGCCCAGCATTAAAGTCGTACTTCCTGGACAGGCGATCGATCGTTCTGTTCCTAGCCCCGTAATCTATAAGTCCGTTT"))
+(assert (= z "uaauuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2
new file mode 100644
index 000000000..d1339082f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0175.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCACGGATTTACGTCCAGGCACAGTGCGGCTCTTTGTAACCACTTATACAACCTCCCTTTGTGCCGCTCCGACCCGTTCTTGCAAGATATCCTGGAAGCATTTGACTTCCGATAAGATGTTCGTATAACTTCAGCATGGCACATTCAGACCACCGTCTTGGATGTGCCGCGACGAGAGGTATCACCTATTCCACGTCACT"))
+(assert (= z "uuggagggaaacacgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2
new file mode 100644
index 000000000..a27e4d184
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0176.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGCGGGTGACGCAGCTTCAAGCTGACCGCGGCTAATATAATGTCGGAGATCGGATTATGTTCACTATGGCTTCTGCCCTTGATTCATAACCTGTTTAGGTTGTAAACCGCAGGGGTATGATCTTAGAGTTACGGCCGCGCACATGCACAGCCCTCAGGCCCACAGTCTCTGTTACTCGAGACCTGTCACTCATGAGAAC"))
+(assert (= z "uuuggcguccccau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2
new file mode 100644
index 000000000..a8ab13b3d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0177.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGTCAAAGATTGTCAAGGAACCTCACTGAACTCGCAACTAACTCCGCGTTATGCTCATCCGAGACTACAGCAGAAATCAATCAACTCGAAATACAGGTAGCCCCCTTCAGACAGCTTTTCCCTGTGATGAGAGGTACCACATGAGACGCAGGGTATATGTGTATACAGTTGAGCCGTGTTCCTGAGTATATGCGGTGCA"))
+(assert (= z "ggagugacuugagcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2
new file mode 100644
index 000000000..1730f4854
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0178.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATAGCAGTACCACGCCGGCGAGCCAGTACAAGGTAAGCCTTCCTCGATAGTCTGCGAATAAAAGATCGCCCAACAGAGTCTACGGTCTGTATTCCGGTGTCTATAAACATGGTCTTGATAGTGACGCAGGTCATCGCGAAGCCCAAAGTACATCTGGAGGCTCGAGCATGCTTGACCTAGACTAGCATTGTTGGCGCTGT"))
+(assert (= z "guaacaaccgcgaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2
new file mode 100644
index 000000000..a5d0b1e1a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0179.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACTACAACCCCCGAGTCATCGAATGTACCATAGGGGCAGGCTTTCTTATCACTTGCCGGTAGGGAAAGGCCGCTTAGCAGCCGCTGTTAGGGCATACTTGTCGTACGTTCCGCGGCACTTGTTCACGATAGACACTTCGTGAGGTCTTTCATTCGGGCTATGACGCAACACATCGACGTCGCGGAGGGCGGATGTCCAG"))
+(assert (= z "gaaaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2
new file mode 100644
index 000000000..485ed6f69
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0180.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGACTGTCAGAGACTGCATCTACTTGACTTCGCCCTATAGAACAAAAGTTGTGCCGATACCACGCGTAGACCGTCGTGATTGACGAGACCTTCAGACCGATCTGTAGTGTCCAATCCTGCTGCTAGTGAACGCGGTATAATGCCCCCAAGTGGCTTCGGATGCAGATGAAACGCTCAGGCGTACGGATGTAAGCTCCGCC"))
+(assert (= z "ggaagucuggcuagac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2
new file mode 100644
index 000000000..29abd7f37
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0181.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTGTAAGCAACCTATGAGACTGTATGTCGCTCTCTTCACGTATGTACGGATGATTAGTACAAGTAGTTTACTGTCTAACTCTCCTATAGCCTAACTACTGTGGTCATGCGGTGCACATTTTGGGTAGCAATGACCTGGGCCGGAAGCGCCCACCCGGTCCCTAGCGTGTACAATTAGAGGCGGACATTGCGGTCGTCCG"))
+(assert (= z "ugaugacaccaguacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2
new file mode 100644
index 000000000..2f55f7d01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0182.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCTATAACTCTGCTCAGTGCCTCATTGGGCGCTTCACAGGAGCCTCTAAGTGGGTGCTTCTATCAGAAAATCAAACAACGTAAGGACGCCGGATGATTTGGGATGCGCCCTCGCCCGGGGAGGCGTTGACTAAAGCACCCCCCGAATTCTAACTGGGTCAATCCCCGCGTTAAAGGACCTATAGCTCCGATAGATGGCC"))
+(assert (= z "uuuguugcauuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2
new file mode 100644
index 000000000..a0fd7a534
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0183.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AACGTCACGCGACAAAAGAAGCGTCAGCACTCCGTGAGACTAGATAGGTGGAACGCTAGGGATTTAATTCGAGGTAGACGTGAGAAAGAATACCTTCGGGCGATTCTGTTCGGGCAAGAAACTGCTGTAAGCAGTGAACACTGCATCCCTTGGTCTGGGTATATCTGAACTTTTCCTGCCCTGTTAACCCGACGAATAGC"))
+(assert (= z "acaauugggcugc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2
new file mode 100644
index 000000000..46128dc08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0184.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTATATCAGCCTGGCAACAACAGGGTGTTCGGGGGGCAGTCTACTGTATTATGTGGTTGCGCAGGCGAGTATCAACACGGAGAGCGTCCCTAGGTTTTGGAACACATCACGTTTAGCAGGTAGAGATATAGGTATATGCTTTGCAGATCTCGAATAGAAGCCATCGCGCTCGATAACCTATCCGACATCATAGGGGGAC"))
+(assert (= z "gcuuaucuucggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2
new file mode 100644
index 000000000..101fc8403
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0185.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCTAAAAAGACTCCGAAGAGTTTTACGCTAGTCTATATATTGTTGCACCCCCGCTCCGGGCTACGGAGTCTATTCAACCATCAGGAGACCACGTTACAGTCGACCTACGCTTGTGCAGTAATATGCCACAGAGGGACGGTTCCGATAGACATAAAAACAGGGAAGTTTTAACGAGAATATCCGGCGTAGTCTGCGGGAC"))
+(assert (= z "uguau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2
new file mode 100644
index 000000000..e576792a5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0186.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCGATAACGTCAGGTCGAGTGCCGTACAGTTTTCTAGGCCCGTCTTGATTAGAATTCAGTGGGGAGTATCAGACTATCGAGCGTTAGGGGCACGGTTATCTGCTCTCAGTCTCTCCTTTCGATGGACTACTTCTATACAAGAACAGAGCACAACCATATCTTGTTGACAACCTCCGCGTGCCAATAGCAACCTCTTTAG"))
+(assert (= z "uugguauagaacaacuguug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2
new file mode 100644
index 000000000..8053c761f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0187.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTGCGCACAAATGTCGTTGTGGTTGTACTAAAGGTTAGAGAGCGTGAATCGGGGTCTTCTCCTAGTATGTTACCACAGTGACATTCCAAAGTACCGCCGCAGGTTTCGAACCATGTGATTGTAGGCTGGGGTCGGCGTCTCTCCCGCCATCATGCAAAAAGCTTTGGCCGACATCGTATATCGTCCGCAGCAAGCTATG"))
+(assert (= z "cacgcguguuuaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2
new file mode 100644
index 000000000..77ea649a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0188.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGTTATAGTGCTTTATAAACCCCGCGAAAGGGTCAGAACTAAGGCGCCAGGTTATTGAATTAGTTTCAGCCGTTTTAGGGTACCCCAAGTGGTGCGACGAGTACGAATCCTAGTGTGCATTAAGCTGGGACGGGTTCCTTGCATCGAAGAACCGGACGCTCGCAAAGGAGGAGAAGCGAGGTCGGTAAGCTTCAACGTA"))
+(assert (= z "uccucuucgcuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2
new file mode 100644
index 000000000..36887d511
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0189.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGTGGATATGGAAGAAAGCGCATCGTGACGGACACCCGGGCTAACGCAGCAAGATACTAGTTCCCCTGGAAATACAGATCCCTCGTTAACCTTCAATGTCGTTCATCTAAGAGGAAACCCTTGAAGAGGAGCTAGTACATCCTCTGCGCGGGATTTTTCGGGGTAGGCTGTACCATGGAGAACACAAGCCTTAACACTA"))
+(assert (= z "ggaaguuacagcaaguagau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2
new file mode 100644
index 000000000..f1613fee9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0190.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTAATTTATTTGTTATCCGATCCTTGTGTCGTGTTCAGACGCGGACGAGGATGATATTTAGTCGACAATGGGCCATTATGTTGTATTAAAGGGGCCCTGAGCCACTGGTATTCAGATCTTCTTCTCCGGTCCCAATCTAAGGACCCGCGTACGATTACGCGTGCCGAGTGGTTGCGACTCGTCTGGCCTATAGTATCGT"))
+(assert (= z "aaguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2
new file mode 100644
index 000000000..53711c0a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0191.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAACGTGCCTGCAAATTACTCAATAGCCACGGCTATGACTGGGCGTGGGAAGAAAGCTTGGTAGTAAACCGGGTGCGAACGAATTTAAGCTTCGGAAAATCAACCGCGATCGTCCAGTAAGGGGTCACTGGCACTACCACTCCTCACCTTATCGACCAAAAAATCACAAGTATGCATGTCGGCAACTACCGCAGAAAACC"))
+(assert (= z "cuuucgaaccaucau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2
new file mode 100644
index 000000000..815a89629
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0192.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGCCTAAAACGCATAGGTATGGGTAACCATGCACAGGATGTGGTTGTAATCTGCGCCTTTGCCGTTCACACTGGCTACCGCTTCCAACCCGAGTTATCGTCGCCCGACCGCGACCCTCCCAGCAGCGGTTGCAGCTTGCGGGCCATTTTAATTCGGCTTTGATGAGTCCGATTTGTCTCACATAACCAAGCCGGCGCGT"))
+(assert (= z "cgcugggagggucgu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2
new file mode 100644
index 000000000..d802403c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0193.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACAGAGACTCGTCAGTTTGCAGGCAGCTCCGAGTTGAGTGGACCAGACCGACAAAATTAGTGATGTACTTTAAAGTTAATGAGGAGGTCGCCAGCTCAGAAAGTATTAGTTTCAAGGTCATTGCAGTGTGCGATGCATGAGATGAGTCCGGCTGGCACATCACACTGACACCCACCCTAGATTCGCTTGGGCAAATTGA"))
+(assert (= z "guuccaguaacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2
new file mode 100644
index 000000000..baed6407a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0194.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTGCACTCCTACATGTCACAGAGCCTTTATTACCTCATTCACTAAGTGTGTGGGGGTACACCAGCATCAACTAGCGTAGCATTAGCTAACCTACGGAACCTGACCTAAATATAGACCTCTCCTATGAACTTAGTTAATTTAAAACTGTAGCCGACCCGTTGTTCGCGGAAGTTCCATTGACAGCAAACTGATAATGAAC"))
+(assert (= z "ucuggagaggau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2
new file mode 100644
index 000000000..764f859ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0195.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AACTTTATCCTTTCGACGCGGCCTGAGCAGTACGACGGAAGCAACTTGGTCCAAAAGCTTGTACTTCTTCGACCGGCTGCCTCACTCCCCGCAGATGGGTGAGCTCGACTTCTTCAGAGCTCGGATGTGCTGGTCTCCCCCAGAAATACAATTCTCAACCAATAAAGTAAGGGTAAGGCGTTGGCCCAAGCCGCTACCTA"))
+(assert (= z "agaggggguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2
new file mode 100644
index 000000000..126b143d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0196.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCAGTCTGGAAGGTTCTCTCTCTGGCAAGTAACTTATACAATGAGAGGTCCATAGCAGGACAATTTAAATCAGCATGCCTTAAAAAAACGACGACTCTGAGCTGGCTCTTGAATCATCCTCAGTAGCAGAGCCCTTCTCAGGTAGCAAAATGCTTACCTGCATAAGTCTCACTTACTCTGAACAGTGTACAAAGGAAAC"))
+(assert (= z "ggaagaguccaucguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2
new file mode 100644
index 000000000..5065e968b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0197.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTCCAATCTACCTTGTTCGACAGGGCTTACGGAACTCCCTCTTCTGTCCTGAACTGAGCGGAGGCTTCCTTCGCGATATCACCGTTCTGTCGCGTCTGTTCACGGTCTGACGTCGGCCGCACAAATTCATGGCTCTTCGTTTTTCCAGACACTGAAGCGGCGTCCGCAAGGTAAGGTGGTCTGGAGGTTGACAGTCTCTC"))
+(assert (= z "uccaacugucagagag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2
new file mode 100644
index 000000000..13db88e0f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0198.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATACTCAACCAGTGTCACACTGATCAAAGCGTCGTTGGGAAGGTCAACACGGGCAAATAACCGTGGTTCACGCACGCCTGAGACCTGTCCTACGACCGTACCCGACTGCGTTGGTGAATCTATGGCGATGCAATGACAACAGAGGTTGAGCCATAATGTAAAATAAGGCTTTGAGGTCCCATAGTGGCGAATCACGCTAG"))
+(assert (= z "ucuggacaggaugcuggca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2
new file mode 100644
index 000000000..7aa533611
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0199.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATGGTCTCCGATGGACACAGCCCATGCTTGCTATACACGGTGGAGGGTGTGTCACCCAGCTCCGGGAGTCGATTAGCAGATTCGTGGAACAGGCCACTCAATATTGAGCCCCTTAAATGCCTATCCCTGCAATACCGTAGTTCTCGACTCCGGAGCGACGAATCGAACGGCTGTGCTCCCGGTGGAATTCAAAGCTCAG"))
+(assert (= z "ccgacacgaggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2
new file mode 100644
index 000000000..9ed76a8eb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0200.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATAGGCTCGAATTGTAGACGGCTGAGCGACCTTACCTTTAAGGTTTTAGCTGGTGAAAATACTAGGGTCATACGTTGTTCTAGTGTCAGGGCGGGTATACAACCAATTCCATCCCTTAATGGCTGAGCGTACGGGGGAAGGTGCCCACGCAGTTCTCGTCATCGGACGATGAATGTGCAAGTAGGTGCATGTACACGCCC"))
+(assert (= z "gcaugcccccuuccacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2
new file mode 100644
index 000000000..017f8e0d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0201.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCCAAGGCCGAACCGGTGAGCGGGCTTACAGTAGTCACCTTAGTCAGGTCTTGTGTCCTCACCCTCAGCTGCAAAGTTCCCCTCCCGGACAGTTAATGGCCTATTTATTCCGGGGTATCAGACGTCTCTTTTTTAAGTTCTCTACGACTAAGCTTTAGAAAAAGTGACGAAAAACGTATGACTCATGGCCATTGAATAT"))
+(assert (= z "gaugc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2
new file mode 100644
index 000000000..d2a9042ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0202.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTTGTAAAACCCGGGCGCCACCCTACCTATGTCACATTTCGTGCGAATTAGTGCCATCCCGGCCTTTAGCCAGCCGAAGGTGAGCGCCAGGTGGTGGGCGTGTCACCAGGAGCAACTGTGCAAAGGCAATAGTATAATAACAGAGCTCGCCTTGTAAAAGCTACCCCTACCAAGTAGCGACACTTGCTGAGTGGGGACA"))
+(assert (= z "acgcuuaaucacgguagggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2
new file mode 100644
index 000000000..c6bf3534b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0203.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCGACAAAGGTTTGGGAGAAAACTGGGTCCCAAAACTTGGCCTAGTAGTTAAAATGTATTATAAAGCAAGTGTCGTGAAATAGCCACGTAACCAAGACCCGCCATACTGCTGGACGCGTTTATTACGTTGGTTTAGGAGTTGCTATGCTTGCCCGGAACCTTCGACAGTCTCTTCCTCGTAGAACGGGAGACTATTCTG"))
+(assert (= z "acgac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2
new file mode 100644
index 000000000..32000bfbc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0204.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTTCCCTCCACTGAGGGGAGTCCTGAACTGGACGGACACAGCGTTACGAAGTTGAGATCAATTCAAAAGCCGGAAAGCTCGCGCGCTGGAGCTCGAACCGATCTACAAGGAGTTACTGGAAGGCCCGGACACTACCAGTATCCGTGTTGAGGGCAGGTGGCATACAGTAGTGTTGTGATCCGGGGTAGGGCTACCCGAA"))
+(assert (= z "cccgauggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2
new file mode 100644
index 000000000..864391142
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0205.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTTGCGAACATCGGACTGGGACAAGGATCTGCCCCGCCCCACGGCCGTAACTGCCACCTTATAGTGGCGCAGATACTTGGCTAATCTGAGAGGTTCACGACCTCCTCTTTAGATTCAAACCTATGATACCAGGAACGATCTGCGATCACCTGTGCTGGACGGCGTCGGACCTCCCCCAGAAGTGGAGCTCTGGAGTAGA"))
+(assert (= z "agaaaucuaaguuuggauac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2
new file mode 100644
index 000000000..d4eb4ec00
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0206.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCATCGCCGAGCAACATCTTACGAGGTCACTTGTCCGGAACCCGTGAGGTATAGCCCGGTGCGGTTGTATCGATAATCACAACGCATTCACGCACGTGTCAGTCATCTACGGTTTCATCCCCTGGCAGGTAGCGCCCAAAGCCCGCGGTAGAAGTGGCGGTCCGCTTACTTTTTTCTAAACCGGCTGACCGATCGTAATC"))
+(assert (= z "guagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2
new file mode 100644
index 000000000..5c86c849e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0207.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTCTGTCTCCGAAATGCGTGTGCATCTCCCCATCGTGTTAGTTCCTAAGACCCGGTGACAAGTAGACGCCATTGGAAACGAACGTGCTAGGACCAAGATAGTTACGTCATCTCACTACCATCCATACCCATGCAAATCAACCTGAACGAGAGTGCTTAATTCACACTTGTCGTGTTAGTCTTAGGCGACGCTGCTCTGGA"))
+(assert (= z "ucaaggauucuggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2
new file mode 100644
index 000000000..f99c2a1a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0208.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCAGTACCGGAAGTGTTGCAGGCTTCAAAGCTACACCGCCTATTTCAGCGCCTTAGGCAAAGGATGTGACTGCTAGGTAAGGGCAAGAGTAGAGTCATTACTGACGATCTCTCACGTATCGCGATATCTAGGCCCCGCGAGACCGTTGTCTTCTGTACCCATCTACTGATGGAAATTGATGTTCAGTGGCTATGGCGCT"))
+(assert (= z "augacugcuagagagugca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2
new file mode 100644
index 000000000..9471de3c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0209.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGCGCCCATGAAGAAAGAAAGGCGCGCGTCCCTCGGTTGAACGTCAATCAGAACGGTAGATTGATTCCGAATCTGTTCCTATGAACTCCTTTATATGACGGTCGGCCATTGCCGCTGTCATGACGTGATTAATCTTATAATAGTAAATAGCGCTACTAATACCAGTATCGGCTCTTAAGTCTTTACAGAGCCGCACCAT"))
+(assert (= z "uggucauagccgagaauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2
new file mode 100644
index 000000000..43b73b5cb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0210.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCGTGTTCCTTCTGTCAATTACTTGCGCGAGTGAATCAATTCCGTAGTATGATCTACTTCAATTTGCAACAAGCTACACGTATTCAGTAGGGAATACCACACTACCGAGGACTGACGTAGTGTCAAACCTCACTGGATATCATACTTCTAACGCTAAATTGGCTACCCACCAAGGGCTCGCAAATATGGGTTGGGGGATC"))
+(assert (= z "caucauacuagaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2
new file mode 100644
index 000000000..8e369709e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0211.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATATGCGACGATGGGTATGTAGCATGTGGTAACTTCGATATTAATCAGAGTGAAACCCATAAATGTAAATAATGATTACGCGCGATTAAGCGAAATTATAGAATGAGGCGCGCAATCGCGTGCAGGATGGTTAACCAACTCTGCTCTTAAATTGCTGATATCAATTCCTGTCAAGATTTTAATGACGGGTGAGGGTTCA"))
+(assert (= z "gacuaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2
new file mode 100644
index 000000000..73453604d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0212.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCTCGCGGCCTGTTTAGCACTCGACGAACAAGCGTTGTCTCTACCCATGGCGTCCATGATGCAAAGGACCTATCGCCTAAGATACAGGGCGTAATGTCATCTTAGCATTGTTCACTATAACCGATTACTGTTTAGTAATCTCTGGCCAGACGCTACCACTCTGGGTGTTCTATTGGTAACTAGTGGCGCTTGATCTAAAC"))
+(assert (= z "ggucugcgauggugag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2
new file mode 100644
index 000000000..1510bc373
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0213.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATTAGTCCGCCATGATACATTTCCTGAGCAGTTACTAACAGTTTGTAGCTGTTCTTGTCCAATGGAGGCCTCGACCCCGTGCGGGAAATGCCGAGCTCAGGCCTCGATGAGCGTAGCGTTACGGTTAGTTGTTCGAAGGTAGCCCAAAAGGCATGGAACACGTGCCTCTCGCTTAACTCAAGGTTAGCGAAGTACCGTA"))
+(assert (= z "caacaagcuuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2
new file mode 100644
index 000000000..2b9127a5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0214.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGGAAGAATGGTATAGCCTGTAGGGCATCCCGGCTCCAGTGTAGGATAGGGAGGAGTTCAGCTACTCAATGTCCGGCCGTGCGCAGGGCAGGGAGCACCGCTTTGCCCTTAGTTATGCCTTACGACAATTATGGGCTGATGACCCTCAATCCATCGCACCGAACTTCGAGCCTCACCTGTCCTTAGTGTGCTCGGGAAG"))
+(assert (= z "cgggaaucaaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2
new file mode 100644
index 000000000..56f8426bf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0215.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATACTTAATTAGGCCCCTGCTATGGACCCACATCACTACGTATTCCGGCCCTCCCCAGCATATGTCTAAACATCCAAATACGCGCATTTGTGCGGCGTATACCTCAGGGACCATTCGAAACACAACCACAAGCTTACTCGCTCCAACCGTTAAGTATACCCTATTTTCTGAGAGGACTCACAGCAGATGACTGACACTAA"))
+(assert (= z "ucgaauga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2
new file mode 100644
index 000000000..d41689dee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0216.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGACTTGACCTGACTTACATTAACTGTCCGGTTACAATAGAAATAGGCACCAGAATACCGCGTGTCTGGCAATGCAATGGCCTTAACGAGTTACTCCTGTCGTCCAGTAGGAAAGGTAAGCTGGGCAAACCTAGCCAACCAAGATTTTACTATGGGGAGCAATCGTCTTTAGCCGGATGGTCTCACGATGCTGAAACGAC"))
+(assert (= z "uugcucaaugaggac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2
new file mode 100644
index 000000000..5987f475c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0217.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCAACTAAACGTTTACCGATGGCAAAGGCTGACCCATCGTTGTCTAGACAGTTCAGCACTTAGGACCAGAACCCATCGTCAGTCCACACTATCGGTCACCATGAGTGGTGCAATTCTACAATAGAACGTTTGATGAAACGCCGTATTGGCCGGGCCCTTATGGTCCCGTGGACTCGAGGGCGGAGCTAGTTCTAACAGAG"))
+(assert (= z "uggucuug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2
new file mode 100644
index 000000000..1aceb4f67
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0218.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGGAATTCCAGAGACACCATGAGACCGCCGCTCACACTGTTTGCAGGTACACATGTTTCGGGTTCAGCATTGTGCGCATAAATATCTTTAAATACTGCAATGAGTTGTGAGCTAATCAACAGGCGCCTCGCGACCGTATTCTGTAACGATGCGTGTGCATTAGGTTGTGTTGTCTTTCCACCAGCCCGGCTCCCTTTGA"))
+(assert (= z "cuggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2
new file mode 100644
index 000000000..c3a16eaf8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0219.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTCGCAGTTGAATGTTGTCCGTGCCTGCATGTACGCCCAAAATGGGTTTGCTACGCGATTCGTAAGCGACCGTGAGTCGGTCCGGGTAAGTAACTGTCGCTCACATTATAGCGCACTGCTTTAGGGGGAGTGTGCAGCGAATTTGGAGCAGACTCAGATTCACAAGCCGGCGACACCCCGGATGAGTGACGTAGTAGAGG"))
+(assert (= z "acgaugcgcuaagcauuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2
new file mode 100644
index 000000000..001ff2d14
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0220.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCACGATCCAAATTAATTCCGCCGACGACAGCAGACTGCCAAATAGAAGACGAAGTTCCATTCGCGGTGACGCCTCGTCATGGTCGGAAGATCATACTTGCTGCCCCGAGTCACTTCTACTGGTGCAATCGGGTGCACTGAAACGCTCATGCCGTGATAAGATTTTACAGCGGATATTTGCTCCCGCCTAGCGAGGGCA"))
+(assert (= z "uaaacgagggcggaucg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2
new file mode 100644
index 000000000..5e5b41320
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0221.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGTGCTCGGTACGGCACCTGGAAGATTCTGATGTTCTCACTTGTATAAAAACAGCAGACCTGCTCGCTAACACCAGGTCAAAGGAAGGTCATAATTCTTTCCGGCGCAAGGAGCGGGCCGAAGCCGTTACTTCAGCATCCACATTCCTGCCGATAAAGACGTATCAGAAGCCAGAATTGCCTTCACTGCACCACTAGGT"))
+(assert (= z "cggcuauuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2
new file mode 100644
index 000000000..a666bbc36
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0222.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGCTCGTAAGTTACAGCTATGTGATGCGAGCTGATGTGTAACTATTAGGCAGCGCTGTTGACGCAAAAACCTGGAGGTGGGACACCCCTAGCTTTTACCCTGGTAAGGCCCAGATTGTACCAAGTCGAGGCGACGGAAAGCCTGTTTTCTCTCGAAGGGTTGACGCTAGATTACACCCCGGTTCCGTGTGCGGGTTGTG"))
+(assert (= z "aauccgucgcgacaacug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2
new file mode 100644
index 000000000..382f66cbc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0223.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACCTCATGAGGCGTGTGTGTTCTTTCACATGTCTCTTTTCGTCCCCACAACGCTCTGAGTCTCGGGCCGATACTTGTCGAATAAGCCAGCCCTGAAGAGGCTGTAACCGGTATGGCCAGCTCGCATCGACAGCGGTCCTAGCAATACTGCCATCTTGCTAGGACAGTGTCAAAGATTATGATCCAGCAGATATATCGTC"))
+(assert (= z "gaaaagcaggggug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2
new file mode 100644
index 000000000..85a195099
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0224.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATATATCGAAATTTACGTCCGTCACGCCCAGCAGCTTGGCCATTAAGCCCTCCCTGCTCACCGGTTGGTAACCCGGAATTGCACGAATAATCCTAAGAGGATCTTGGACTCGCAGTATTGGCAACTCGTGGCTCCGAATTTGGAATTAAAGACCGAGAATCCAAAGGCACTAAGCATAAAAATCATTTTACGAGCTCTC"))
+(assert (= z "auuucuggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2
new file mode 100644
index 000000000..64002c4a4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0225.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGCCTGCTACATTCACTCACTACAAGTATCCACCGAACTTTTAGGGGTCGGAGGGTCTCAACGAGTAATTATCCCTCCCCACGTTTATGAACGACTCCGTGTGGGCACGATCCACGGGTCCACTGGAGCGAGATACCATTCTGCCGCCTTTACGGCAGACGGACTTCCGGTGCGAATCTAGGGGCACTCATCCGAATGA"))
+(assert (= z "guggcuugaaaauccccagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2
new file mode 100644
index 000000000..900204afc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0226.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGTTGTGTGGTCCCGAAAACAAACACCGAAGCGCCGGCAGTCTGAATGGCGAAGCCCCTCTCACTTCTTGCTAGTTGAGATATGTGGATCGGACGGGGATTAGTAAACACGGTCATTTAGGGCCGCCGTCTACGAGTGGCTTTTTAGGCCTGGGCCGTCTGTTCACCACACGGTGATTACTAGCATGCTCTTCACAAGT"))
+(assert (= z "ccacuaauga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2
new file mode 100644
index 000000000..8735067ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0227.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTATCCTACAGTCCGGAGCTCAGCTCTCAGGCATTTGCCTTATAGAGGACTTTCAGTTAACGTAAATTACAGGATCAGCGTGGACTTGCATTTCTTCCCGATATGGCCATCCGAAAGCTAGGTTAAAGAATCGTAAAACTTTGGTTGGGTAGTGCTCTTGGACAGTTGTTGAGCTCATACCGCTTGAGAATCGGACCGG"))
+(assert (= z "uaauguccuaguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2
new file mode 100644
index 000000000..27e840202
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0228.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGATTTCTTTGCACTGGGTACAGCAGTAGGAGTGCAAAGGCGCACCAGACAGCAGAGCGGGTCCCAGGGATTGAAAGACCGGCTGGCAAGTACTTGCGCATCCGCTGTATTGTCTGCTGGACCGTTGCCGTTGGAGTGCTATGCGTAGGCTAATCGGAGGTAAAACTAGTGACTCCTCTACCTTCAGATTACGATACACA"))
+(assert (= z "agacgaccuggcaacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2
new file mode 100644
index 000000000..5297175b2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0229.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTTCGGACAGGACTTTTTATCTTTGTGCTGAATCTGTGCAACTTAACGGTTCGGAGCGGAAAAATCGTCAAGCTATGAGGTACAGCTAGCTTGGGGTTGCCGGTGAGGGGAATAAGAGTGCTGTACACTCTGAGTCTACCCTGGCTCAGCGTGCTGAGGAGAAGTTCTTTTCATTAGTGCCTGAACCTAAGTTGGTCTG"))
+(assert (= z "uagaaaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2
new file mode 100644
index 000000000..560061c9b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0230.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGGTCAATCATCTATACACACGAATTGATCAGCCAACATGGTATCCTGGTTCAGGTAATCGTAAGAATGATCATCATCATCTGTCTTTAAAGCTGGGTTTACGACTCTGCTCACCAGAAGTGGTAGGGATTATTTACCGTGTGCTAGTTACCATTCTCGGGCTGTCCCGAGACACACTGTTCTAGCAATTCCCTATCAA"))
+(assert (= z "cacgauca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2
new file mode 100644
index 000000000..238ded1f3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0231.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCCAGGCGTCAGTGGCGTGTATCGGTCTATAATCTTCGGAACTCCAACTTGATGAGCTCAAGGGGGTGAAGAATCCATACGCCGAATGGGTTTTGGAGTCGTCTACTGCTGGAATATATTCCCCCTGCAAAGGTCTCAGGACTGAGGCATATCGGCCAGTATTGCACAAATTGCAAGGCATTGGCCTCACCTCGCAGGG"))
+(assert (= z "ccucagcagaugac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2
new file mode 100644
index 000000000..08ab879dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0232.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCACATTTGGGATTTGCTATTGCTCGTCAGCCAGCGGATCGCAAGATCACTACGAGCCGGTCTCGATGCTGTGGGATGATGATACGTGCCTAAGTCGCGTAGATGCGTGTTCTTGATAGATTTAACCCGGCGTGTCCTCAGCTCACCATATATCGTGGGCACAGCGTCCGCATATTCGAATGTGCCGTACAGCCAAAGAA"))
+(assert (= z "acuacuaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2
new file mode 100644
index 000000000..a1bd72806
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0233.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGAGTGCAACAACATCCAGCGCGGCACCACCAGATTTGTTTTAGGGAATCGCAGCTTTCTAAATGCTGAGGATCGTGCAAACAATATTTTAGGACTTACGTCCCGTAGCTCACTGCCATCTCAGGCGTCTATGTGGCATTTAGACTTGCTACGATTCAGTCTATAGCGTGAGTGGTGTACTGATGAAGCAGGGCCCTGAA"))
+(assert (= z "guagaguccgcagauacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2
new file mode 100644
index 000000000..121b805bf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0234.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGTCCGGTTTGTGCCTTGACCTATCAACGCCAGGGGTCCAGAGGTTTATAAAGGATTAATTAGCACCCAAACGATGAGGAACAGGACGCAGACGGTTGCGGGCAGCCGCTCATTTGGCGTCTACTGAGTATATAGGTGTATGTGCTTGAGGATGAACTGCAACTGAAAGACGAGGACCCTCCCTTCCGTCCCGGCCGCT"))
+(assert (= z "ggguuugcuacuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2
new file mode 100644
index 000000000..3a2167b09
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0235.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCTCTTCTATTACGGGATCAGCACACAAGGACATGATTCGAGCTTTTACGTTCGTAAGCCCTGGTATAGTGGACATAGGAGTTATATAGGGACCGCTCCCTAATCAGGCCGAATAAACACGAAAATTAGGCTTCAGAGACGAGTGAGAGCATCTTGATCTCTCTTTAACTATAGCAGGGGGAGCGCGAAATGTCATCGC"))
+(assert (= z "uagagagaaauugauauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2
new file mode 100644
index 000000000..f45da901b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0236.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGTTTGTGCTTATCCCTGCTCCGGGGAGGGATACTGGAGACCCGCTGCGAGCCACCATAACGGTCCCGCTTTAGGTCCTTAATCATAATTATCGGGCCCCAGTCCTCCACGCTCTGATCCATTTCTCGGCTATAGTGGTACTGAGTCCTAGCTTGCAAGCTACTGGACGCTAAGCCGCCTTGACAAGGTATAGACTTCG"))
+(assert (= z "ggggucaggaggugcga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2
new file mode 100644
index 000000000..86b529010
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0237.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTAAGTTGAACTAATCCCGCTGGCTGGGATGCTAGGAACATAAGCCACGAGTTGGATCAGACAGCAACTTCTGGTCATGTCAGGCTATGTAAGTTACTACCTGATCCAGAGGAGCCGCAAAAATGGACATTACCAAGCAAAGCCGATGTCTTTCAGCAACCAGAAATATACATGTGCGGCCTTCAGAAGGTAAGACGTTG"))
+(assert (= z "agaccagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2
new file mode 100644
index 000000000..105835d6c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0238.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGCTTTCGGAGAAGCGAGTTGAGTATTAAATGCTTACCTATACCAGAGGTAATCTGAATAGGGGTTTATGTGCTCCCAGAAGCCGTGTTCATTGCCGGCCGTTTTGCCTGGCGGCAACTCGTTCTGCATGGTAGCAGATCCATGCGCAAGTCTGCCACGAGCAGCTGTAAGCGAATTCATACTCTTTGGGCCGAGTCAA"))
+(assert (= z "cauuagacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2
new file mode 100644
index 000000000..5252e1a5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0239.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCCAGTGGCGGTGATTGGCCACCCATTCTGACTCGATAAGCAACCGTTTGAGATTGGTCTAGAAGAGAGGTCCACGCCCGCCTGTATAGCGCGATACTGAAACCCGCGCCACGCAGCTCGGGGATATTTGCATAGAGACCCTTGAGTCCGCGGGTTGGACTGGTTCCCTTCAACGCTACCATGAGGCTTGGTCCCCCGG"))
+(assert (= z "gcgcuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2
new file mode 100644
index 000000000..41ad0aabd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0240.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCGAAGGGCGAGGGCATAATGGTTGCAGGGTACCTAACAAAGGCAATAAGCAGTTGCGACCACAACCAATATTGGCAATTCCCAATGCGAGATCCCCCGGGTGTGGATAGTTGTACCGGATAGCTGACCAAACAATTGGGTCGTATAAAATCTCAGTACATATACTGTCGTGGATAACTCGCACCTTTTGTTGGCGATG"))
+(assert (= z "caaccgcu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2
new file mode 100644
index 000000000..25462051d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0241.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTGTGAATTATGGAGCTGATTGTCAGGCCCAGGCAGATGTGGGGCAACCCTTTATAGGGAGGCGTATTCATGTGGCCGGGCGAATCTCTTAACCGAAGTACCAAGGCCCACAGAATAGCTTCGATCTTATTCGACTAGCTGGTTACTGAGCTTGACATTAACACACTTATAGGCTATTGGTCGATACCTTTACACATTC"))
+(assert (= z "uggcuucauggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2
new file mode 100644
index 000000000..4b272338b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0242.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTAGGCATTCAGACGCCGGCGTGTCACGAAGTGAGCGAGCATGATTCAACTCAAGGGCCTAACTTGGGAGATTGTTTATGCTCCTGTCGAACTCGTAAGGTTAAGTACCTCCAGCGGACTCTCGCCCTATGCAACACCATTTAAATAGTCAGATTGATCTTAGTCCCACTCGGCTGAGAGGACAAAGGGCTAGCAGATG"))
+(assert (= z "gggauacguug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2
new file mode 100644
index 000000000..201a3709c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0243.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAATCATGATGCACGGTATTTCGAGTCTGTTACTTTGATCGCGACTGACATCTTCAATCGGATGGTGATTTTAAATCGCAAGAATTTCCAGAAGTACGCGAATATAATCTGGTTTCGACCGGACGAGCTCGAAGCGAAACGCCGGATCAGCAAGCGGTCGAATTTCTGAGAGAGCGCCATTCTTCCGGGACGAATAATA"))
+(assert (= z "cugcuuauuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2
new file mode 100644
index 000000000..b8caf1564
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0244.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTACTATCAAGCCGACCAATCACTCACGCACTTGTGGATTGGCAAGAACTACTTGAATAGCTCTATAATGAATACATAAAGCATGTTCGTGAATCTTGAACTTTTTGTAAAATCCGGCCTAGCGCATCGGCCCGTCCAGGGCTACAACAACTAAACTACCTAGCAGGTTGCCGATCGGTATGGGTCTGCGAAGTACTTGG"))
+(assert (= z "ugaacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2
new file mode 100644
index 000000000..ad21b3eef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0245.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGATAAGTCCCCCAAATACTTTCTTAACAATAAATCGGCTACTATACTCCGCAGCCCATAAGTACACGTATATTGCCCATCTATTTTCGCCAGCGTATCTTGGCGCCGGACTTCTAGTGGTGCAAGCCGGCTGAGAGAGTGTCGCATGAACCTCGCAGCTCTTTTCTGCGTAATCAGAACGGCACGTTCCTATAGTCAA"))
+(assert (= z "uauuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2
new file mode 100644
index 000000000..221626709
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0246.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGGCAAGCATTGCGAAATTGGGGTCGTGTGTTAGAGTGTCTACCGTGATCGTGCATATTGAATCTGTCCTGCCGTATGTATGAGTCGGTGGGCTCAGAAGGGCGACAGAAGCGCCTTGATCATTATGGTAAGCATTCCCACAATCCCCATAGGAAGACCTCCGCGCTCCATCCGCTCTACCTTATAAGGTAAACGTTCA"))
+(assert (= z "cacuagcacguauaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2
new file mode 100644
index 000000000..269fea8b6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0247.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGCGCAAAAGTGACTCGAACCATTTGTTTAAACCCGCTACGCATTCTTCACTGAAGATGGCGGCCTGTGCCACGGGGAACAATGCATTATCAAACAAACAGTACACCCGTTATCCGATAGGGCCTCGGAACACTGCATGCGCGGTGGCCAAATTCCTACGAGTTCAACTCGGCTAGGGTCGACCGATTTCGAGCGATAC"))
+(assert (= z "ugacguacgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2
new file mode 100644
index 000000000..d1759b09b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0248.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAATCTCCGACGTAGATTTTTAGCAGACATGCTCCCTGGCAGTAGTGTCATGGCTGGCCAAATTTTTAGCTTCCTAGCGCTGTGATCTGCAGGCCACCGCCCTGGTCGCTCCCCCTACTTCCGCCTGTAAATCTTCTTGGCTACAAGTACACGGACTGATGTTAGAAATTTAAAGGCCGCGGGCAACCTTGCGCCGACCT"))
+(assert (= z "ggaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2
new file mode 100644
index 000000000..f99c866ea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0249.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGCTGACTGTACGCGTTCGACTGGAAGGGCAGGGACTAGTCGTGCACCGGCCCTGTCCGACTCGTTCACCCCCTTTGAAGCATCCGACTTATCGATGTTGCACGTCCGGTGGACTATATTGATTAGCGTGAGGCACATGTACAAAAAATGATGACATACCAACGGTCAAAAGCTCGTTGACATTTCCAGACTCTTGCTT"))
+(assert (= z "agcacguggccgggacaggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2
new file mode 100644
index 000000000..911c4471c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0250.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACGTTTGCGACTTGATCGACCGTTCAAACCGTGGCCCCGGACTCAAAGTCTTCGCCCGTCTATTAGACCCCAACTTGAACACCTCAGAGACTCCACGATCATGTAATCGAGGGCCCAGTTCCCGCTGCAGGCACCTCATCTGCTGTGAGCTATGCGCTGGAAGGGTCTCATGTTGAGTCTTGACGTTGCCGTACTAGGA"))
+(assert (= z "cgcgaccuuccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2
new file mode 100644
index 000000000..7c6bfff0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0251.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCTCACGCTTTTACACGGTCTGGTCAATTTCTTCGTCGCCCCCTGCATGCCAGCCTCACAGTCGTTGATACCACGTAGTATTGCCAGACCTCTAGTCAAATAATATAAGTTATTTTGAAGCATGACTTTCCGTTCGGTCATATGGCGCAACGCTTCGGCCCGTGACTAGTAGGCAAACTGTTCCATCGTAGACAAATGT"))
+(assert (= z "caagccaguauaccgcguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2
new file mode 100644
index 000000000..e61dc24c1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0252.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CATCATCCTGTCCAGGGAGTAGTAGTAGCGTTTCACACCGTCTGTGTAACATATGATCGGGCATGGCCAGATGATATATTCCTCTAAGAGGAGCGAGGCACTAGCCACTCTCAATGCTGACTAGAGCCAGGCGTTAGCGGTCCCGTAAAGGGTTCTCTAAGTAGAATGAAGTACACAATAATATGCCAATATCTTATGCT"))
+(assert (= z "cggugagaguua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2
new file mode 100644
index 000000000..cd151b644
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0253.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGTATCAACGACAACGCTAGTGGCCAGGCCTTACTAGGGACCGATAGTGAAGTAGTTAATGTCGAACTAAATTTTTAGGTCAACAAGAACGCCGGGAGTGTTAGTGTGTTGCGTACATAGCTGTGCTTACAGTTACGGGAAGATGGGTGGACAGGTCGATGCCGAATCAGACTACGGAGATCAACCGCGCGGAGCGACG"))
+(assert (= z "cagcuugauuuaaaaaucc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2
new file mode 100644
index 000000000..b882df0aa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0254.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCAGGCTGCAGACTCGAGTATTGTCAATGGCTCTTATGTTGAAGAGGAATGGCAGACGGACTGGACCGGGGTTAACGTTCTCGTGACACGCACAGTAGCGTTGCCGTAATTCTGAGGCAAAGTTAGCTACTTAAGCAACTGATGTATCGCTGGGCAGTGACAGAGCTCTCTTCTGTTTACTGAATGGAAAAAAATATCCC"))
+(assert (= z "gagcucauaacaguuacc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2
new file mode 100644
index 000000000..27e9e8a55
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0255.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCCGTAATTTGGTATGAATCATTGGACCGTTCCATGTTGCGAGTAGATAAATTATTTTGGCCACGTCAGAGCGAGGACCCCATGCAACGCAACCGTCGTTCCGCAGCCAAGCCAAGTCTAACCCTTCAGACATAATTGGAGTATCCTGTCTGAACAAACTCTTGAATCCCACTCTGTTAAGCACGTATATATACAAACA"))
+(assert (= z "ucuguauuaaccucauagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2
new file mode 100644
index 000000000..8d96d7fcb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0256.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGCGCCAGCGTCGTTGCTGCAGATGTTTAATTTTATGAGGGTTACTTCCTTCACTGGGAAACTTCCAATCCGTCATTCAGTCCCTACGATCCGTCAGCGGCCGCAGGTCGGAGACACACCAAGAGCACGATCCCCGGGACATGCAACCTGCGTTCTCATAAAACGTTTGTATAGGAGTTACTCCCAACTTACAACACCA"))
+(assert (= z "gucuacaaauuaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2
new file mode 100644
index 000000000..6ec9aa4ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0257.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CATTGGTGTGTGCTGTTGCCCCGCACCGGTGAGCACGTTCTATACTTGTACAGGATTCTCGCACATTACTGACGTTTATCGTAAACCAACCCGTGAAACGCGCGTAGCACAATGCTGAGTCATAGAGGCTAAGGTAGATACCCACACTTCTCAAATAAGGGGCAGTCAGATTAAGCAGCGGTCCAAGCCCAAGGCCTTAC"))
+(assert (= z "gggcacuuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2
new file mode 100644
index 000000000..f2aa47a46
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0258.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCAAGAGAGACGAGCAGATCACTGAACTAAAAGATGTAGGGCCGCCGCGGAGAGACGCTGTTTCATGCAATAGAACGGGCACGCCCGGGGGGGCAGAAATAAGCGCTCCAGGGCGCAATGCTCAAGGGGACTTGCCGTAATGGGCCGTTGGCCTGAAGATATATCTTGCGCGCCTACAACCGCTAGTCGGACGTTCTGG"))
+(assert (= z "caagac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2
new file mode 100644
index 000000000..891f8e92f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0259.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACAGGCAGGAGTGGACCTGCATCGACGGTAAGCAAACGTACCGCATGAAGTTGGCATCCTTAAGACTAGCTAATGCTCTAACCTTGAGGCGCTTGACCTTGTTTGGAGAACTTTTCTTCCTAGCCGCAATAAATGTAAGTGGGAAGCTGGAAGAGTGCTTTTCCACGACATGTTCCAGTCCAAATCGCGGAGCGACTGG"))
+(assert (= z "uuugcauggcguacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2
new file mode 100644
index 000000000..4457928a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0260.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCCGAACTCCACGAACCTAACTCGTTCGAACATCGCGGCGCTCGCATGCACTGTGAAGATGCTAAACTGGCATGAGAGATTCTGAAAGTCCAGAGTGTAGAGCAAAATCTATTCGAGCACCGCCTTTCGTTTATTATGCAATCGCCATTCAAATACACTGCTATATTTTCCCGCTTTTTTTATAGGGACGCTTCCGCTT"))
+(assert (= z "ucacau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2
new file mode 100644
index 000000000..b33ae62e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0261.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGCATCTGGTCTATGTCTGTCTATTCAGGCTAGGTTATTAGTGGCGTTGGTCCTGAGTAAACACGGTCAGCGGCTCCACAGGTGATGTCATCCAAATCGCGCCAACCTAGCTCGAGAAGCCAAACGTGCGGGGTTTAGCACGCCGGACTGGACTAGACCATCTTCGAGTGCAGCAGTACTGCTCGTGCACGAACGCGAA"))
+(assert (= z "acgcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2
new file mode 100644
index 000000000..aee0920fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0262.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGCTGCAGTTCGGGGCCTCCGGAAATTAGATGACCCATTTTTCTTCACTATTCTAGGACGTACAATATCTCGGTCTCATAAAACACTGAACTTTCATCTGACCCCGTTCAAATCTGAAAAGTTCCTTTCTGTTCCATCCACATACGTTAGAAAGCTGGGGTGGTTACGTGCATAAAGCACCGGTTATTTCAGTGGACTA"))
+(assert (= z "cggaggccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2
new file mode 100644
index 000000000..05d6bd496
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0263.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAGAGCTGTTAAGATAGTTTCCACGAGCCGAGGATTTTGATCAAGTTGATTCACAGCTGTCTTAAGTGCATCCAGGTGCAGTTCACTCACTCTTACCAACTAAGGTGCCACATTAGCGCTAGCTGGGACATGCACTTTTACGGTGCGAACCAGGATAGCACCACGATACAACCGCATACAACGGGAACTCTTGGTATAT"))
+(assert (= z "agaaugguugauuccac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2
new file mode 100644
index 000000000..e3cb80b8e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0264.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTTTGTCCCCTTGAACACGCGCGTGGCCATGTCGTACTGTCCATTATAGAGACTCCCGCAGAAGCAAGAGATTTGGTATTCCTGCTTTTGGCTCTCAAACACCTAATTCCCGAATGGTTCCCTAGCGTGTTTAGCAACCCCGGTGGCGATTGACTATATCCTTGATTGACTCAATGGGGGAGACCCCCGAATAGCTGTG"))
+(assert (= z "accgguacagcaugacag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2
new file mode 100644
index 000000000..61758c042
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0265.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATTTTCTCACAATGAGGCATGCTAAGGAATCAGAGACTCTTTGCGTCGCCGCTGGGACTCCTAAGGTCCAAAGAAATCGAGCACATGCAGCGGCCCTGGCGAGAAAGACACAGCTGTAGCGGTGGAACCACGGTTGACAATGATAGGTCAAGACTCTGCTTATATACGCAGCCGGCCTGCCATGATGCAGACGACCCCC"))
+(assert (= z "uauaugcgucggccgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2
new file mode 100644
index 000000000..32a205846
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0266.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CATAACAATGGAAGTAAGATTGGCTGCCAGGCTCTATCCAAACGGGTGCCGGAGTTGAGGATTAATACCTTTATGGTACGGAACGGAGCAATGTAAGTCGGCAAATAGCATTGCATGAGGAAGGGGTTTTCGAACTCATATAATTGTAGATAGATTCATGAAGCGCATCTCGGGCCCTTCATTAAATACCCGGTAGGAAG"))
+(assert (= z "accaugcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2
new file mode 100644
index 000000000..5e11a8998
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0267.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGCTGCTTTCCATATGTTGTTAGTCTCATCCTGTTCTGTGCCTGTGTATTGTGCATGGACATCTTGTCAGCTCGATTTGACTAGATCATGCACTACATTCATTTTGTGACGGATTGCTGCTTGGGAGGTGCGTGGGATGTCACACTGAGGCTGGCAGCACACCACGCGTAGATGTTCGCCTGGCCAGGGCGGCAACGTC"))
+(assert (= z "acgaaagguauacaacaauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2
new file mode 100644
index 000000000..59e8ef289
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0268.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGATATCTTGTTGAATTGATAAGCAAGACAAATTCGGATTGGGATATACCAACAACGCAGGAAGAATTGGTCTGAGCTAAAAACGCGTAAGGTGCTCCCGGTTTTACGCATGGCATAAGCCTTGAGGGTTTATCAAACGCAGACGCCAGAGGGCGTTGGACCAACTCTGTACAGCTTTATTCAAGCGAGGTAGTAGAACC"))
+(assert (= z "cgaggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2
new file mode 100644
index 000000000..381b06d05
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0269.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCCCGCACAAAGACACTAACCCCACAGCATCCTGGCTCCCTAATTGCCTTAAGTTTCTGTCTTGGAAACCCATGGGCTATTGTGGACGTACATTATTGATGCTGCGCTCGATATTGAAGGGCCCGCTAGTTGAACAACTCTTGGGCTCGGCAGCATTAGTGTTATATAAGAAATAATAGAATAACACTAGCCAACCCTTG"))
+(assert (= z "cacaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2
new file mode 100644
index 000000000..f0888328c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0270.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCTTATTGCAGCTGGCGGTTATCCACGCAGGCCCACTTTTTGCTTCGACTGTTTGGCCATCTAATAGCTTCCCCATTTCGTATCAGACAGCCGCCCAAACCTGAATCCCGATCGAACAAAATTTAATTCGTGCCCCGATGTCCGCAATCTGCTTTGTATTACGTTCGCCTGGTCGATCGGGGGCATACGACTAGCAAATT"))
+(assert (= z "aucguuuaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2
new file mode 100644
index 000000000..cf5424d08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0271.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATACCAGATGTTAATGGGTGCGCCGACATAATCCAAGCAAGTACGTTGGTTCCACGGATACTGTGTTGCCTTGGATTGGGAGCCGAGCTTTGAGATATGCCTGTGACGTTGCGGGCACCCGTTTCAAAAGAGGAGGGGCTGCCTGTGCCTGTCTCACACTTAAGACGTGGTCTATGAATTCTGTTAAGCCAGTGTTTTTT"))
+(assert (= z "cccgug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2
new file mode 100644
index 000000000..1e29ea1bf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0272.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGTCGGGGTTGTACGGCCCCGGGGGTCTAAGTGATTACATCTACAGTACAATGTTAGGGCGGATCCGTACACCTTGCACAGCAATCATACCCGGATTGCAAGTTATTATAGCGAAGAGGCCAGGAGTATGCGCATAACGACCTATCAACGGTCAACCCTACTCAATTGAGCTATGTAACGTCCCAGTACCACCCAATGG"))
+(assert (= z "cggggccc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2
new file mode 100644
index 000000000..a0b727ff8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0273.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGCGTCCCTCCCGACTCACCTAACCACACTCGGAACCGCAGAAGGGAAGAGTCTGTGGACTGTATAACGATGCAGTAGTCTCCCGGCAGCGAGAGAGCCGTACGCATCGCTCGCACGGACACTGATGAGAAGACCGAGGGTGATTTGTTGTTCCCCGGTTACATCGGGTCCCCTAAAGGATGAGGCTTATCAATCTAGC"))
+(assert (= z "ugacauauugcuacgucauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2
new file mode 100644
index 000000000..98ce05b3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0274.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAAGCGCATTAACCTATGTCTTGCTCCCTAGTCACTGGATCGTTCGCCTGCCATAGGCGAGCGGATGCAGCTCAGCTTCCTTGGTGTATTACCTGAGGGCGTTGCATTCTTTTGTCATCCCGATCTCGGATCATCGGGCCGTCTTTTCTCGCACGTAGTATGGTAGCAAGATCTTCTCACTCGAACTGCTAGAAATTTC"))
+(assert (= z "guucuagaagagugagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2
new file mode 100644
index 000000000..8f8619d12
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0275.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAATTACTCCTGCAAACCCTATGATGAGTCAAAAGATCCCAACGTGTGATGGGTGTGCTGCTCACCGAACTAGCCATCGTCATGGCACTGGAAATAGCGGGTTACACAGGTATGGTCCCATTTGTCCTTATAATGTGGGACTACGGGATGTGGATCCCATAAGGGCCGTTCCCCAACCTTTGCGAAACGTCTGGACCATG"))
+(assert (= z "gguugcaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2
new file mode 100644
index 000000000..71376fef0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0276.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAACACGCACGTCCGGTCATACGGGCGGCGTCAGGCCACGAAACGTTGGACGGCTAATGAACTTGCCGTGGTTTTAGGTTGCTGGAATATCCTCACAACCAAACGCTTTGCGATTATATCGTCGGTCCGTTTTATTGACGCTCACATAATACTCTGCTAGGACGTTCGCGCAAGGTCCCGATTTAATTGTCCCAATGTAT"))
+(assert (= z "augagacgauccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2
new file mode 100644
index 000000000..ce34c76dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0277.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGAATGTTTCGAGGACATAAAGCAAGAGAAGCCCGATTCAAGTACACCCCTCGCCAGACTTCGTAAATACAAAATCGTCCTCAACAAAGGAACTAGAGGCCGTGGTTTCCAGGGCCTATCCAAGGCTAAGGCACAGCACGGACGCGAAGCAGCACCAATTGGGCGCCTGTGGTCTCATGGGGAGGCGTATGGGTGAGTC"))
+(assert (= z "ggcaccaaaggucccggau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2
new file mode 100644
index 000000000..99a925139
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0278.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGGCTACGTCTTACTAGTTGAAAAGCATCCTTATTATGCGGCATAATCCGGGTAAAGCTAAAATGCCCAGCGATTGTAGGTAGTGTACACTCTCGTGCGCCCTATTGGTATATCTTAGCTCCAGCCACTTCCATATCTTATATATCTCGTAATACCAATGAGTTTCCATAGTTGGGATTGGTTGAAGACCGGGCAGGGA"))
+(assert (= z "cgaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2
new file mode 100644
index 000000000..3c2ecf884
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0279.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCCACGTCGCCCCGTTCGACGGTTTTTGTGGGTCCGCTTCGCTCGCCGTGTGAACCAGGGGGGCATAAGCGCTATGTTGCCGCACCGCTCGCGACTCCCGAAAGGATACCGCGTGGTCACAGCTGTAGACTAATTAAACGGATCGGGTCACTCACAAGCTGAATTTCCGTTTCGCCACGTGGTTCGCGACAACGCGTTTC"))
+(assert (= z "gcagcgggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2
new file mode 100644
index 000000000..0f59a1c94
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0280.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATAACTTTCCTCCACAGCAGAGTGTAGGGGAGCATTTACACAACTTCCTGCTGTAGCGAATGGGAGTCCTGCTGACCGGGTACGTGGCCAGTGCGATGCCACTCATTGAGTGTAAACTCGTACATTCGGTGAACACTCCGCTTGCATAAGTCGCTTTCAATTGACTAGTGTCACTCTTGGAGTATTGAGTGTAAGGAATT"))
+(assert (= z "uacccucagga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2
new file mode 100644
index 000000000..dc16d19b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0281.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGAGACGTGCCGCACAGAAGTCTCAGCATAAGAACGGATGAGAAATACTAGCAGTGACTTGTGAATTCTGTTCCCCCCGGCGACTGAGATGTATGTGTGCAAATCCTTCAGAGTCTTCCTTGACTACACAGCGGAGGGGACCTCCTTTGCCCCCAGCTACACTTCCGGAGAGTACCTACTAGCGCCTAAGGCAGGGGGAG"))
+(assert (= z "cguuuaggaagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2
new file mode 100644
index 000000000..d78cb39a5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0282.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATGCTTGCCCTGGTTCGACGCTAGCAACGGGTTGAATTGGGCCCCGAGATCATGTTTAGCGTGCTACCTTACGTACCACTTACTGTGTCGCAGCGTTGGATATATTGCTTATGCACATATATCGTGCAGACCGAATAGTAACCCTTAGTCATGGATGTGGTACATCCTCTCTCACTCTTGGTAGAAAGACGGATCTCTT"))
+(assert (= z "aucauugggaaucagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2
new file mode 100644
index 000000000..9c819841c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0283.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGGGCTCACACGTTCATCTTCCCCTTTGGTAGGTGCGCAAATCCGAATGTCGGGTCCGTGAACATTGGGTAGCCTGGTCCCGATGAAGTCTCACAGAGAACATCGGTCCTCGATGACTTAAATTAAAACTATGCATGATTACTACTTACCCCAAACGTACCAGTCCGGTAGGTCAAGCACGTTAGACGACGGAAGTGGC"))
+(assert (= z "ggcuua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2
new file mode 100644
index 000000000..a2bc8af92
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0284.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGCACGATCCATAGATTACGTAAATGGACGGTCTGGGGGCAGGCCGGGCTGAGTAATTAGGATACACGATGCTCAGAGTTGCACTTGCAGACTTCGTGGGGTTGTCAATCAGAGACAGCCATTGTCTGCAGGAAAACAGAAGTCCATAAGTTGAGAAGGTGCTCGCAAGCACCACCGACGAAAATCAATAAGCCTCTAG"))
+(assert (= z "ccugccaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2
new file mode 100644
index 000000000..739c85283
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0285.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCAAGAAGATGTCAGCACCAGCCACGAGCGCGACCGGTTAGGATGGGCACTCGTCCCCCACCTTCAAGCCTGCACGACGTCCGGATTCCGGACCTCATACTGGAGTGCGGACACAGTTTTTAACGGTAAATCAAGGCCGGACAAGAACTAGTGCCGCGAACTGACTAAAATGTAACTGGTTGGTGGAGCGGCTGATGAT"))
+(assert (= z "uuacauuga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2
new file mode 100644
index 000000000..1d9027b4a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0286.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTTGAACATTGACAGTGCCGAGGTCCAGCTCGTAGTCGGTTTTGCGTGAGTGGTCTTCCCGGAGTTTAACCTTAATACAGTTCCACACTCGCGACGACGTTAAAGAGTGAGACTAATGAGAGCGGCCTCTAGAGGTTGTGAACTGGACCAGCAAGTGGGTTCGCGACTCTATGGCCCTCTAGAACTGCGTCATTGCTAG"))
+(assert (= z "auuucucacucugau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2
new file mode 100644
index 000000000..17b63d61d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0287.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCAGGTGACCACTTAAGACACCCACGTAGCCGCGAGCAGCATATCTGAAGGACCATAGCGTGAACCCGATGCCACCTCCAGTTTCACTCCGCTTGTTCGCTAGCGTCGCGTGAAATTCTTGCAGGCAGGTCTTTGTCGGTCCGAACTTTCAATAATGAGCGGTATGGTACGAGTTCCAGAAATATAGTTCGCTTCGCGT"))
+(assert (= z "auucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2
new file mode 100644
index 000000000..0a9eb1102
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0288.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAGCCTGCAATGGACACTTGCACTTTCTTCTAGGAGCGCGCTTCAACCCTAATGCATCGTTGGAAGCGCCAAGAGCACCAAGTTCCGTTCAGCTAAATCCGACTAGTGCACGTTCCCAGGTCGCGTCGACTTCGTACAGGGGTGCCATGATGAATGCCGCGTTAAAACTCTTACCCGAGTATCATCGCATGTAACGTAC"))
+(assert (= z "aggcaagucgauuuaggcug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2
new file mode 100644
index 000000000..a7ed719b8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0289.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTTCCTTGGTTCGATCATATCTACATCGGGATTATGGGCTGAGTATTCGAACGTGTTGTGTAGATCAAAGGGGATCCTATATACGCGCATGTGTAATGATGGCAGGAGTCAGTGCTGCTTAGTCCAATAACCCACTTGCTGCGGGATGCACCCGCAACCAGACCATTTCCCTTAGGCGCGCACAGATCTGATCAAGCTC"))
+(assert (= z "ugcacaacacauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2
new file mode 100644
index 000000000..58c349cad
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0290.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAATCACCTGTAAGAGCTACCTGGAAAAGTCAACCACACATATCAACTACTCTTCCGTCTAAATTACGTATGGCGAGACAGGAAAGTTAAGAGAATGGACCTGCCTGGCCAACAAGTATTCGGGGGGACGTAGACACATCGTCGTCCAATGGTTGCGCGAAGACGATCACCTAGTGATAATAATTATGTGCAACGGACT"))
+(assert (= z "uuuaguggacauuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2
new file mode 100644
index 000000000..bae8da706
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0291.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAACTTAGGCTTAGTTGGAAGATAGATTACATGTGCCTCCTGAATCAGAAATGTTTGCGTGGCCTGTTTCCATGCAGGCGTCGTCGTAAGCTTAAACGCACGCGGCGAAAGCTATATCTATGAGATGCCGACGTGCGTCCTATTATATGCACATTCGAGTATGGTGGGTTCGCAAGAAGTTAAATGGCATACGTGTTTCA"))
+(assert (= z "cuuagucuuuacaaacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2
new file mode 100644
index 000000000..17856b088
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0292.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTCAAACTTAATGGGGCGATAACGTCTGTACTTAACACAACCGGCGGTACGTGTCATCCCCGTCAGACTTTTTGACTCCATGCCTTACGATCTCCTTTGCCGACAGTTCACTTATGGCCCAGCACCGAAGCCCGTAGTAACGGCGGATTGAGTTATTAGGATGAAATATCCATTCGATGGTCTACTGGGGCGGTGCAACG"))
+(assert (= z "agguaagcuaccagaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2
new file mode 100644
index 000000000..4e7746843
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0293.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATCGGGACAACACGCTCACATGTACCTTTCCGCGGCCGAACAGTTGTGCGAGGTTCCGTTTGACACAGCGGCGTTAAACCTGCGGGTAAAGTTTCCCGGGCTGTGGAGAAGCTTGACACTCGTCTGAAACGGTGGCACAATTGCCCGACCCTTTGCCCTAGGAGGCGTCTGAGCCAGGAGAGCCACTCTGGTGATTGCG"))
+(assert (= z "gucgccgcaauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2
new file mode 100644
index 000000000..400ad72de
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0294.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGTTGAAGAGGGACATATAGGACCTAGAGCCAGTGCTGACACGGGAATGGTGGAGGTTGGATAATCGAGTCTGTCGTCCGCCAGGATTAGTTGGATGCTTGGTACGTTCATGAAAGCAGGGTCCCGTGCTCTGGACATCATGTGTGGCACCACGGGAGTATTAGATCCGCTCCGGCTTACCGGTGTCCGTGAGGCCACC"))
+(assert (= z "ggcgguccuaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2
new file mode 100644
index 000000000..9b308196b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0295.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGACCGTTGTTTACGAACTGTGGGAGTTTCTCCTTGGGTCGATAGGCTGTTCATACCCGCCCTGATAGAATGGGTTCTAATGTTAACACTCAAGGGAAGGTCACAGCTGAGCCCGAAAAAAATACATATACACATGGCTGGTCCCCCGCGCGAACCATGGTACCCGCGAATTATAAGCCGAGAGTGTTTTGGGGAGTTC"))
+(assert (= z "acccuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2
new file mode 100644
index 000000000..44f652b62
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0296.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTACAGGTTTCATATGGTAGGGTCCGGGAATCCTCCTACGAATGCGCGTTCGGCTTAGTCACACCTGACCACTTTTGTAAGATTAGGCAAGTTTCGTACGGTCGACTTACAGCTAATCGCAGCCAAGTACATGTCTGTCTAGGCGCCCAAATACTGAAGTTTCGGCGACGCAGTAAATATGCATAAACCGACTCAGTATT"))
+(assert (= z "aagccgcugcgucauuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2
new file mode 100644
index 000000000..260f0bf63
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0297.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGGCATGACACGGGAAGACTATGCACCTAGCTGAGCGAAATGTGCCGTCCGTCTAGCCCGACGGGACATGGTGCTGTCCGAGATCCGGTTACGCAAGAAAGTGACGGTCGGAAGTCCGGTCATCGGCGCAGAGTATCCTTCTGGGGGCCTTGTCCATTGACCCCAACCTAAAGCTGTACATATTGGCATCTTTACGCAG"))
+(assert (= z "ugcgu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2
new file mode 100644
index 000000000..18b85e3e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0298.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTTATTCGAGTGAGGACCACAGAGGGGCACGGGGTCTTTAGAAATCGGTGCGGTAAATAAATGGAGATAGCCCGGTTAGTGCCACGACCTCTTTAAGGAAACTACCTGAGTCTCCCATTGTGCAGGGTGCCATGGGTACCGTTCCGCCATCTAACTGTAACTATGGATACCGATAAGTTTGTCGCGGGCGTTCTTGGTA"))
+(assert (= z "ugucuccccgugccccag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2
new file mode 100644
index 000000000..3f6c49f60
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0299.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTAGTACACGAAGCGAAATCTGCCTACTATCCAAACCGCCCAATATTGTGTTCCCAAACCTAGTCTTACGTTGCTATGGTTCATCAAGACTCGAAAGGCGCAGCCCTATAAAGCAATCAAGAGTACACACGTCACCGGCGAACCAGCGTTGCCCCCGGAGTGTGACGCCGGCTGCCCGTCTACTATGATAAGCGGTGCGG"))
+(assert (= z "gugcagug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2
new file mode 100644
index 000000000..51131c964
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0300.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGGAAAACTGTATTCATTAGCTGGCGTCGAGTTGCCGTGCATTGCCTCCACAAACAGTGGAGCTGCTAATAAGACATACATGTGGCAGGGTGATTCATCAGAAGGGTTCATTGTGTTTCTTACCCTGCTGTTCCCGGGCACTCAGAGGCCTGGTACTTACCTGACGTGACCGCGGACCATGGCGAGCCCGCGTGAATAT"))
+(assert (= z "gucuccggaccaugaaugga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2
new file mode 100644
index 000000000..dd7db9079
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0301.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGTTCAGCTAGTTGGGGGTACCACTACTAGTCGAGTAAAGCTCGCGCCACGCGAACTCTACCAGGAGTAGCACCACCAGCTTGACTAAATTCAAAGATACTAAGCACCGGTAACCATTCAGCCATAAATGGCTTTTAATGCCGGCTCCTATGCCATCTCTCTTATGGTCGGCGTGCAAGGAGGATGCACGGCACCAATA"))
+(assert (= z "guuccuccuacgugccgugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2
new file mode 100644
index 000000000..ad7ba9102
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0302.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCTTAATTACCCATCTTAAGCGGTCTGATCAGGATTCTGCCCAGGGGATGGGAACGTCCATGCAAATTAGGTAGTTGGTTCTGCGGGATTTGTATGTCGTGTTCGTTCAAGCCCAATGGGCTTCACACATCACAATCGCAAAAGGTCGTAAGCTTCAGAAATCCTGTTCATCAAATTGAGCGTAGGCTCCAGATAGATG"))
+(assert (= z "cgcccuaaaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2
new file mode 100644
index 000000000..2d90734b9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0303.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTAACTTCCGGTTACGTTAGATGGACGGTTTAAGATAGAGATATTACTCCGTCCTGCTGGACTATCTACGGAGTCGAGGCGCCATGCGGTCCCGTCGCAAGCACCTAATCTCACTCGTATTTCATCATCGTCTGCCACCCAGGTGCATGGCCGAATGTGGAGCGTTCACCGGGACTGTACTTCACTGCGCTACCAATGCC"))
+(assert (= z "ucgcaaguggcccugacaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2
new file mode 100644
index 000000000..2c49ce294
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0304.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTGGAACGACGGGCACATCCCGTGAAATCGACTCAGGCTGAAGTAGTCATGAGCTAGAGTTGTTCACCCCGTTTGTCCCCGTGTACGGGGTTGTTAGCTACGGACGAATATTGGAAAGAACTTTATGCCTCAGTCTAACGTATGCCATTACTGGCCGCAGGGCTGGCACTAGTCATGAACCTGGAGCGGGTTCTCTGCT"))
+(assert (= z "acaaucgaugcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2
new file mode 100644
index 000000000..9eb40dc88
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0305.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGCCTTAATATAGACTGATGCTATTTCAAAATGGCAAATGCCTTAGTTGATATTATAGTGGATTGATGGATCTGTTGCAGGATATTATGATGTTCGATTAATGGGTGGGCTTTCCGCATTTCATGGCGTCCGATTCCTGGAACGGTATAACATAAAGAGGGATACGATAGAGTGGCTGATAAATGAGAATTGAACGGAA"))
+(assert (= z "agacaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2
new file mode 100644
index 000000000..baef85506
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0306.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACGACCGTGGCACATGTGTCTCGGTGAGGCACCGATAGGGTAATTTACATGATCCATGCAGCTACCAGCCATAACGTAACGTGTAACCGAGAGGTCCCATCTCTAACTATCCATGTGGAGTGTTGCTACGCACAATTCGATAGTCTTGCATGGGGCATGTGGAATCATGAGGAATCATTAGGTCACAATGGCCAAAGGGA"))
+(assert (= z "uccaguguuaccg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2
new file mode 100644
index 000000000..33fe42306
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0307.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGCGATACCTTTGCCTGCCCCGTTCTCCTTCTAGCTGTACCCTAGTTTGTTTGCATAGAACAAACGCTGGCCCGGGGAAGTTGGTTCTGTACTAAGTAGTCTTTCACATCGCGTTACTGGGTGAGTCAGCCCCAATGATTCACAGTATAGCAGGGACCTTGCAGGGTACTACGGTTTAGCAAGAATGCAAAAATGATCC"))
+(assert (= z "acguaucuuguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2
new file mode 100644
index 000000000..13d3568f6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0308.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCAAAGACATGATCGGGCTGGTGTCAGTGCCTTGTTAGAGTCTGAAAAACGAGGTGAGTGCAGTCCCAAACTTCATCCCTAGGTACTCCAGTGGTTTTTAATGGCTCGTTGACGAACAACGAGGAGCTGCGAACCGGCTCACGCGGCTTGGGCGGGTAAGGTCGTTAGGGCTGCAACTGTTAGACCCTGTTACGAGCTA"))
+(assert (= z "cuuuuugcuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2
new file mode 100644
index 000000000..f65482aa4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0309.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTATTCCTCTTTACTTTGAGCCCGGCGCTCGCGGTGATCATTCCTAGGACTCATCTCCAGGGCCAGTAAGTGGAAACCGGGATCGACTGTCGTATACTGTGGCTTCCTTCGTCCAATGTGCTCAGTAATACTTATCCCAATCCATTAAAAATGGCAGGGCTCGTCCCATTCTGTATCTTGCCTTTACAGCGTCCGTCTA"))
+(assert (= z "guaaggauccugaguaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2
new file mode 100644
index 000000000..be34abc6d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0310.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAAGGCGTCCAATAATAGTGGATGGAGAGCAACTGTCGCGCCCAAATGTGGGTAGGCATAAAAAGCTACCTTGCATTAAGATTTTATAACAACAATCCAGAAAATGTTGCAGTGTGGGACCCTAACTCCACATGAATTTTTCCATTCCGTAAATACGGGAATGTTAAACAGACTATATGGTTAGTGGCGACAGTCAAGG"))
+(assert (= z "caguucc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2
new file mode 100644
index 000000000..3a2723ed2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0311.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTAGTGGCAATCTGAGAGCCTGTCAGCCAACTCCGAGATTCTAAACGAGAGTGAGGGACAGACTAGGCTTATTTCTCCTCCCGCTTTATGGCCAGTAGGGGCGCACGAAGCCACGATTCGTCTAAGGATTTAAAATTTCCATACACGCTTTCAGAGGCGTTTAGGTAAACATGCTGCTAAAACATGTTCAACGAAATGTT"))
+(assert (= z "uguacgacga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2
new file mode 100644
index 000000000..79b3f25b0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0312.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGGTAAGAAGGAACGGCGTAACAGTGGTGCGTGGAAGAACCTCCTGAATTACAGTGGCGAAGAACATAAGTAGGATTTCGCGCGGACTTTTTTCAAAGACATCATTTGTCATTCCCACTGTGAATCAGCCGATTGGATAACCCTTAGTTTATTATCAGATTCAGAGCATCGGGAGAGAAGGAAGAGTGTGGGAGCCGCG"))
+(assert (= z "aaauaauagucuaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2
new file mode 100644
index 000000000..d56cecd0f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0313.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCCTCCCACCGCCCTCGGACAGCACGGCCCAGACCTCCTCACCGTGGCTCCCCTTTCGTGACTAGCTCTCCCACCATCGGGTCACTAACTCTATGTAGCAAGTTTACGAATTGTACCCCTACACTAGTAGCAGCCACGTTAAGTGACAGAGCGGAAAGATCCCGCTAGCACCTTAAAGTCGTCAATGCGTCCCTGAGCA"))
+(assert (= z "cucgccuuucuaggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2
new file mode 100644
index 000000000..43685ca56
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0314.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGTTTTTTTGGAACAGAGACTGCAATTTACGCTAGATAGGTACTAGATATCGGATGCGAAAATTACAGCCTCTTCGATGCCGCTGAGTGGCGAGGAGGAACTCGCCCCTGTGTGCAAACGTGTCCGTTAACAATGCGTGCAGATGTACCCGCAGCAACTGATGCGTTCTAGCCTCCGACATAGCATACTCGCGGTTCAT"))
+(assert (= z "uugucucug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2
new file mode 100644
index 000000000..8dbfe0061
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0315.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACAAAGGGCTCATTCCGTCACCCAGGTAGGCTCTGGCAACATTCCTCAGCAAAGGCGACAGCTGCCCTCCGTGTCTTCGCCAATGGTAACATTCCTGGGGCGAACGCTGCCGTTACCATCAGTAGACGTACCAACTAGTATTCTAACTCAAAAACCCCGCGTTTTTGGGACCCCTACGCGCATCGAGCTTTTTTACCTT"))
+(assert (= z "gcgguuaccauugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2
new file mode 100644
index 000000000..907b79d3c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0316.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCTGGGTCGGACGCGCTAGGATCGTCGATAGCGAGCACTGTCGCTGCTGAAGAGCTCGCGTGGCCCGACGACCCGCGAATCGTTCACGTGAGTCATCTCACAAATGATACACCAGGTTATGGGATCGCGTAACGAAGGGAAACCTACGACCACCTTTCCCAAAAGTAGAACCGAATCACCCCGCGTGGGTCCGATAATT"))
+(assert (= z "gaaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2
new file mode 100644
index 000000000..522a66ffa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0317.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGGGTGCGCCGATATTCGGTCCAGCTACGGGGACTTAAGTTTCTTGTAAGAGAGGGGACATAATTTCCCTTCCGCTGCGGGCGGCTTATACTGCCAGACCAAAAAGTATCCAATACTGCTTTAAAGGGCTTAAGTATTCTCAGTAGTTTTGCGATCAGACCGACGGTCACACCCAAGCATGGGACGCGACTCCTTACCA"))
+(assert (= z "gcgacgccc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2
new file mode 100644
index 000000000..c57377b18
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0318.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGGGGCCTACAATCCATAATAAATCGCCGTGCTTGACCGAACAAGGTCGGCCGGCAAACAATGGGAGCTATCGCTTTGCCGGCAACTAAAGGAACACCAAGTCCCGACTATAGATATGTCCGTCAAGGTATAGGAATCTGGCACGGCGCTCCAATACCCCCCGTGCTGGAGAACTTAAGGGAAGACTGAGGCAGTGGTG"))
+(assert (= z "auguu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2
new file mode 100644
index 000000000..564764d2f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0319.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTCTCGAGCCACCCAGACGGGGTTTCTCAAGTCGTGAACGCTCATTGCTGCGTGCGTGTAGAAACATTCACCTTGGCACCGGGCTCGCCGGTGGGTCGCAGTACGGCACAAAATTCGGGCCATTAATAGCTATGGGGCGAGGGGACTAAGGAGTCTCCGAAGCGTTTAGCTTTACTCGTATCGACCATAAAGGTTTATC"))
+(assert (= z "ccgcuccccugau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2
new file mode 100644
index 000000000..76779ab54
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0320.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAACGCGGGCCTGGTCGTATGATTTTGACCATGCTTCAGTCGAAGTCCGGAGTCAATCGACCAACGTTCGTGACCTAACACGTTGCGACCCGGCACGTGTACACATTTGAGGTGCAGAGCTGAGGTGAATGCTTGATACCAAATGCGCGTAGATGAGGCCGGTCCTACTAAGGTCCGTGCGCCTGCTGTCCCGAGTAATT"))
+(assert (= z "ccacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2
new file mode 100644
index 000000000..6a63569e6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0321.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTCACGAGTCAGGGTCGTGAAAAAGCCGAGCCGCCCCATAACGGCGTTTATGTACCAACATTTTAGTATCAGGGCCAAGAGACTATCTAAGCGCCCTATTCCCAGACGGCCATGCTGCCCGCACTGCTGCGGTACGTTTTCGTTCCCAATATTGGACTCCACCCTCTTTTCCAGTTTATCTGTGGGTATCCACAGGCCC"))
+(assert (= z "acgggcgugacgac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2
new file mode 100644
index 000000000..8b2bc9c62
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0322.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATTCGACGCATATTCTGATATTCGTTTCCAGTGGCACAATTCTATTAGTAGGAATGCACGTACACCATCAATGGGGTGCTATCCACTCATTAGGATCACATCTGTGTGAGTCTCCGGCGGTTGTAGGTTAGCGCACAATCGATGCCGAGCGTAGTCGACATGGACCAGCAAAACGCGGAGCATCCCAATGAATCAGCCA"))
+(assert (= z "gauaggugaguaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2
new file mode 100644
index 000000000..598c85c2d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0323.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAACAGCAGACTTACAGGATTCGAAGGTGCCATGCCCCTTGCCGGTAAAATTTGGGTTTTCACGTTTGATGCGGGAGCTAAGTAAGCGTTGGAGTGCCTCCGATGTACCCGCTGACCTCCCTCTAGACAAGTGGATCTGACGTCAAGAAAACCAACGACATTCGTTCATGGGGTTCGCAGTCATACAATCGGGCCCTTTC"))
+(assert (= z "gaaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2
new file mode 100644
index 000000000..e75e49399
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0324.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACTAAGCCACATTTTAGATGTGGACAGTCTACTTTTTCCTGACACCTACCTAGATTATATGTTCAGGAATAGTTGTTATCTTCGCATCCCACAGTGTTCTGCACAGTCTATCCGAGCGCGCATCTCGCCGACATGGTGTCTAAGGCAATGACAGTCTAACCACTTCGCTTAAGTCTCACCCTAGCTGCTCTCTCGTGGG"))
+(assert (= z "ucgguguaaaaucua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2
new file mode 100644
index 000000000..cf51f6bf8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0325.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATATGACAATTCGACCGCCAACTCTGGTCTGCGTGTTACCCAGGGCCGGGGTAGGAGCCTGGCTTCTGTGTTTATGAGACGGACATACTCTGTTCCTTCCCTTAACCTCCAAAGTGGGCCCCCCCTAAAAACTTCAGTGCGGTGTCGTCGTCTAAAGGCATGTCCCCTAAGTGAAATGGGAGTGAGATTGATTTGTCAT"))
+(assert (= z "uggcgguugagaccagacgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2
new file mode 100644
index 000000000..15776a790
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0326.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCAGTTCAAGATAGGACAAGCGCCACCATTAATCCTCTGGCCGCAGCATATGGACAGGAAGAAATACCCGTGTAAGAGCGCTGTTCTCGGAATAACTCTAATTAGCAAATAGACCTACGTGCCCTGGTAGAAAACGTGGATGGGGACATTTGCTGTCCCTAAGGGCGAAAGCGTGATTTCCTCCATTGCTATTCAAGGGG"))
+(assert (= z "guauacc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2
new file mode 100644
index 000000000..744feddc5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0327.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTGGGAATTAGTCCGGGGGACAGAAATAGCCAATGCATGAACCAGTCTCCGCAGCCTCAGGCCATAGCTCGTACACGCTAATTCAATCTCCAACATTCCGATGGGCTTGCTGTATGCATTATTGTTGTAAATGAGGATTAGATTGTAGAATTATCAACTTGCAGGAGCAAGTCTCGAAACGAGGCTGAGGAGCACCTCA"))
+(assert (= z "cguggagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2
new file mode 100644
index 000000000..9099f68cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0328.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGTTCGCCCAAGGTTCTTCCACTAATGCAGCTCGTTAGGGAGGACGCCCGGGAGTATCGGGGCTGTGCTACCGGGCATGTTGTTTCTGCGACATGGGATGCAGGTACTATAGGATGATCGACCTAACGGTATCTGCGCCTTCGATGAACGAGCCCCGCCTGATTAATCCACCACCATTTCATCACGATTCCGGAATTACC"))
+(assert (= z "uugcucggggcggacuaauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2
new file mode 100644
index 000000000..bc45e901d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0329.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTGTGGAAAGGCGTTTCTTATCTATATCCCTATATAGGGCCACTGGAGTGAATGCTGGCCCCTACCTCGCAGACTATAGCGTTTCTACAAGTGCCGTCTCAGGTAAAGTCAAGCCAGCCAGAGATCTGTCATTCACCGCAGTGCTGATCTGTTCTTATCGATATATTTTTAGATGCTATGCTCCGTTTTTATTCGGCTT"))
+(assert (= z "aguggcgucacgacuag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2
new file mode 100644
index 000000000..696719ce9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0330.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACACGTGTGTGTACACAGTCCCGTACAGTGAGACGGGATAAATAATAGGAACTACTTACCTTGCGTTCCATTCAAAGTGGCGGCAGAGTGACCACTAGAAGTGCGGAACGCAATATCCCGATGATGGGTCCCCGCGTATGAACAGCGCGTCGAAAATACAGTCAGTCTGTTCCCACCTTTCCCGTTGGAACGCTATGCAA"))
+(assert (= z "ugucac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2
new file mode 100644
index 000000000..151a8f843
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0331.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AACTAAACCAATAGTTGGTTACTGCGTAGGGACTCGGAGCCGCAATTTAAAGCCGACTTTGGACGCCCTGTGTGATCCCGCCGCGCCCTGGTGGCTCAAAATTCGATGCGCGCTGTACCCAATTCCTCGCGGTGACGATCAAAATCAGCTGCTGGATGAGGTTACCTGGTTAGCACACCAGATGAAGGCTTTTCTGTCCC"))
+(assert (= z "ccucggcguuaaauuucg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2
new file mode 100644
index 000000000..13c8634c0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0332.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTAATGCTGCCGCGGTAATACTCCTTTTGTTCGCGCTCATAGGACATTGAGTAGTTAGTCAGAGTAAGCGAACGTTTTATACCTGTATGCGTATTGCTGGGCCCGGAGTATGGGTAGAAGTCTGACCGCGGACGTTCGTGCACAACCTGGTAGCAAACCCGTCCTAAGTAAAGTCGGTCATTTATAACAAACGTACTCGC"))
+(assert (= z "caaaauauggacauac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2
new file mode 100644
index 000000000..5973de9e9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0333.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGCGAGAATTCCTCCTTTCTCATCTTTTATCACTCTCTCGGCGCGGTCGACTTGTGCACCATCACGGCGCGACGAGACGCATAAGATTCGAGGATCCTAGGGACCATGGAATTTGTTTGTATAAGAGTCATGCCTAATCCGATATCAGACTCATTCTGGCGTCCGCACGCAAGAATACGGTTTAGGCTCGTATGTGATA"))
+(assert (= z "uaaacaaaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2
new file mode 100644
index 000000000..907efd976
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0334.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTATATTCGTGCAGTGGGTGAGCCCAAGGAATTACACGACTCTGGGCCTGCCCTTTATTGAGACAGTTTACTGAATATGGTCATATAAAACTTGTGGTTTACGTTCAGAAGTGCTTCAGGTATCTAGGTGGCAGTCAATGGCGCCAGAGGGCACGGACAGCTGGTATTGTCGCGAAGTCTCTGGTTCCCATCGTATTTC"))
+(assert (= z "accaguauauuuugaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2
new file mode 100644
index 000000000..cdd369f8e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0335.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAGGTCCAGTGACGAAGCGACTAATGATCCCCCTGCTTCCAGCGATTGTAAATAACACCATGGGCGATAACCCGCTATGATGATGAGACTATGACCCCTATACTGCGGGGGGAAGTCAAGCAGTCGCTGAGTGTTAGCCTGCGATTGAATAATATGCGGCCACGGCACTAACCCCGCCCCCCGGTTATAATCGCTCGTCA"))
+(assert (= z "uugggcgauacuacuacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2
new file mode 100644
index 000000000..e85b09f10
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0336.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTTGCAGTCAACTAGAACGCCCTTGTTAACCTCCACCGTTTCTTCTGCAGATCGTATGTGGTGTTTCGTTTCACGTAGAGTCTATAGTGCCAGATGGTGATGCACCCTTCCAACCGGCGGTAGTACGTAAGGTAATTCTGAGGACGAGTTTCTTGGTCTTAATAGGGCATGTTCTCGCTCCCAGACCATTCTTAAAAAT"))
+(assert (= z "uggag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2
new file mode 100644
index 000000000..cecdf97a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0337.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACCTAAGCAACTCTTCGAGCGTGGGTTCATAGGCATGTACGCAGTCTGCCCTAGCATCCTCTTGACATTTGGGGCATCGCCTGCTTACGATGGTAGGTCCATTTGAACAGCTACGAAGGGCTTGCCTTTATCTGGCATTGATCGCGACCCCACAGCTACTGTATCGTCCCAGGCTACACTAGTTACGACAAGGTATCAC"))
+(assert (= z "gagaagcucgcacc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2
new file mode 100644
index 000000000..b22c36e6c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0338.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGATAGGGGAATCATACGTTATACACACGCAGGCTCGCGAGTACGGCGACGAGGCATATGTAACTACGATCATCATAATGCCATCGTTGAACAAATTACAGAATTGGTCATGAACCACAGTCGGGCGCCCAATAGGGAGGTAGATGCTCGTGCTCCGCACGCGTACCCATCGGACTACCTGTTGGGTCGTGACCTGTGAC"))
+(assert (= z "aguaugcaauaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2
new file mode 100644
index 000000000..931cd4f2b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0339.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGATGTATCACACAGCTCGTCAAACATGGGGCATCGAGCAGAATCAGGCTAACCTTCCTCTGGATCCTTCACAGCAGGTTGATCTAGGAAGCTATGACTCTTTGGTGTTTAACTCGATCGGGAAATCGTACGGAACAGTTCACAAAAGGTAAAATTCGTCGTTACGTAGGTCGAATGTTGCGATTGAGGGTTGTTTGAT"))
+(assert (= z "cgcuaacucccaacaaac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2
new file mode 100644
index 000000000..88cfa6954
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0340.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGGTTTAGTTCGCTTATATTCGCGATAGTCCGGTAGTTCGACGACATCCAGTTGTGGCTGAGTTGATACTAGTGCCAACGAAGTGTTAAGTCAACTGGCGAATAGAATGGCTCGGGTAATTGAGAGCCATTTACCACTCCTGGAACACTCGGTTCCGGGAGGACATGCTCCCCGTCACATAAAGTGCCTACCAGGGGTA"))
+(assert (= z "uccuguacgaggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2
new file mode 100644
index 000000000..b428a79ec
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0341.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGCTGAACGAATAATACGCGCAGGTAAGTACTCACCTAAAGGTTATGATCATAATTGGACGAGTAAAACCGTCACTAGATCTGGTGGACACCCCCAGTAGTTCGTAATGCGATAGCCAAGTATTCGACATTATTTTTCCTTTTGATACTCATTCGTTCGACATGGAATACTCTCCTAAAAGCGGCCTGAAGTCCTCGAC"))
+(assert (= z "caucaagcauuacgcuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2
new file mode 100644
index 000000000..60df2d969
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0342.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTACGAAACAATAACTCAAATCTAGGAGATTACGGAACCCAGACTAACTTATAACACTATGCCTAAGCAGGACCCGGGTGTTATCCTGGCGGTCATAACCTAAGCCGGGGGGTAACGTAGGTACTCCTACAACTCGATAAATCAACCTGGATAGCGTCTAAACCGGAATCGTCGGAAGGTATATACCTAATCCAATAGC"))
+(assert (= z "ccaguauugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2
new file mode 100644
index 000000000..17b34a00e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0343.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTCGTTAACAGGCCGGACCGAGTACGGATTACCACGGTATAATCTCTCTGGTCCACCCCTCGCATCGGAATGGCAGAGCTGAGCGGTCTTTGCCTTGCGGGGTTTCCAGGACCATTAACAGAGCAGGTCAATGTTCCTTGCGCCATCACGCGACGATATACCCTTTTAGGGTAATTTTGTTGTTCAGGACTTAGAATAT"))
+(assert (= z "ucaugccuaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2
new file mode 100644
index 000000000..02b3cd36b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0344.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGGAGCTAGACTACTCTATAACACCAGTGCAGTCCTTTAATCCGTTTGCCTCACTATACTGGGCCGAACAGGGTCCTTTACATACACAGGATCCATCTTGGTCCTCAGCAGTCACAGGTTTCATTCCAACCACGCTAGAAGAATGACACAAACCTTTGTGCAAGAGCGTGTGAGCGATGCGGTCGGTTGACTGTAACCA"))
+(assert (= z "ucagug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2
new file mode 100644
index 000000000..8301343aa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0345.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTCATCAGTGGATTAGTTCAAGCACCCGTAGCTCAACGTTGTGTATTTAGTAGGGATAGACTTACTAGTCATATCTAACTTCCGTGGTCTCCCCAATGGGTTAAGATTCGAGGCCGGATTGCCTTTGAGGCACCAAAGATCGCGCTCTTCACCGTCAAGCTCTGTACTTCATATCCCAAACCAAATTGAAGAAGGGCCT"))
+(assert (= z "cgcgagaaguggcaguucga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2
new file mode 100644
index 000000000..29fdbd7cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0346.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGACGTCAACACTTGATCGTGCAGCCAGCCTGTCGGAAGCAACGTGATCAAGGTGCTTTTGGATTTGTGAAAGGCAGCGCTCACTGTGTATTTTTGAGGCCGGAGAATTACAGCAAAATGTAGAATGATGCTCGTCGAACTTTATTCAAGTCACATCTCCAGCTTTTGATTGCACAATGGTTACAACCGTGCCAACTGTA"))
+(assert (= z "accaauguuggc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2
new file mode 100644
index 000000000..4bb9302a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0347.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCCTGGGCGTGGCGGGATAGCGTACGCGCTGGGGGCCCCTACAGCCCCTTCGTGTTGGACTCCCGCCTGCATTACCGCAAGTGGCCCAAACCGCAAGTTTGGGACGAGACATAGGGTGAACGACCCTTCGAACTACAGCTGCACGCCTTACTATTCAGTGGCACGTATTTAGCACATTAGCGTTTTTCGCGCATTCGTT"))
+(assert (= z "guguaauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2
new file mode 100644
index 000000000..ae8d40ab8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0348.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTGCCCTTAAACCTGACACGCTTTCAATGGAGTCAGAAAGTCTCACTGGATTGCCACTGATCTCATTCCTCCAACCTACCAGTAACTGAAAGGCAGGCTGGCCCCGGTTGAGTGTTGAGATTATCAGATTACTAAGCCTGCGTCATTTATGGGTAGTTAGGTTATGGGGTGGGAGGCTGCGTCTAACTGTATGGCTAGC"))
+(assert (= z "gugacuagagua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2
new file mode 100644
index 000000000..e314c042a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0349.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTACGCAAGTAAATCGCTCTACACATGTGATAAGGTCGACATGGAACGCCCACTTATTGCACACGCCATCCCCCCAACTGGCATAACAGTTTCGTCTGTAATGATCATAGGTGCGTTCTCATCGCAATTGGGCTGATTTTTCGGGGTTACTCCAACTGTAACACAAAGGAAGCGTAATCCTCCATCGCCGAGACCCGAG"))
+(assert (= z "gcaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2
new file mode 100644
index 000000000..f08a77f00
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0350.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCGGTTGACAAATCGACGTAGAGGGTTGGCGCTAGGGTCCCACTGAGCGAGGCATGTTTGTCCACGACGGATTGCAATCACTGTTAGGCACTCCGTCGTCACGATTGCGTGCACAGAAGTCAACTGCTGATCACGGTTGATACAAGGATAATATACCGGGCGAATGAAGTGGGTCGTACTTTCAAGCTTCCGCGACGTAC"))
+(assert (= z "uccuauuauaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2
new file mode 100644
index 000000000..857ff61e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0351.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCTAGGTAGAAGGTATCCAGGTTACCTGACGGGGTGTCCAAGGAGCTTACTGTCGTGCCATCGCATGCCAGTGTTGCCATGCTCTTCTAACGGACATATCACGAGAGAGACCAATGGACGATCCAGTTAGTGTTTCGTACTGGGTCGGGCTCGGAGGACTCGCCTACGCATAGTGTAGAAACCGTTAGGACATTTGGAGG"))
+(assert (= z "aaagcaugacccagcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2
new file mode 100644
index 000000000..750f40fd7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0352.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCATCGCTCGTGGTAATGTGCAATGATTGTTGCAGAATCTAGGGTAATCTCCAATTAGCGTTCTCCCCGCAATTCGAACTAACTTTGCATTAGCGGTCCGTTCTATAGGGTGAATAGGCTTACCCCTTAGTTTGTTATGGTGTGAATACCGTCTTCGCCTGACACGTGGTTCCCGGCGCTAATCGTGCGTACTCCCCTAA"))
+(assert (= z "ucccauuagagguuaauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2
new file mode 100644
index 000000000..2655ea440
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0353.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTAAGGAGGTAGGCTCAGGAGGGTGCGTGCTGTTTCCCTCGGGGGTAAGAGGACCTATGGCAGTATCCGTGCTTAGTGATTCTCCGGACAGAGCCTATTGGGAAGTCTACTATACGTGAACCTTTATATCTCCGCGTGCCATGCCCGATTAGGGACCTCAAGCTTGGATTGATGCTGCGTCAAACGATCTGACGTTCGG"))
+(assert (= z "gucauaggcacgaaucacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2
new file mode 100644
index 000000000..d9184a72d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0354.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCAATTTCAAGGGATTCACGAATACGGATTCGACAAAAATGCATGACCTGACACCCGATCATCCAAGACGTGAGTATCCAACGGTACGGAGGTCGGGACCGGGCATTCCCCCCCAGACGGCCTGTAACGGGGTTGTGTACTACTACCTAGCGCTGAGTCCGCGCACTTAGTATGACTTCTTAGGCGCCGGACGCTATGG"))
+(assert (= z "cccguaagggggggucug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2
new file mode 100644
index 000000000..30d8e3760
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0355.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGTGATCGGCTGGGACTTTTACGAGTATGACATAACGTTCCACTGGCGCCCCGTGTTAGCTAGACCTTCGTTAACGGATCGTACTCAGTAGTAATAGGTGTCTCTAGGGCGATTATGTTACGAATTAGTCAGGATAGGGGGTGTGACTTATCTCTTGAAGGTGGCGGCCCATGGTGGAGACGTCCTATCACTGGCACTA"))
+(assert (= z "guaccacc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2
new file mode 100644
index 000000000..e3c131881
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0356.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTCGCGCTCTCGGTGTTGGCTTTAAATTCTTTCGGCTAAGCGGGAGTCGGGCTTCGGTAAAGAATAGCGGTATGTCGCCGTTCCCATCAGCTTGGAATAGCCGGCGGAATTCGAGCTCCGTCCCGGTACACGCTTCGGCCGATCAGCGACATGGAGTCGGATTACTTTGACAAGTTGTTACGCTTTTTGGAGATCCCTG"))
+(assert (= z "caugugcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2
new file mode 100644
index 000000000..7ab4673a6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0357.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACAGCTTCCTTGGGCGAGCAAGAGGACACTCTACACCTCCGATTTTTACTAGGGTTACTGGTGCCAGGGCAGCATGATCCCCCTGTTGCAAGTAATTCTTAAGTGTAACAGAGGGCGACCTCGTCTAGGTCCTAGCGCATGACAGGGTACGGGACGATCCAGCTAGTTTGAGACCGGTAATCTTATATCTGCGACAGCA"))
+(assert (= z "caaacucuggccauuaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2
new file mode 100644
index 000000000..4cb92b262
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0358.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCAGAGCAATATTGTCACGGCAGGCTCCCTTCGCTTGTGTATTTAACGAACGATGCTGGTACGGTTTTGACGCGGTATACAAAAACTGGGCCAGACAGCCTCTTCATCAAAGGTAACATTTAGGTGATAAAAACTGCGCAGTCACTATCAGTTCTCGCAGATTCGTCTAGATAGCGCGGACTTTCTTGAAGCGACACTGA"))
+(assert (= z "gccuga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2
new file mode 100644
index 000000000..5d2996bd6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0359.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGAGCTCCGCAAGAGTGGTCGGTGGGCCGTATTTCTGTCTATACTTACTAGCCCCGGGAGCAACCACGATCTCCACCGGATCCCGCCACCATGGAACTTCTGGAAGGGAGCTCGACGCGAGTCGCCCCCTGGGAAGGTGAAAGCGTCCCCTGGTTACTCGCCAAGTCGCCTCTTGTATGATTTCCTTGAGTGCTCACGCT"))
+(assert (= z "gugcga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2
new file mode 100644
index 000000000..cf699ec9f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0360.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTGCGCTCTCGAAGGATAAATCATCCCTAGCGGATTATTTTGCATATGATTGAGGCGCGAAAATCCGTCAAGTCAAATCCGATATAGACAAGATAGAGGGAAACGAACTTTGGTTTAACCGTTGAGGCTCATGTGATCTCCGACTGTACGGGGAGATACAAGAACAGATAGTTTTGGGAACGTCTACTGTGGACAGGCC"))
+(assert (= z "gaggcugacaugccccuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2
new file mode 100644
index 000000000..96917ac9b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0361.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTTCCTGGGCCGGTGGAGTGTCGGCACAAGATCGATCAATGCACCCTCGTCAAAATCACAATTCCATGTATTTGCCGGCCAATTTCCATCTGCATTTCTTCGGCCCCTGGACGTATGAAGGGTCACCCTCTATTCTGAACTCACGGACTCGTCGCATTTGCCTGTCCAGCGGGGGGTCCGCGGCTGCACGTTGTGTCTC"))
+(assert (= z "agacguaaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2
new file mode 100644
index 000000000..ab7461469
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0362.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGCCCTGGGCTGTTTCCGGGCAAGACGGTGACGATTAATTTAACGAAGTGCATTCGACCAGACTCACGCCTTGTTTATATTTGTGTGATAGGTGCTCTGGCTTAAGAGTCAGAGATTTGTGCTAACTGACGGCGTGTTGCACTTGTTCGTAGGGTCAGGAATAAACTTGCTACCTCGATGTCCCACGAGTACAAACAAC"))
+(assert (= z "gcccguucugccacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2
new file mode 100644
index 000000000..b6a16b851
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0363.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAATACGTGACAATTAGTACAGTTCCGATAGGGCTACGCTCTTCTGTTGTCAATCTAAGGATGATTTTGGTATGGGTTGTCTCACCACGGACCCTATTGATGTTGCATTAATTTTTCCTATTCAGTTGTTAGGCTAATTCAACCAGAAGTGGGCAGGCCAACACGACGCTTCTGCCGACGGCAAGTAAACCAAACTGGTG"))
+(assert (= z "uugaccac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2
new file mode 100644
index 000000000..9bd36e103
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0364.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATGATCTGTGCACCATAGCATTGACCATCGGATCCCCCGGCACGAATCGACGTGACGGCAAAAGATTATAAGCAAGCATTCTTCACATCATAGTCGGGTATGCGAGCATTGATAGTAATGACTCGTTATGTCCTTTAGTCCTCCGTATGTCTGTAACGATTGTTTTGCTCTCGTCGACCCTTATTTTTAACCAATAGCG"))
+(assert (= z "cuaucauuacugagca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2
new file mode 100644
index 000000000..1cbecf9d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0365.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTACTTAAGTTGCGGCATGCAGAAGTTTTAAGCGTGATGTACAGTGCCGACATTAAGTTGTCCCAAACTCTCTCGGCAACGTCCGCCAGACCCTGTGGCTGCGCACTCAAATCCGACTGCCCGCTCAACTGGTCCTAACAGGTGTAACCGTTTTGCTCTCTGCTACTGTATAGTCCGGTTACGCTATACTCACGATATG"))
+(assert (= z "acggcuguaauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2
new file mode 100644
index 000000000..f6e231b84
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0366.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTACCCTCTGGCGCCAGCCTGCTCACTGACTAGGCATTCATTAAGTAAACCCGCGATTGGCCTTGCGGACGAGCAAGCTTAGGTTCTCGTCCCTTAGTTTTATAGTATCAGATGTAACCGTCCTGACCATCTCCGGACTGCGTATATCAACCTTTAAAGTATGGTTCGCACAGGGCCTTTACGGGGTCGTGGTAATCAC"))
+(assert (= z "augccccagcaccauua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2
new file mode 100644
index 000000000..e1eec2fce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0367.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTTCCAGCAGTCGGACGACCGAAGATAGCGCGCCCCTCAGAAGACCCCTGGTACCCACTCCACCGGCCTAGTCGCACGAAGTCTCGTGCACTTTTCGGTGGGTAGTTGGTGACCACCAATGCGTACTCTACTTTGTAGGCAATTACAATATTTAGGTGGGCTATATTTTGCAACTCAATAGAAATCTGGATCGTACTTC"))
+(assert (= z "acguug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2
new file mode 100644
index 000000000..08afb0fcb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0368.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTATATCGGTACGCTGGAATCCCTCGGAGGAGTATGTACGCGTAAGACCGCTGGTTAAATGAAAAAGTGCACGGTTGTTTCGCTTGCTCAACACAGAGTAAAGTTAGCTCTTGCCTATGCAGACAGTTGTAGGCCTGGCTGGCTAGGCTGGCTCCCATCGCCGACGCGTGCAATTTGGCGTGGTTAGTGCCCGGCCCCTG"))
+(assert (= z "cgaguug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2
new file mode 100644
index 000000000..259ac6df7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0369.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTTACTCCCGCGATTCACAGACAACCCTCCAGGGGGGACCTTATAGATTGGGAGCCGTCGAAAGGAGAGGTACTTCGCACGTTCTCGCGAGGTTGTACTGAACATAAAGCTGCGTCCTGTCAGCGGTTAAATTGGTTTGACCTCCTGCCTAGGTTTTGAACGTAGTGTCTCCCACTCGGAATGTTGCTCGCAGCCGATC"))
+(assert (= z "caucacagagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2
new file mode 100644
index 000000000..40ca4cc0e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0370.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAATGAGTGGCTCGGGCAGAATACCGTGTATGACCACTGAAGAACTAGTCTCAGAGCCAACGCGAAGTTCGAATTGTAGTCACACGATGCGAGGATGGTCGGGCCGGGAGCCTTACCGCATGATCCGGCAGTAATTACTTGAAGTATATTCTTATGGTACATCTGTTCGCTATCGGAACAGTCAGGCCAAGTTTACCGGC"))
+(assert (= z "auagcc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2
new file mode 100644
index 000000000..a035e3837
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0371.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGACCGGGCACACAGGAAGTCTCGCTGATTAATTCGGAACTCGTTAGTAATAAAATGCTAGAAGCTGTTCCGTTACCTTCGAATTAAGCCACCGCACTACCAAAGAAGTTTGTCTTATCAGCTGCGCCAGAAATAAGTCGCCGTTATGACCTGGACATAGAGTGCGTCAGTAGGGTCCCAGGGGCGGCGCTGGCTTGCGC"))
+(assert (= z "guuucuucaaacag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2
new file mode 100644
index 000000000..b6225aa76
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0372.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTTCGGACTGTATCTCGCTTTGGGTAGGCATAGTAGACGCGAGCGGGGGTAGACCACCAGCCTACATCCGGAGGAGCCAAGTGGGAAGGTTGAGCTGCACCGCACACTAATGATTCCTGCCCCCTTGGTCGGAGTATATCACTCGATCGAACGGATTATCTTACTGAAGTTAGCCCACCACTTCGGATTCGGAGCCTGTC"))
+(assert (= z "uggcgugugauuac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2
new file mode 100644
index 000000000..a5df420c0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0373.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAGTCAAATTCGGCCCGCCGCTAACGACTCGATGAAGGCCAGCGTCGTCGGGCCGTAGTTGTGTCCAGCCCAGGAACCATCAATATATACGTAGACGCGTGTTGCCGATCCGGAAAGGGGCCACGTCCGCAAACTTATCCGTCGGGTACTTAGCTCGCAACATCATACTACAGGTTGGTTGTAACACACACTTCTGACG"))
+(assert (= z "uuccccg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2
new file mode 100644
index 000000000..636ab0e39
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0374.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGGATACGCGTATTAGTGTGACCTTTGGGAAGACCTCCTTCACCGCACCCGCTGTACGCACTGGGCGATTGCCATCGTCTTCTCGTCGAGAATGGGAAATGATGGACTGGTGGAGTGATTTATGCTACCAAGCTTGACCCGTTGCAGCAGTCATATTCATTACCTGCCCCTCTGAAGACCAGATCGATCCCGGTAGTCA"))
+(assert (= z "cgguag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2
new file mode 100644
index 000000000..b7777a7d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0375.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGCAGAACCTCCTGGTTTTCCGTACGATCACACTACAATGCATCATAGAACACCCAGTCTTGAGCGGATGAAAATCAACCGCGCGCCTAGCCTCGCGCAGTCGGCGCGAAAGTCGCAACAGGTAGAAAGTCGAGACTGCATATGGACGAGAGCCGACCGAAAATCGTGCCACCAGCTGGGATAGTGGAGATCACCAGGT"))
+(assert (= z "ugacguau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2
new file mode 100644
index 000000000..9ee5031f4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0376.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAATCGGTTTCACCTTCTAGCAGCGATGATGTAAGGTGCACTGCGGCCCGTTAGATACGCGCGAGAGACGGTAGAACGGCCCCAGGGGAATACAGGGATTTGGGGGAATCTCCTCCAAGGCACGCTACAAGTTTCGCACCCGGTCGATAAGGCCCCTCGGGGAAGGTCTCTCGCTACATAGCCCGTGAGGTATTATATC"))
+(assert (= z "gcacu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2
new file mode 100644
index 000000000..3d7b5bf0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0377.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTCGAAAGGACGGATGGGGAATCTGTTTAGCTGGAATCTGATGTAGCAGGCGCACGGACCTCGGAAAAGTGTAAATCAATGAGCAGTTTTTGCTTCATTTACAAGTTCGTGACAAACACGTCCTACTCTAAAAGACCTATTATCATCACTCACACAAATCCCATATTGATACAGGGCTAACTGCCCCTCTGTCGGATAA"))
+(assert (= z "guuugugcagga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2
new file mode 100644
index 000000000..0e6a84b55
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0378.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGGGACACAATACCTGCTAATTACCGCATGGCACTAACCTTCCTAACTTACAGGTGGCAAATAAACTCATAACCTGAGAAGGGTACAGTCAGAGAATATAGGGGCACACCGACAAATATTTCATTCACACGTCCCGGTATCCAAACCCCGGATCATTCTGGTCCCTCGGGCAGTTTCACCGAGTGATGAAGAGCAGAGC"))
+(assert (= z "ggaagga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2
new file mode 100644
index 000000000..c952b7996
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0379.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATAGCCTAACTTGATCCGCAGCCACTGACCCATGAGTTAAGGAGGCAAAAATACAGGGCAGCACTCGTGCTAATGAACTCCGAATCATCCCCTCGATACTATGGAGAGGCGTTTTAATTTTTAATGTTGAGTAACAGGCCACGTCCGTGGGTAGATGTCAGATCATAATCTGGTGTTTCACGTGAAGATTGGTCTCTAC"))
+(assert (= z "gauugaacuag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2
new file mode 100644
index 000000000..6a8ca2fa1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0380.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTGGATTAGATCGGGATGAGCATAAGAATGGAGTCGCGTTCTAGGTGATACATCAGGGACCACTTGTTTTAGAACGTGCAATCTCAAACACGCGTGGGCATAATCCACACGCGCGTAAAGGAGCAATGTGCTCGATTTGGAGCAGTTTGGGGAGGAGAGCGCGTTGGGTGGCAATCGACTACCATTGTCTGGCATTTTTT"))
+(assert (= z "ccuaaucuagcccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2
new file mode 100644
index 000000000..05374a120
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0381.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGGGACCGAGCTGAGGTTACTGGCTTGATTAGGGCGATGCCGGTCATGGCCGCATACCAACGTGTTAGATGTAAACAGACTCGCGGGTGTCCGCGTAAACTCTTATCTACCATACGTCACGGCGAGGGCCATTGCCAGGTACTGCTAGTGTAAGAAATTTCTTACCGCCTGGCTCCTCCAAGGCCCGGCGCGAGCTCGCG"))
+(assert (= z "gcucga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2
new file mode 100644
index 000000000..e57559cbe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0382.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAACCGTCATACACCGGCATTGTGGATGACTATACAAAGAGGGCCGCGCGGTTGTATGTCAAGTTTCCCCAATGGCTCACCCAATAAAGGCTAACCTCGGATATTATCATTGAACTATAAACGGGCTGACTATGAATTATTTCCTGCAGAGGCGTGGAAAGGTGATCTGCACGGACTATGAGGTATTCACTGAGAGGTCC"))
+(assert (= z "gauauuugcccga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2
new file mode 100644
index 000000000..6cf7b4340
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0383.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGCTTCCCCGAAGTTCGATCAAACCAGCCCGGCGAAATCCTACCCTTCTTTATTATCCTTAGCAACCAGCCTATAGGTTGAATCTAAGGTTGTGTTCGGCATCAGTAACAAGTTGAGAACATCAGCATCGTCGTCTTATATCATTCGAGCAGGCTCGGCTAAACCTCATTGGGCAAATGGGGCCGCTTCCAGCAACTGGT"))
+(assert (= z "aguaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2
new file mode 100644
index 000000000..c780d75c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0384.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTTTCATACTAAGCAGACTGGATACCTGCCATCACTTCTGAGGCCACAGTGGCCCCCTGGAAATGCCAGAAAGTACGCTCCGGAAGGTCATTGGAAGCGACAGATTTCATACCCAGACACAGCTATACAAGGGAGAGGTCGTGAGCTCTGAGGCTTTGAGAGTCTGACTTCCCCAAAGTTGTACCTTGGTTGAAGGACT"))
+(assert (= z "aguauggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2
new file mode 100644
index 000000000..d1b790201
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0385.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTAACCCTACAAATGGATGAGGTTAAGGACACACGGAATGTGCGATACACCATGGTCAGCCCGGATATTCGGGGGACACAAGGTGTTTGCTGGGGGGTCTGGATAGCTCGTTGCTCACGACTGTTCAGCGCATCCATCAGGTTCTGCTTCTACATCCAAATACGCGCAAGAGCCTGCTTAATTACAAGACGTTGCCTTTC"))
+(assert (= z "guucugcaacggaaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2
new file mode 100644
index 000000000..cb4c38f86
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0386.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTGCTCAAACGCCTATTAATGTGCTAAGGACCCGGTTTTCGACCAAAGGCGACACGCCTAATGGCCCTCCTCGGTCCGAAATCGCACTATTCCACTGCGGCAGGAAGACGAGGCGATTAATCGAGTAGTCTGTCTTATTGGCCTATGGTACAGCGGAAAGAGGTATAATGAGGGTAGAGGAGACCTCACTGCGGCAACG"))
+(assert (= z "cgccguugc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2
new file mode 100644
index 000000000..9d1c628df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0387.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTGTACCAAGTCCCGGGGGTTTTCAATGAAGGAGAAGCGGATTCTCAGGTCTCGAAGGAGTGGATAGTACCCACCAACCCGCACCGCTTGTGCTTTATTTAAACAACATCGGATCTGTCGAAGCTTAAATCTATGCGTGAATTCGATAGGATTGCAGCATCCCGTGATAAAGGGTCACTTATCAGTAGCCGAGTTCGTG"))
+(assert (= z "cagggccccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2
new file mode 100644
index 000000000..f8e83ee4f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0388.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCCCTAACAGAGAAACCCGTTCAGCACCAACGACGTCCTGCGTAGTTAGAAGTGAATACAAAGCGAATATATCATAGCTCTTAACTTATATTTACGTTGCATGGATGATTCTCAGTACGACTTGCTCTCAGATTGAGTCCACAAGTAACCCCTACCTTGGGGGGTGCATGGCGGTGAAGATGGACGGGTAGTGCATACAG"))
+(assert (= z "ugcugaacgagagucua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2
new file mode 100644
index 000000000..44f3fcad9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0389.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGCGGGATAAAAAAGCGGTTTCCGTTTCCACCTGGGGGCATATATTGCATCGGATCTGAAAAAGCCCGGCGTCCTTTTGGTAATGGACAACTATGTCCCCAGGCTACAACCATAGAGGCGTTGGTCACTGTCCTTAGGTGCGAGCCCCACCCGGAAACCTTCCACGGCTCTTATTACTCCCGCAGAGGGCGTTTTGGGA"))
+(assert (= z "ugauacagggguccgaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2
new file mode 100644
index 000000000..acd10c7f3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0390.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGAGTAATAGCCGCACTTTTCCAGTGGCAGGAGGGAATGCGTATTTGATGGGACAGTGAAGAGGGATGCTGGTAGACGGTCGAAATGATTGCGGGATGGGACGGCTGCGTATTTCGACTGTCTTTAGTCGATGATTGGCGGAACGACGACAACACCGTTGCGATAACGTAGAATGTCCAGGTAGTCAAAGGAGGCAAGG"))
+(assert (= z "aacuacccugucacuucucc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2
new file mode 100644
index 000000000..162509a1b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0391.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CACGGGTCCGACCTTTGCTTGTGGGCGGGTAGAGTAGTTTGTGGCATCACTACAGACAGATTCTGACAAACGGGGAGCTTGAGTCTCACATGTATATCGTAAGTTCAAAAATCTGCGCGCGAGGTAAGAAAGCACGTATGCGATGCTAATAAAGCTCGTAGCAACTCGGAGGCCGACCAATAAAATCCGCGTTGACCCAT"))
+(assert (= z "aaguuuuuagac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2
new file mode 100644
index 000000000..75becfecb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0392.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAATTCAAGGACCCAGGCGTCGCACGCTCCAACTCGAATCATTATGGTTTATCGATTTAAGCACCAGCTTGGAATAGGAGGGAATCCATCAGAACCTAGGCTTTTTCGAGTTTTACAAGCGGGCCCTAAGTCGTGGTGCTGGCTTCGATGTGGTAAGATAACTCACCGAAGCCGTTGGCCTAGGTATACTTTCATCGGTA"))
+(assert (= z "uagcuaaauucguggucgaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2
new file mode 100644
index 000000000..3f08c66a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0393.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGTGCCCCTTTAACGACGAGTGAAGGACGCAGACACTCCACCCTTAGGGTCCTGTAAGCAACTTAGCCAGACCTCACCTGTTTATAGCCATTTGTTATTTTAGCAGTAGGGCCGGGCTCCGGGAGATTAGTCACGCACTGAATCAAACACTTCGCCTACTTAAATAATCCCCTAGAGCAATATCAGTGCGCTCGTTACT"))
+(assert (= z "aggccc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2
new file mode 100644
index 000000000..1017ab117
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0394.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTACTTCCCAAGAGGGGCCCCTTGAGATAGATGGCCAGGAATATTATGCACTGCCGTCGATATTGCCCTAGTTCCGTTCTTCCCCGACACTGGCCCCACTTCACTCATGAACTATATCTGATTGGGCACTAGGGAGATCTCGTGATTCTCCGAATAGAATCACCTAATCCATTGATCATGATTAAAGCATTACCAGTGTT"))
+(assert (= z "gucac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2
new file mode 100644
index 000000000..ea9b7c678
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0395.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CATCTCCAGAGACGGGCAGCGAGCCATCTGACATTATGCTAGTCAGGGGGCAGGACTATCTTAGGGGTTAAGCCGCTCGACGGCTCTTTAGTCAGATACGGCGAGTGGTAGGTATGGATTACCGGCCCTGGTCGTATACACCGCCTTTAGCCACCGGTACTTCCGATTCGCGCAACATGGTATGTGATTTTACACGGCCC"))
+(assert (= z "guuguaccauacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2
new file mode 100644
index 000000000..14e5790c3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0396.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTCACCAGGTCCGCAACGTTGGCTAAAGTCATATGAGTGCGCGTCATGCCTCTTCACGCGATCTCCACAACGAGAGGGCTGTTTAGCGAGATATCACGAATGCTGTTGAGCTATCGGCCGAGTAAAGCGGAGGCAGCTTTCAATTAGCGAGCTTTTGCCGAACTGGGCATGCCTGAAGTGAAAAAGTAGCAGGGCCCGC"))
+(assert (= z "aacucga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2
new file mode 100644
index 000000000..4db0c3f80
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0397.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCCGCTCCTGTAAGTAAGCTCTAGGAATTACACTTCTTTGGACACCATGTGGGTGTGCCCCAGGGCAGGGATGCCTCCGTGGCTGAATCGGTCGGCGTGTTTTCAGATTCACCATAACGGCCGTTTTACTGGTTCCCCATGACGATGAGAGTAATCCAGCTTGCGAGTTACTAATCTAAGTTACGGAGTCGTGATTGAA"))
+(assert (= z "guauugccggca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2
new file mode 100644
index 000000000..0b6694b83
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0398.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATAGCAACAGGCGAGAACGATGTCGTTACCCGATTCAGGAAACGCAGGACATTCAGTTGCCCCCCCCCGGATGTAGTATATGGCCTTCCCCCGTCTGAAGCTCAAGTAGGCCAAGCGCCCCCATAGAACGCCTGGTCCGCTCTCGCGTTTCTTGTGTCGTATAGGTAGCGAGACGACGAGCGCACTTTCCGTACCCAAGT"))
+(assert (= z "aucguuguccgcucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2
new file mode 100644
index 000000000..ef63b58a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0399.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCTGTGCAGAGGCACCATGTGCTAGCCACGGTTCTTAGCGTATGTCCCTTGCCTCATACGATTCCTCATGCATTGTACGCATACGGAGGGAACGTATCCTCCCCCAGAGTGGCGCGTCGGCCAGGTTTAACCATGATCGACCCTTTTTTCGTTGTAACCGTGCTAATTCGCCTTGCAGCGTATCAAACCTTGAAACCGA"))
+(assert (= z "auuaagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2
new file mode 100644
index 000000000..19bbe4fd7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0400.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGTGTCACGAATATCTGCGCGAACTTGCAACGCGATCACACCTCACTGTCTACCCCGTCAATTAGATGGAAGAGTATGCGATGGGATAGATTATGAAGCCCGTACGCTATAGAACTGGGGGCAAGAAGAAGATCTGCCCTCGACATTTCAAAGTTCCAATGCATTTTCAATCTGCCTAGCATTGGTATGGATGGTTATC"))
+(assert (= z "ucgggcaugcgaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2
new file mode 100644
index 000000000..b3bc6c646
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0401.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACTACGAAATCGGTAGCAGCCGATGAATCCGCTATTCATGGCGTATCCTTGATTTGCAGCTCTCAGAAGAACTTGACATTTGCGCTGAGTCCCACAACGGCGCCGCGTATCCAATGGTCGTTTCTGATTCCAAGCCCTGAACCGAAGGGGACCACAGATAATGTCCGATAAACCATGCTATCAAAGAGGCCTGGGGAGG"))
+(assert (= z "ggcuuccc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2
new file mode 100644
index 000000000..3c7981ca6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0402.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGGGCGTATTTGGTTCGCGACGGGGCCGGTCTCCACTCCTAATCACAGTTTAGATCGGTGGGAAGCAGTGCAGGATACTAAAGAGGCCCGTCCTCATCTCGCTCAAAGGGGATGGACATTGGACACTTGAACCTAATGTAATTCATGTCAGCTGTCCTCCCCATTGGCGAAAGTAGGGTATGGTTCTGAAGAGTGACGA"))
+(assert (= z "uagagcgaguuuccccua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2
new file mode 100644
index 000000000..13257cafe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0403.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTACAGGGTTAAACGCTCCGTGTAAGCCAAGTAGTTTTCGGCACAGGACCCTGAGGTCATGAATTCGTCCCGTCCTTCGGGTGGGTATATACAACAGCGGACATTAGCGGACAAAGGTTGTGACACGGCAGTTTTGAGGTACTGCGGCAGGGATATTTAATCTACCAGGCCCGCGCTGCGGTTGTTGTGTAAGATTCGT"))
+(assert (= z "aagcag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2
new file mode 100644
index 000000000..220751219
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0404.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTTCAGTACTGAGGAGCATGGCTACTCACATCCAAGTGTGTGCACAAAAAATGCTTCATGGACTGGGCATCCATTCGTTAACGCACACTCCTCTATCCCTTACTAGCATATTCGAAACCCATCGAATATACAGAATCGATATAGAGCTTTATCAGAGTTGCCCTAGTTAGGAATGATATGGGGGGTGCCACGTACTTAG"))
+(assert (= z "ugacccguagguaagcaauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2
new file mode 100644
index 000000000..7bfb3cf93
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0405.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTGAGCCCTTTTCAATTATAGTCCAGGGGGTGCGGTACACTACCTCGCGCGACCTAACAGGATATCTCATGTAGGCTTTGAGACCGGTATCGAAAAGTTTTTAATAAGCTGCAGCTACTGTTCCACAGATATCCTGTGTGAAGGTAGCTAGCATCGACAGCTATATCTGCATGTCCTCTCATTGCGTCTGAAGAACATC"))
+(assert (= z "ccaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2
new file mode 100644
index 000000000..8fdbf9a3c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0406.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAACTGAGACACAGAGGTGCGTACCCTAGTTACTGCAGATGGCCCACTCATTGCATATGCCGTCGAGCTCAGCGGCCTTATATACAGAATTCGTACACGCAAAGTAAGGACTTCACTGGAGTGTACCGTCAACCTGATCATGTTTATAGACTGTAAGCCTGTTTCTCTCATCTATGCTCTGCGTATACGCGTGTATGCGT"))
+(assert (= z "aguacaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2
new file mode 100644
index 000000000..3249fcef7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0407.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAATCACTTTGGTCTCATGTCGGGTCCTAGCTTAGCGTCAATTATCCATCGGTTTTAAGTCAGCGACGTATCCGTTGCTGCGGACGAGGGTGCCCACGAAGTAATCATAGTACCTATTCGGCATTCGTCGGGCTTTGACGCAGACAGCCCCTACAACCTGTGGCGGGTCTTACGAAGTTCGCTGAAGTCCGTGCAGTCCG"))
+(assert (= z "uaucauggauaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2
new file mode 100644
index 000000000..9435a201c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0408.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTCAGGTGAAAGGCTATGCAATTCTTGTATGTATTCACGAAGTCAGAGATAGACAGCTTTCTAAAACTACACAAATAGATAGTCGGGCGAGACGCAGTATGAACCTAATGACATCAGTATTAGACAGTTCCATCCGCAACGCTCTTTCATCTGTAAAAGTGCTTGCATCAGGTAAGGTTATACTATCTGACACAGTGCC"))
+(assert (= z "guugcgagaaaguag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2
new file mode 100644
index 000000000..3761136fd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0409.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAACAGACATGCGGGTACTGGGTAAGACAAGTAAGGGAAGACTGCGGGGCAGTGTGCTTGTGCTTGCATGGTTCAGGCATACTGCACCCGCTAACCGGGACCCACCTCGCACTAGTAGATAAGTCTTAACGGCTCAAATCGTTGTTATAGCTCACCAGTCCGTAAACGCTCCCAACGCTCCAGCTGATTCAGACTCTCAA"))
+(assert (= z "aucuauucagaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2
new file mode 100644
index 000000000..e7952e9e7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0410.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACTGTTAAAGTGCTAGGCGCTTTGATACCCCTGTGAATTTCCCCACTCTGCACGACCTTGACATCGCAATTGCTTCAAGCTGTAGAACGGGATAGCTTCCACCGAGTACAATCCTAATTTGTAATGACCGTATTCGCGAAGGCACGTATTGTCGCTAGCACAGTGGGAGACGAACTCGAAGAACGCTGCCGAAGGTGGC"))
+(assert (= z "ugcauaacagcgaucguguc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2
new file mode 100644
index 000000000..59eabb94f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0411.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCACTAGAGCCATGTTTGCCCTTGACGGTGTAAGGGAAATGGAAGCAGTATGAATGTCACACCGGAGGAAAACTTAAGTAGGGAGAGAGCGCGTAGATCAGGTCTTTTTAGATTGACTTTTAACTTCCCGGGTCTACCATAATTTCTTTAGAATACGATTTCATTTCGGTGTTTGCTTCAGGGTTCGGGAGTATTCACG"))
+(assert (= z "ugaauucaucccucucucgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2
new file mode 100644
index 000000000..6ad0371cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0412.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCTCTTCCTGACGGCTACATAGATATGCTACTCAGGCCATACGTTTATGCACAAGGTCATAAAGCGTCAATGTGTACTAGTGGGTCGAGTTATAGCGGGCTTAGGTACTATGTTACAACGAGCGCCACGGCCGTTACACAGGTCGCGCATCCCGACTTAGTCCTCAATCGCCAGAGTCAGCGATCGCAGCTGGCCCGAGA"))
+(assert (= z "gaaucaggagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2
new file mode 100644
index 000000000..f26ad5509
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0413.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGGTTGGACTTACAAGGCTTGAACGTTGGCTATGTATTACTGAGCGTTCATTCTACTAGTCTCGAGTATGACACAGGGGAGCGGGCAAGTCGACTATTGGGGTGCGTCTTCAATACCCACTGGTGACGACGGAGTGTCCTGCTAACAACGTTGCCTAACGCTAGATCTAATGAGGTCACGCACGTTTCAGGAACCCGACT"))
+(assert (= z "uguccccucgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2
new file mode 100644
index 000000000..cf1e3b3df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0414.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGTTCCAAACTCAAACGAGGATTCTTCCCGAGGCGTAGTCTAGGCGAATGGCTTGATATAGGGACCAGTTAATGCCTGCCGACGCGAAACTATATCCCCAAAACCTTATGTGGCTGAACGTCACTCGGTCGTGTGTTAAAGGAGCCATTCAGATGCGCTTAAAGGACTTTTGGACTTCCTTATCGAATAAGAGAGCTCA"))
+(assert (= z "uaagaagggcuccgcauc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2
new file mode 100644
index 000000000..8328c74bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0415.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGATGTAACACTGTTCATCCCTCGTGATACTATGTAGCCGTAGCTCCTACCGGCAGGCATTTTTATACCCTTGGGGCAGAATGATTTACCGACACGCACAGACCAATCACGGCTTTGCATTCTCCGCCGATGGTATACCATCTTGGCTATCCTTAACGACCGCTGAAAATACATCACACGATATCGTGCATTCCAGGTC"))
+(assert (= z "uaugauacaucggca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2
new file mode 100644
index 000000000..1254a6061
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0416.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAAAATGAGAGGGTTCCTATACGATGTGTGGATGGCGCCTTGCTCAACACCATCGCTCGTACGTTCCGGGAGCGCGAATACAGCTGCAGATATCACCAAAATACACTCGTCGGTATCCCTGCGTAACATCAAGTAATCGGGGTAGGGGTAGGCAAACATATGGTCCCATTGTACATTGATCGGTGCAGTTTGTTTGTGTA"))
+(assert (= z "agcaugcaaggcccucgcgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2
new file mode 100644
index 000000000..7fc0fee28
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0417.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TATACACATAGGGCGCCTGAGTGGCTAACCCAGATATTCAAAGATCCAGCGTTTTCGGGCAATAGTGTCTGTCGTTTTCGAGGTACAGTAGGATGTGGGGCAGGGAAACATGAGCCAACCGCAGTTGCGTAGGGTTAGGCCCTAATTTGACGATGAGGAAGTGATGAAGTTGTCTGCCTGTTCTACGCTAGTGTGGACCG"))
+(assert (= z "acuucaacagacgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2
new file mode 100644
index 000000000..0628ddbc5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0418.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGGTGAAGTCAAATGAACGTAGCCGGACACTTAGTACCCGATTAATTTTAGACAGTCCATGTCGAATACCTTCCATCTCTGATTACGCCGTTTTATGGCCCCGCCGTCCTATATTTAGGATGTTTTCACCCGTGTGGTCTAAACGATCGTACTACCGAAATTGTATAGAAGTGTGGCAATACCGGAGATCTGGCACTTG"))
+(assert (= z "ggccucuaga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2
new file mode 100644
index 000000000..917f6bb3f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0419.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTATTCTTTGAACCGATTTTCATGACTGGGAGCCGACAAAAGTCCTCCTATACGCCTCGGTATCAGACGTAGCGCATGGCAACCGAGGCCGAGAGCCCCGCGCCCGCCCAGACTGCCTATGGTAGCTAATGTCCAAGGGGGTAGGAATGCACTGCCGTACGAGGAGTCAGCTTTCTAAAAGTACTGTGCTATCTAATTA"))
+(assert (= z "ccccauccuuacgugacgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2
new file mode 100644
index 000000000..518af26c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0420.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAATATGTAGATAAGTTCAAGTGAAAGCGCCGTCGGAGGCGGACCATATATCGGAAACATACCACATGAGTTAGGTGCGGAGATCAACTCGGACAATCTTAATTAAAACTGAGACTTTCCAGAGCCTTGCTTTCGCAGCCAATCCCTCGCACGCCTACGGACAAAAACCTTAACCGTTTTACTTACAAAAGCAAATTGAG"))
+(assert (= z "aaauga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2
new file mode 100644
index 000000000..655f9e2a7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0421.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGTTCATGTTTAGACCATGTGAGTTTCCCCTACGGTCCGACTCCAGTCTGCCATGCGGTTTTCAGCCACGTGGTGGCGATATTACTGTACCGATGTCCACTCGGCTGACCTAATCAGCATGTATCGTTAGTTTTTTGGTGACTGTGTACTCACTATAAGGTCTTCACCCGAGGGAGTGGAGATAGCACGATTTACACCGC"))
+(assert (= z "uuccagaagugggcu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2
new file mode 100644
index 000000000..8aefc5598
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0422.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACTAATCCACACCTGGCCAGTACGCACGTCAATATTAATAACGTTTTCTATAATCACCAGAAGACGTTCTGGGGAGTCTTCTAACTCCTTGGAGTGGGCCTCTACGGTGGTATGGGTACTCAGATCAGTCGGGTCCATTGAGCGGTCTCGCTTTTAATTCCGACATCATGGTTCGTCGTCTCCAAGCTGTACATGGAGTT"))
+(assert (= z "uagugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2
new file mode 100644
index 000000000..13485c0b6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0423.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGACTGAGGCCATGCGCTTAACGACTCGTCCAGGCGGGGAACCCCCTACTTGAGGATAGGACCGCTATCCTAGCCCCGGCAGGAAAGTGATCCGAGGTGACATATCCTGCAGGTGGCGAATGCGCACAGATTCACTACTGCAGTCGGGAAGACATCCGATACCAAAGTCCTCTCTGGCAAGGAATCAGTCGGGCGCCGG"))
+(assert (= z "acuaggcuccacugua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2
new file mode 100644
index 000000000..78bc3cdc4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0424.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACTATATGACTCGTCTCACATGCAGTAAACACGCCTTCTTATGGGGCGGAAGGTGGACCTATATTAAAATCAGGGTCAAAGCGCAACATTTATAAAAAGCCTTGTCTTCGCTACGTACGTACTTCGACGACAATGTCCTATAATCCACCAGTAAATGATAGTTGGGAAGGGGACTCTACGGGCGATTCAGATTGGGCGA"))
+(assert (= z "uggauauaauuuuaguccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2
new file mode 100644
index 000000000..30c3c7765
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0425.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGTCAGAGGAACAACATTCCCTGGTTGAGCGCGGTCCCCCCTACTGAAAGCTTTCCAGGGTAGAAGCAGGCGCACACTCAAAGCCGAAGTTCCTCAAACCGTGGCCTTCAGTGCGGCTTCGTGTTATGCGAGAGAGTTCCTGGAGGCTTGCAGATCGCTCGCTGCTATGATTGATACTCGGAGTATCGCGCTGGAATAAA"))
+(assert (= z "gcgacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2
new file mode 100644
index 000000000..50ecfa774
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0426.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTCCATGCATTCTAAGGAGTTTACGACATAAAACGCTCCATTGTTAAAAGTGCAGATCATGCACGGCGATGATGAGGTTCCCAAACTTGCCTCTCTTTCAGATCCGGGTCGTCCCGGGCGGGCAGTTCATCTGAGCATCCGATAGTGAGCCTAGGCAAGGTTGTTCCATGAAAATAAGGAATTACCCGCAAATCACGTGT"))
+(assert (= z "agguacguaagauuccuc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2
new file mode 100644
index 000000000..45ac5b22c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0427.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCGGCGAGCTAGACGTCGGCATTATGCGTGGCCACCCCACCCGCGAAAAATCCAGTCATATGTTTGTTTGTAGCCAGAGAGTGTCCTGGAGCGCTACAGTCTGGTAGCGCCATCCTTAAGAATTGCTAATAGCGCTGACGTGATCCCCGTTTGAAAACTGATACATCTTCCGCACCGGCATGGTAACAATATAGCACATC"))
+(assert (= z "cauuguuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2
new file mode 100644
index 000000000..6ca36f083
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0428.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCAGGTACTAAAGCATTCATTTTTGCCCCGACTCGGATTTTTCTTGAACTTGCTTGTAGTAGGTACGTCCGATAAGTGGTCATCTAATCATGATGATGGCGAGTTCCGGTGGACGAAGCCTCGAGATTGGTGTGGTTTCCTTGGATCCCGTGTCTAGAACGGCGCCTCGCGCATATTAAAAAGGATTAAACCAATTTCT"))
+(assert (= z "guaagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2
new file mode 100644
index 000000000..b41f1ade8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0429.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATATCCGCATGTTGTTGTTTACGTGCGACGGGTCCTGAGTTTTGACATGGTATTGGTATGAGAACTATTCCGTAAACCTGCTTAATCGAAACCTCCAGGCATCAGGTATCGGGCATTGATACGGACAACAGTAGCACACGTATTGACCCTCCGCCGCGTACGTCTCTGGCTCGGAGTCAGCACCGGGCCATGCCCAGAGC"))
+(assert (= z "accgagccuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2
new file mode 100644
index 000000000..07e51d424
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0430.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTCACCGAGAATCAGCCCAACGTCCCACCGGGCACTGAGAACCGACATACTCAGCGATCTGCGAGATCCAAGGTTAGTGGCCACTTATTTCTTTCGCAGGTTCCCGACAATTTCTTTGCTTGCTTGCCTGCTAGTTGGGACGGTTCGGTCGGCAAGGAGCTCTTATGCCTACGGCCACATTGTTGTTTCATACTTGCCAC"))
+(assert (= z "uuccaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2
new file mode 100644
index 000000000..7bba0f64f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0431.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGTGACCTCAGTAAACTAGTCGGTTATCATACGAGACCCAGTTCAAAGTGTGCAAAGAGGCAGTCGTCCAATTGCACTATAGAATGTATCTCTGCTTCTAACACCTTGGCGGAGCCGTTATCCCGGGCCCCGACAGAGTTAATAGTATTTCTACGGGCATTTGGCTGTCAGGCGAGTTGGGTACTATAGCAGTATCTCC"))
+(assert (= z "cugggucaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2
new file mode 100644
index 000000000..4337a5dde
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0432.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATACGCCCCGATGCGTGCCTTGCATTGTGGACACAACGACTCGACTCCGAGACGCCAAGTATACACTTTCACCGGTACTCGACAGTTGGTATAAGCCCGTTAGACCGGGGATAGCGGCGTCCAGGCATCCACCACCTTTACGGACGATGCGCATCCAAAGAAGCATCCCAAATTACAGGGACCTTATGAGCCTACGATA"))
+(assert (= z "cgguucauau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2
new file mode 100644
index 000000000..9e560c131
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0433.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTCATAACACGAGTGACCTGGTTCCCTCGATCCCCTGTTACACCCGTACCTACTCGTTGGATAGCAGGAAAACTTCAATATGGGTCGTCCTCCCGACGTGACAAAGTGGGCTGACGCCATTCCGGTGTTCGAGTACATGTCTTTTTGCGTTAGCATGTTAGCGCCGGAGCAGATGACTGCATGTAATGCGCTCTAGTACA"))
+(assert (= z "gccacaagcucauguaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2
new file mode 100644
index 000000000..9508301c9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0434.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGAGGGTTAGTAAGCGTTCACGTGCGGTCCGTATTAGCGATCGACATCAGGGGAGAAACCAAATCCTGATTGCGGTAAACATTACGGGTCAAGCTCTACTGTGCGTGAGAATAAATTTGCAAGAGAAACATACACGCCAGCCACTGCGTGAAGGGTGTTAAAATCTCAAAGATAGCCCGACGTCGTGCTACTTTGTACAG"))
+(assert (= z "uuuggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2
new file mode 100644
index 000000000..ec6d56c46
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0435.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTGTGTGTAGCTTGGTTATACCTGTAATTCAATTATTGCTGCCGATGTGACGTGCCAAACTACTCTTTATTTAGCTTGGAGCAGGCAGCCTCTATACGACGATCCTTTCGTCCGGAAAGTATGATAAGTCCTGGCTATAAATTGAAACCCATAGAATGCAAATCCGATCCCCATGGGAAGACCAGAATGGAAGGGGCGC"))
+(assert (= z "aucuuac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2
new file mode 100644
index 000000000..357650685
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0436.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAAACAAAAGGTCACGGGCGCCTCACGGAGCGGGAAGACTACAGGCCTGGGCTCCTTACTGGCTATGGTCGGCTGAGGGAGGGCCATGGATATAAAACTCCCCTTTTTGTCTGCATTTGTGATTGTGCGTACATTGAGAAGGCTTGCTGTATAACACGCTGAACCTGGGGAAATAGAGCAGCCTTGCGGGTGCCATCGGA"))
+(assert (= z "cgcau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2
new file mode 100644
index 000000000..c652e00b9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0437.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGGGCGGCTTGATTACGGCTGTCTCGACCGATGGTTCGGAAAGCAAATTCGGATGTGGAAGTTGGGGCGGAAGAATGCTCTCACATCCCTGCCTGCATTTACTCCACGGAGTAGAGTCCGAACAGTCACCACACGCAGCTGGCACCCACTCGGGTGGCCCCTTCATAATCAGTGATTCGGTCTTTCATTAGACCCCCCA"))
+(assert (= z "aguggugugcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2
new file mode 100644
index 000000000..f535350c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0438.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATCGCACAGTCTGGCAAATCGGCAAACGTTCTATGATGGAGTAATTCAACCCACAAGGTGTATTTATTAGGGTAGGATAACGCAAACCCTTGTCCTGTCAATATGCGTGTGAGCCTCAACAGGCCCGAGTAGTGAAATGGGCCCTCGACTCAAGGTTAGGGGCCTGAGTCTCCATCACGCATGGGATACGCCTGAGACA"))
+(assert (= z "ccgggagcugagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2
new file mode 100644
index 000000000..490f57ce7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0439.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTTTCGACGAGAGATACACTCCCTGCTAATACCCATTTCGAATGTTACCACGCGTATACCCGGAGGATCGAGATTTCTCGAGCTCTTCCTGTTCTCGCGGGGGACCGGTACAGTATGGGACTGGAGGGCGAGCAACCGAAGGCCTCCGTGTTGGTACGCATTGCAGTTCTATTCACCGTCAAATCGCCAAACTTCCGACC"))
+(assert (= z "aauggugcgcauaugg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2
new file mode 100644
index 000000000..8e9664cd0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0440.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAGCCTAAAGGCCTTGGAGACACGCGACTTCCCACGGTCCTCGTTGCTGAAAAGCACATTTCGCCTTGCGCTACTGGGATAACAAGCGGGGTGAATGTTTAAGAATCTCATCAACTGGTCCGCTACCACACGGATAATCCGTGTATCAGACAACCGTTATCGATTTTGCCAGTACGGATTGTCTTGGCAGTTTTGTTAAG"))
+(assert (= z "ggagcaacgacuuuucgug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2
new file mode 100644
index 000000000..dd037cde2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0441.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCCAACTGCGCCGGAGCCTGATGATCCTTACCCCTCGTAAGCTCTCTGGGTTGAGGGGGATTGCCGATTATACCACACAAGCTTCCGGGTCCTACGAGCAAGTACGAAGTAACTAGCGGTCCTGTAACTAAAGAGAAAGAAGTACTGTATCCGTCGACAATAAACGTCGTTGATTCATAAATCATCTCCAGAGCTGGGCC"))
+(assert (= z "uuauuugcagc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2
new file mode 100644
index 000000000..60c4113ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0442.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCATCTAGTTGCTAGAGATTTATCGAACCCTATGGCTAATCTAATTTAGTGCCAGTAGTTGTTTATGCAGCGTGATGCGGACCTCCAGAAGGTCCCCCAGGTCAGACCCACACATAGCCTACTGATGGAACCGATGGCATAGAGGCATGACGGGGTAATAATCGAGGGGTTACAAACGCGCCGCTAAGTTGGTTCTGAC"))
+(assert (= z "aucggaugacuaccu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2
new file mode 100644
index 000000000..4ee58733d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0443.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCGCTCTTCGGCACTCATATACAAGACGCCCCGGTTCACTCTATACGGTCATAAACGAATGTCCTATTGGTCGATAGCGAAGCTCGTGGCCATGGCTCTGCTAGTCCAACAAGATCGATTCGTCCGGGTCAGTAGCCCGGGAGGTTTGCCCCACATGGCCTACGTGCAGATACTGTGCAGTCAAACCTAAGAGTCTGGAC"))
+(assert (= z "ucaguuuggauucu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2
new file mode 100644
index 000000000..f8e17c88d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0444.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGTAGCACCGGACTACTCGCGGGATGAGCAATGACGAAGGGAATCCGGGGATAGCTGCCATAACAATGGGTGGGACAGTCTCGTGTTGCTGGCACGTAATGCATTGGGGTTTCAGTTCTTGGAGGCTCCCGATTTTATAACTTGCTCCCACATGGTCCGTGCCCCCAGTAGCCTTCGTTAGTCTTTCCATGCAGCCTCCG"))
+(assert (= z "cauuacguaaccccaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2
new file mode 100644
index 000000000..2bd55803d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0445.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGAGTTGCGGCACCTGCAAGTCCTCATAGCATGTAGAACTCCCAACCTCCGAAACGTCTCTTTATGCGATTTTAGATTACCGGTTTTCCGCCACCCGAGCGGCGGCGCTCAGGTGATAACAAGTGGGCAATGAGAAAATAATGGTAACCTGTGTACAAGGCGCTCGGAACTGGATTATTTAGGGGTTCACCCAATAGGAC"))
+(assert (= z "guuacucuuuuauuacc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2
new file mode 100644
index 000000000..6fbee31ff
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0446.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGCCATTCGTCATTGAACACAAGCTTGTTGGATCCAGGGAGGCAGTAGAATTCGGTGTCAAGCAAGCTGATGATCCTCGGGTAAGCACCGGTTAGCGAACAGACTTTGAGGCTAGGTATCAGCACTGGAAGTTCATTGCAACTACCCTCATGTACGACGAGTCCCGAGGGACTCGTAAGGGGACCATATATAAACGTAG"))
+(assert (= z "ugcuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2
new file mode 100644
index 000000000..4618022d4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0447.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTGCACATGTGCCTAGGTTGGCGTAACGGTTATTCAGGACAAGGGGTCTACGGTTCTTCTCGCAGGGCGCGCTTCACGCAATATTCCTGTCCTCGGCAGTCTTTGTTGCTCGGTGTCAAGTTGAGGGAGGGTTGGTGGACGGCAATGCCGAAAATGGTTGCGTATCGTGGCTTACCTACGCATCGCGGTGTATGTGGCG"))
+(assert (= z "caagaagagcgucccgcgc"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2
new file mode 100644
index 000000000..f763894d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0448.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AACCAGCTTGCAGGGGCTTCTAACAAAAATCTATTCTGTTTGCGTGCTCCGTCCCAACTTCATGAGCTTTTCCGATGAGGTTTCATGAATGAGACCGGTACTTGCCAATCTCGGGAATCGCAGCTTAGACGATGCTTCGGGGTCAGGTAATAATCCTCTAAATCAGAGCGGTGGCCCGTTGGTGCAACTCGAGCGACAAC"))
+(assert (= z "ccaugaacgg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2
new file mode 100644
index 000000000..cda2287a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0449.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGCTGATACGACAACACCTTACGCAAAACGTGTTAGTTGACTCGGGCGATCCAGGTCTTTCAGTATTCGAAATGAAGAACCGGAGTAATCGAACAGCCAATCACCTGATCTGTCAATGTAATGGTCTATTTACGGCCCCCTCGCAGGAATAACGGAGAGCTAGGTTCGACATAGCCACTTTCACCGTCCGTAAATTGCT"))
+(assert (= z "agucauaagcuuuac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2
new file mode 100644
index 000000000..3382db613
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0450.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTTATGGCCGTTGACGCCTCGGCTCGCTGGTTCATAGCCGCAGCAACAAGAATGCGTGCTACCCCAATCATTGGCACAGGCATTGAAACGTCAAGTCCTTGCGCTTCGACATGTGCGATGCAAGCATTGGTGCATATCGCACTCTCTCCAGGTCGATCCAGAGCCCACATGCCGGGCGCCTTCGTTATGAGTAATAGAA"))
+(assert (= z "agcguga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2
new file mode 100644
index 000000000..b03d5290e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0451.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGCTGCGTGTTAACCAGGGTATGCAGACTCGTACTAATTCGTTTAGGATCCTCGAATTGGGTGGAACAACGTAGATCACGTGAAAAGCTGTGGGTGCTGACTACAGTTGCCGTCCATGGATAGACCATCAATTTGAAAACAGGTGATTAGTCATAATAGATAGGACCTATAAGTTGCTGCAACCTGGTTAAGGCATGCG"))
+(assert (= z "gauuaagcaaauccuagg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2
new file mode 100644
index 000000000..db7c03678
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0452.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGGCAAACAGAATGACGCCCTATAGGCTGTCATAGCTAGTTTGCAGCCAAACCAGCCAATCGTTAATTTGACGGAAGACCAAAGGTACCTACCACAGTCACCTTTGCTTACCGCGTGTATTAAACAAGGGATTAAGTTGGAGATCTAACAAATCATGTACAAATACCTGCCGGAGGAACGCATGTCATACTACGACCTCA"))
+(assert (= z "guuuaguacauguuuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2
new file mode 100644
index 000000000..6be3615e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0453.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGTATGATTCACCACGCCTACAAGTGAGCTCGTCGGCAACCGAAAAGTGATTTACCTAATCCTCTACGTACTTATCAGTAGCACATAGCCGGACTTGCGCATCTCGGACGAGATCTGCGCCTCAGGGTTCATGGTCGAGATACAGGTACTTACTTAACGGCTCTCCGCCTAGCTTCAGCATCCTTTGAACCAGATCTATC"))
+(assert (= z "gcggauguuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2
new file mode 100644
index 000000000..0eb25b80e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0454.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCCTGATGCATCCTTGGGACGGCGTTAGGAATGTAGATACCCCATCGGTGTGTGGACGGCAGAGTTAATACAATCATCGGAATTATACGTGGCTGTATACATTCACATCAGCTTACCTCTCCATGGGGTTTTCGGCGCTACCCAAGTGCTCCAAACACCTAGACCAATTCGTAGTGCCTTGGGGAGACCCTTACAATTT"))
+(assert (= z "acgagguuuguggau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2
new file mode 100644
index 000000000..3d3b7cf1f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0455.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACACGTCCCCCTATGTGACGGGGGGTGCTTCCCACAAAACAGTATCCGATACGAGAGTTGGGTCCATTGTGCGTCAGATGAAGCTAACGGGAAACTAAATCTCAACCGCTAGACTACGGTGCAAGTAAGTGAATTTCAACGCATATCGACTTTGACATGCAGCTAGGCCATCACTGAGCGGAACTGACCAGGAGGCCAC"))
+(assert (= z "guaacacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2
new file mode 100644
index 000000000..05f5b0587
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0456.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCTCCAGATCGCATGGCACTAAGTTAATCAGCTAAACGGCTCGCACTAGGTAGTCTAGGTTAAATTCATGAGAGCCGCGAATGAGCCATAATACATAACCGAGGATATCCCCTCTTCTACACGTCCGATCCCCAGCGGGATAATCCATGTAGGACTGTCGACTGGGACTGGCGATATCTTACGACGCAAGCATATAGCT"))
+(assert (= z "gcugacccug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2
new file mode 100644
index 000000000..ff1ebc247
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0457.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCCAACCCACAGTTACAAGCGTTCCCATCGGTCTGAGTTGCAGATTGAGGCGGTAAGGCGTTGGTACATGCCAGCTAAACGGACCCTCCTGCATATTTAACCTGTTACGGTAATACTGTTCTGTGATTGCATGACATTCGAGGAGGAAGAGTGACTCTCAGACTGAGGAGGCATACAGAGGCATCACGTGAAGTTCCCGT"))
+(assert (= z "guauaaauuggacaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2
new file mode 100644
index 000000000..c6346c0e3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0458.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGACTTATTATGTCCTCTCATTCTGTAATTGCGGTGGTCCAACGCACTCATACTCGGTTCTAACTCTACTGGCCTCTACGTAAATAGGGACGCCCCGGCTACTTGAAGGAGGGGTTCTCGCAACACCCGGTCCGTAAGACGTAAGCATAGCCCAGACCAGCGGCGTAGTTTACGGGGAATTGGCACGAGCCAGTCCCACC"))
+(assert (= z "agagcguugugggccag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2
new file mode 100644
index 000000000..3182ac302
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0459.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTCAGCTTGTTGTGGTTCCACAATCATCCATTGATACATAGCCAGCCATTCTGCTCACTACACTTGGCCTGCTGCGTGACAACCAGTCTGTGGGTCCATACCCCCATAGTGTGTTCGAAATTAATCCAAATCCCCCGAGCCACGTTAGTGTTCAAAGGTTTCTGCTAACAATTGAAGTATTGCCAGAGGGACCCAAGCA"))
+(assert (= z "caaguuu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2
new file mode 100644
index 000000000..a0632ac73
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0460.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACAACCATGAGAAGTATCGATTCATTTTGGATACTTGTATGCGGCAAGCCCCGAGCGCACGGTGTGAACAATCCAGTTTTTCACACTCGCCATGGGGAGCCGCAACTCTCGGGAGCCAATACTTTGTGTTGACTAGCCCTATATAGACTGGCGTATGGAATGTATTAATCAAGGACTACACCCCGTAAGTCGCTAGCATG"))
+(assert (= z "cugauguggg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2
new file mode 100644
index 000000000..682fce0b6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0461.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTGCGCACTTCCTCATTCAATGGACTTCTAAGAAAGAATGAGGAAAGAGCCGAATTACTAAAGTGACCTAACGACCTATCATTGGCTTACCCCATTATCAATTTAGGTGCATCGCGGCATCGTTTCTCACGGCGTTATGTCCGTCCGTTAGGGCGCTCCCTGGCGAAACGAAACTTAAAGGTCCGGCTACCGAGACTCAG"))
+(assert (= z "aaggaguaagu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2
new file mode 100644
index 000000000..11cf3892b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0462.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGAATTTGATGCTCAGCTTAGCAATGCCGAACGAGCTACGTAATGCACTGCGGAAATATAAACTCTCCGTTTGTTACTTGGGCGGTCGACGTCTAGTCACTTAAATTATATAGAGTGTCTATATCACGGATTTAATCAAGGCGTTAAACACCCCCCCACGAAAAGAACCGGCGGCGTAGAATACAGGTGCAAATGCCTT"))
+(assert (= z "uuaug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2
new file mode 100644
index 000000000..79d460044
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0463.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTCCGCGGCGCCAATATAGGGTTTGGGTCTTATGTAAGGGCTTATAGAGAACGGTGTATCCCAATCGTCTCAGCCACTATAGGTGATTGACTAGTAATCTTAGGGGGTTCATCGTGGTACCTTCTATGGTTGGCATCCACGATGGGGCCGACTAATAACTATTTTCCTCGAAAGACCGCGAGCATTAGGAACACAGTTA"))
+(assert (= z "ccacuaacug"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2
new file mode 100644
index 000000000..229cfee74
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0464.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGCGCGGCAGAACCATACAAACCCGACCTCATGAACAGAAGCGTGTCATGACTTGCAAATAGCTTGGGTTGTGGCTTGTGTGCGCTGACACACGTTAGTCGCTTGAAAGTAATGTTCATGCGTTCGCTAGGCCGATATATACTCTCAGTTGGCGGTCGAAAAAGCATGCGTGCCATATCGTCCAATGATTGGACCGCGA"))
+(assert (= z "acguuuaucgaacccaacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2
new file mode 100644
index 000000000..33008d527
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0465.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCTGCGCGCGTACTGCCACCCTGTCTCGGATCCAATGCGGGAATCACTGGGACCAATGAGCCCGCGCCCTCTTCTGCCGAAGCAGTCCCGTATGTAGTTATCACCCTCGAATGGGAAGCGCCCCTTCTCGGATCGTGCCCAAATGCCTACGGGTTTGAAACTAAAACCGACTCTTAAGAGCCATGGTATGAGTCCAAGA"))
+(assert (= z "gacgcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2
new file mode 100644
index 000000000..f61149410
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0466.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCATCGACTCCACACTTGCAATGAAGCACCTCACAGATGTCATCCGTCATTCGTTATGCGGATACATTGTACATAGACCGTGCATCCCAACTAAGGCCCACTTGTACTTCCTTGTACCGCCTAAGCTGCACGACAACGTGGGCCGGGCGACGAAGAGTGGATTGGATTTAGACCCCGCACCACGGGTATACCCCGTGTGC"))
+(assert (= z "ggagugucuaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2
new file mode 100644
index 000000000..ab010b496
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0467.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TTTAGCGCAACTAGACGTTCATATGTGGCGCCATCGCTCAGTAGAACGTAGATAATAGATTACTCCGAAACAGTTCATAACTAATGGTCCAGGACTGCAACGCGAGCGCCACGAACCACTTCAGAGGCGCTCGGAACGTAGGCCTGGGGACACAGCAATGCGCCGGTAAACGGGGGCTCTAGGTTAACCATATCATTGCA"))
+(assert (= z "cuccgcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2
new file mode 100644
index 000000000..231e6419c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0468.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCGGCGCAGGTGTGCGGTGGAAAAGCTCTTTGCTAAAAAGTCCCGCACTAGACGGCCGCGTAGAGTGGTAAGAGACAGCCCAAGATGCACCATTTGTTGTCACTAGGGTCATTACAGTCACGAATGGTAGTCCTGCCAGGACGACCTTCATACATTATCATGAGACATCTGGCGTGGAACTCACCCGATCACGGTCGATT"))
+(assert (= z "accaucaggacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2
new file mode 100644
index 000000000..e98cda3a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0469.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AAACGTCCAATGGATCCTGGCAAAACGCGCCTCGATCACCTTCACCGACAGATGGGCAAACCAGCAGGTGCAAAGACAACATATCCCTACCAGGATTAAAACGGTCAAGTGTAGTTTGCGTAGGTGTTGTTTTATTCTGGAGCGTTTACAGATGTAGACCGCATTCGCTAAAACCTCTGTCTGACGATTAGCCCAGCGCA"))
+(assert (= z "aaauaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2
new file mode 100644
index 000000000..09eab3cb0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0470.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GTGCGCTATAGGCTACATCTTACTTCCCGGGTCCTCTAAGGCGTCGTATTGTCGACTTCGCGGCAACGCAAGTACCCTCTGTGTGTAACACGTCAAGGTAGTGCACAACGGCGCGGAAAGAGTTGCCCCAAAAGGCAAAGGCAGTGACCATATCTGTCCGAAAGCTCTGGGTACATAATTCGCAAGGTCTCAAGTAACCT"))
+(assert (= z "gugcaguuccaucacg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2
new file mode 100644
index 000000000..0e5d7feac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0471.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAGTAGCTCGCGAAATTGTCTAAATATCCAATGCTCGACCAAATATAGACTGCGAGCTGGAGGAGTGATAACAGTAACTCTATGCTAAAGTCAGCAGTCGCAGCATCTTGTGGGCGAAAGATCCACTTGGCGGTAACCGAGGCCTGAGTCTGCAATGCGACCTAGACCTTTAGAAAGTTTTATTAACTGCCCGTTTTAC"))
+(assert (= z "agauu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2
new file mode 100644
index 000000000..a3404e71d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0472.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTATGTAGGTTCAGGGATTGGAAGCTAGCGTCGCCATAGAGCGATGTCCTTTGCACCAACCCTCGGCCTTAACCGATGAGAGTGATCCACCCGAACAATATTTTTGATAAGATTAATTCTAACTTTTTATGGCCCCGTAACTACTGGGAGCCCTCCCGGCAGAGGACAATGGGACGTGATGAAACGGACGCTGGGTGGTC"))
+(assert (= z "uauucuaauua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2
new file mode 100644
index 000000000..c83f6fcc7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0473.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGAGATGTTAAACAAATCCTACTCATCTCGAGGGGACAGTTAGAAGTTGTATTATTTCGAGATTACAGCCTTCTAGGGACCTATGTTACGTGTGGGAACTACAGAATACGTTGTATTAGCATACGAATCTTAAGCTAGTCGATATCATGCTTGCGTTCTGACCAGGATGGAGTTAAAAGGACCCAGAAATTTAATATCCC"))
+(assert (= z "ucuaaugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2
new file mode 100644
index 000000000..e39bb7826
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0474.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACCAAGGTAAGTTGTGCCCCCGTGCGGCCAGCAAGATTCGTGAGAGGTATGATCGCAGTCGAGCTCAATCTGTACCAAGGCTATACTTCGACAGGCACATCTGCAGCGTACAATCAGTCGGGTTCCTAAGACTAACGTGGCCCGTCCCCCCCAAGGTACTATGTCTCCCGGTTATATAACTCGAACCCGTAAAGATGTGG"))
+(assert (= z "augauacagagggccaau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2
new file mode 100644
index 000000000..f6df637e7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0475.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTTATTTGGTAACCGCAAGTGGTAGGGTAGGAACATTCATCCAATTGTCGACCAAACACTTTACGGGAGTTTTTGTACCATGGCCGCATCATGCAAGACACATGGCTAGTAGTGAGAAGGTCTGCCTTTCATGAGCTTAAACGCACTCCTACACCCCCACTTGCTCGAGATCGACGACACCCTGCGAGTCACACACTCG"))
+(assert (= z "aucccauccuuguaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2
new file mode 100644
index 000000000..1b617d90f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0476.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATCAGATCGGGAGAACGCCTTACTCGCACGACCGTCGATTGGGAAACGCTGACCTATGACGTCCCCTAAGTAATAAGTAAAAAGGGCTGTCGCGTTGCGACGCCTTTCAATAGCTAGTAAGGATTTGCGCTCTTCCTGCCCTGATCGTCGTTATCCCTGGGGGCCAGGCTGATAGACACGGAGTAGGGTATTTCCTATGG"))
+(assert (= z "uagcccucuugcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2
new file mode 100644
index 000000000..df6825d3f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0477.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGCCATGTGTAACAGGCGTGGATTGAGCACAGCTTACTCCGCGCCTCACCACCGCTTTATCTGACTAGAGGATGCAACGACACATGCCTTTATATAGGCATCAATAGCATAGAAAGAGCCTGGGCGAAAGTGACGCTAGAATCTGTTGAATACATCTAGTCGCAGGCGGCCTGCGGTTTTTCACTCACATGTTCTCGGC"))
+(assert (= z "agacaacuuaugua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2
new file mode 100644
index 000000000..3b9930fe1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0478.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ACCCGGGAACGGTCCCCATGGCTTGACACCGACACGCGCACCCTGTCATGCTTTAGTTTTTTGTGCAGACCCAGCAGTTAATGAGATTGCCCTTCCTCACGGCTGCATTTGAACGCATGGCCTCCTCAAGTTCCCCGCTGAGGTATCTTCTTTCACACCGAGATAACCCGTCGCATGACGGGGGAGTGCATGACTAGCCC"))
+(assert (= z "aggaguucaag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2
new file mode 100644
index 000000000..55d34c822
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0479.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATGACGATGAGTTGCGTGCGTGTACGGGGCCCCAGTTGCCTTCAAGAACCGTTTGGTCGATCATTAAAAAAAGTTTCCAGGCGCATACTAATCAACTTACCTATGGTCGATCCCTGATATGACAGGGGTCCAACATTCTCACGCCGAAGGCGTCTGGTCGCCCACTGAGAGTGTAGGACAGCAGCGTTTGCCTAAAGCAC"))
+(assert (= z "uucaaaggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2
new file mode 100644
index 000000000..391a079af
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0480.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TACAGCTGTGAAGACACAATTGTGGCGTTTTCGTGGCGGGCTCCGCGCAACCGCTCGGCTGATGACCGGGTCCGTTTTACCCCTCCTCCATGCGTCTGACTTGTTCAGGTAACCAATGGTCCTCCGACTTTCTAGCCGGTCTGCTCAGAGCGTGATGGTCTTAACTCGCCTCGAAATAGAGGTTCCTGTACACGTGGAAA"))
+(assert (= z "guacgcagac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2
new file mode 100644
index 000000000..3358ee444
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0481.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGCTCCTGCAAACTCACGGATCGCATTGGGCCATAATCAGACAAACACACCGGGGGACAGGCCGCTTCAGATCGGTTGGGAAGAATGTGTGCTACCCCTTAGCGCGCAACAGGGTCTTACAGGCTAGCACGCCTTGCCTCCATGCATTGGCATTTGTGGATGGTGCCGACGCCGGCCTAGATGCGATTGCGGGAAGGCGG"))
+(assert (= z "ugccuagcguaacccg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2
new file mode 100644
index 000000000..ca45629fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0482.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TGCAGCTTCTGGCGTGAACATGTGACAACCCTTGCTACGGAGACCTATCGCACGTATGTAATATGACTGTGATTGGCAAGAAGGCACAGACCTGGCTTGCTTGATGTAATACCTATCTCGCGCGCCTTCTTGTGTGTGTGAACACTATGGCTTTTAGGAATGGCAAACCTACTTAAGCTGCGATCTCTCCCTGACCGCAA"))
+(assert (= z "gugauaccgaaaauccuuac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2
new file mode 100644
index 000000000..f0e3839f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0483.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGCGTTCTCGTCAGCCAGAACTCTAGAGACGGGGTAGTATACCTTAGTACTAGATTAACAAGCGGAGCTACGTACCAGCCCCAATATCGAGTAAAGTCGAGTTGTTACTAATAAAATTCATATGCCAGCTCATTACAGGAGATTTAGGCCTCGCAGGTCAGTAAGATAATAGGAACAGAGAGGTTCTATCACTATCCGAT"))
+(assert (= z "caacaaugau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2
new file mode 100644
index 000000000..9e44235ee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0484.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTAAACTTCCCACAACCCTACACAAAAGCTTAGGCCCCTTGGATCACGCTACCAGTTGAAGCCCAATCTTCTCCTTACCCTATCCAACCACAAATCAACACCATTGAGCTCCTCCGATGTCTGCCCCTTAACTATACACGTCCCTGTAGCCTTGATGACAGAATCCCAAGGAAAAGCAATCTTTCCTTCTAGCACTCTAT"))
+(assert (= z "uuggugu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2
new file mode 100644
index 000000000..3afdd7ea2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0485.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GAAAATAGGCGGGGACTCGGGTACTTCGCGCCGTACAGCTTTATGATAGCTGGAACCCGATCAAATAGATTCGGTACATTTTTACGCACTGTCGACTCAGCACTATGCATTCGACACACCTTACATAACCTGGGTTAACAATAAGGGTCAATGAGACTCTTTGCTAATTTTCTGTGCAGCCATGGGATTGTAGGATCTAG"))
+(assert (= z "uaaaaaugcgu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2
new file mode 100644
index 000000000..823b58044
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0486.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TCAAGCGAGACCCATGCGGGGTCCAAACTAGACAGAGCTTTGTACGGGCGGCAGCAGTGACCGTCCGTTGGTCGAAAGGCCTTGATTCCGAGATGAGAGCCCTTTATATTAGTTCGATGGAAATAAACTAACCGGAGGTCGTCCCCCTTTGTCACACAGAGCATCCGAACACGGTTACGCAACGTGACATTGATAACCGG"))
+(assert (= z "cgcucuggguacgcccca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2
new file mode 100644
index 000000000..96a935716
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0487.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AGGCTGGTCATTGCCTACATATACTCGAGTTACGTGTGTCGCTTGCTAGACTAGAACGTCTGCATTCCTGTGACTACTTCAATACCTCGGAGTCCATTTCATTCCCCGAGTGCTGCTCATCGTATACTATAAAGCCACTTTAAGGCAGTAGGTGACTGTCTAATACCTAGGACAAATAGGGAGTACGCCTGTGTATAGAT"))
+(assert (= z "ggagccuca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2
new file mode 100644
index 000000000..c4c0eddae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0488.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGGATTAGTGTGCTGGCAAGTGCCAGATTCTAGCTTGTGTTTAGCTTGCCCAAACCTCTGTATCAGTAGCGTCAGTGTATATTCACCTGTCCGTCAGTGCCTGCGAACAGTCTCCAGGTAACTCGACCTGGCAATCACTGACTCTAACGCAACGCTGCGGTGTATTGCTTTCGCTCAGGCAACAACTGAAACCACCGTA"))
+(assert (= z "uucacggucuaagaucg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2
new file mode 100644
index 000000000..8aa8d2690
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0489.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CGTCGCCAGCCCCCAACCACCGGCCCCGCGCCAGCTGATAGTGCCGAAAAGTGGCCCGCGCGCAAAGTAACGCGCGGACGTCTTAAATGCCCAAACCTCTCAAAATATAAGTACAGGATTGATCGTGGGATCTGTGTGTCGGTGCTATATCCCGCCAGGATGCGAAGCCGCTAAGGGGTGGGGGTAGGCGACCCTTAGGG"))
+(assert (= z "uaacuagcacccuagacaca"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2
new file mode 100644
index 000000000..9fe1067d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0490.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "ATTCCGTCACCCTCCTGCCTTATACCTAGAGATGTCTCAACCCCGTCAAGGCGATTCTGTAATCACACTTCAAGCTACTAGTGTAGTGTGTCAAGTAAATCCTAGACCACCGCGCTGGAGCCTTCAGCGTCCTGGCAGCCGCGACGTCGTCGCCATTAGGGGAATTCTCCCGTAAAGGTTGTGCTGGGTGCGTATTCGGA"))
+(assert (= z "guucgaugaucacaucacac"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2
new file mode 100644
index 000000000..31c918420
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0491.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GGAACGGAGCACGATTCTCGAGGCTCTACCTCTGGACTGCATCACGTAGCCAGATCCATTGGCCTAGTATGCAAACGAGGATGTCGAGACCTACGGATTGTTCACCGTATACCATGTCGCGCCCGACGCTAAATAGAAAGTAACAAATTACGCGATCTGATGCTAAACTGGGCTTTGCACTGTACTGTCCTTGAGCCTCG"))
+(assert (= z "cuuucauuguuuaaugcgcu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2
new file mode 100644
index 000000000..1443a32f6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0492.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGATCCAGGCGATGAAATAGGGTCGGTAGGCTAGGTCCCGGCTTGTACCCATCCTCCGCGCTGGTTCGTAGTCTACACAGTATTTGACGTGTATTGTAACGACGATTGCCAGAAATCCCATCGCAGGACAAAGTTAGAATAGACCATGCGATTGGTACTCTGATACCGACTTTGATAAAAACGGGTCTCCTATCATTCG"))
+(assert (= z "gagacuauggcugaaacuau"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2
new file mode 100644
index 000000000..36e1849ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0493.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GCTCAGGAACCATAACCATCTCTAGGCCCAAAGTCCGTGTTTATTTTATGATTTTACACTAGGTCTCCGATAGTACTCTAGTTGCGACATGATCAGTACTGGCGGGTCAAATGCTCCTCTTGCTAAGTGGTATGGGGACGTTCATCAAAGTGTTTCAGCCCGGGATCTATATGTAGGCGAAGAGTCCTAACCATCTACGA"))
+(assert (= z "ucaggcacaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2
new file mode 100644
index 000000000..d64b4d613
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0494.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CAGGGCCGCCGACGACCGGTTTTACTGGGAACTTGAGGGAGGTGAGATGACACTAACCTGAAGATCCTTGAATGCATGGATAGTAATCGGGTGATTCCAGATGATGAGTCCTCGTTAGAGTTGAAGGCGCCGATTGTAACTAGTACGACGGCCGACTCGTCTCGTGCCTTTTTCGAGGAAGAGCCCCAGGCAGGTAGGAA"))
+(assert (= z "ggcugcuggccaaa"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2
new file mode 100644
index 000000000..e5522f07d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0495.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CCACAGCACGGAAATCTCTCGGTGCTGACGCGATTGCCTAACCGCGGCTCCGTTTCAGGCTTTCAAGACTCTGGGGCTGGTTTAATAGGAAGCGGGGCGTGGTGCTGGGACCGATGGTCCATCAGACTGCGGCCCCTGATATACTAGGCGGACGTGCAGACCTGGGCAGGGTCGTTGGCACTTACATAGGGGTGGGGATG"))
+(assert (= z "ugccuuua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2
new file mode 100644
index 000000000..3f016d144
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0496.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "CTGGGCACGCAAGGTTGTACAGAGACGCCCTATCCCTGACACGCCCGCTGAGAATCACAACTTACCCAGTGTAGGGTGAAACGCTGGGCATACGCTGCGTATCATGGGCCCCAACGAGTTGTGATGACAAGAGGCTCTGCGAGCATAGGCATGATCGTTTACTTAACTTCATACACTCCGCACGTGCAACTAAGCATCGA"))
+(assert (= z "caacacuacuguucuccga"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2
new file mode 100644
index 000000000..8279d8402
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0497.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "TAGCGGTTGCACATCGCCGCAAAACAAGTCATAACAAGTTGGGCGCCCCCGACGGCGCGCTCCCTCTGGATTAACGATCAACACTGGTTTCAGGTGTGGATCTGGGGATTCAGTCCCTCAGTCCATTTCAGTCGGGGATTCCCAAAGCTAATCCGCTTTCGAACAGGGATGTAGCCTTTAATTGGTCATCGGAGTGCGTT"))
+(assert (= z "auuaaccaguag"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2
new file mode 100644
index 000000000..99f01d3a4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0498.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GATAAGTGTGGTCGTGGGCTATGGGATTGACGAGACACTCGTAGTGTCCTATTTTAAATTAGCTCCCCCGTTGAACTACCCTTCCATGACTTATGTGAAGCCTTAGGAGTGGGTTGACTCTGCGTATATGACAGTTTACACCTTGCGCAAGACCTACTCACATCCCTACCAACCCTTCTGATCCGTTATTGATACTTGTG"))
+(assert (= z "ggaacgcg"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2
new file mode 100644
index 000000000..b34683e28
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0499.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "AATACCCAAAACTTTCAATCCTGCTCGGTTTGTATTGTGGCAAGCTGTCATGATCATCTTGAAAAGGCTCCACCACTTGTGAGTCCGCCGATCTGGTGGTACAGACCCTATGTTGAGGACGTAGGCCTCTGTTGTGAGTATAAGGGGTCTTGCAAGTAACTACGCCCGCTTAGCGAACACGAGGGGCAGCCTGGATCACG"))
+(assert (= z "cuuuuccgagguggu"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2
new file mode 100644
index 000000000..458e4283d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-sat/benchmark_0500.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete values
+(assert (= x "GACCAAGACGAACAGTTGGGTCTGGGTAAGTGAGACCTCTCAACCAGGTGGGAGGTCCCTTCAAAGCGTCTCTCGCGGATATGGCTATGGTAATCTCCCGATTGTGAAGACAAACAAACTATATGCTATACTCTATCATCCCCAGGCACGCTGGAAAAGTCCCCCTTCCACACGAGAATAAATTGGTGCGTGGACTATGG"))
+(assert (= z "uguuugauaua"))
+
+; Pattern must occur in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2
new file mode 100644
index 000000000..fb13e2507
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0001.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCTGACATCATCTGTACCATGGAGTGTGTACCGTCTGAGACCATTACAGTTTATCTGAAGTATAAAAGGTCTCCATGCAGTTGCGGCGAAACTCACTATGTTAGTGATTAATCTCTCTGCGCACGCATGACTCAATGAAAAAGTGAATCGTATCACTGGCAGCACATGAACCCTGATTCGGATAAGTAAAGGACGATAC"))
+(assert (= z "gccgugaccgcuuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2
new file mode 100644
index 000000000..20be8b43f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0002.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTATATAAAATTTGGATTACGTAGGCAACTTGCTGAAATCACCGGCCTCCTCCTGTCGCTCCATCCTCCCCTCTGGATCAGGGCCTTGACCTTGCCTTTCTACCGTAAGTACTCATGCAGGGAGTTCTACTGCCCAAGGCCCCCATCGTAATTGGTTCCGAAGCTCTGGTATAGCACCGCGCTCACCCGTACACTACATT"))
+(assert (= z "gggacugauuuuuau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2
new file mode 100644
index 000000000..c2518a773
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0003.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCTGTGGGCAGTGTGCTACCCCGCGCCATTGTAACTCAACGGATTACTGGGATGGGTGGGAGTCATCGCGCGATACCTAGTTAGACTGTTTTTTGGGGTACCCTGTGCCATTACTCATAGGCGCCCCGAATCAATGATTTGGCAACCCAAACGGATCCTTCGGCCCGGCCCCCAATCACCCGAGATATGGGCGCACGTG"))
+(assert (= z "cccgugccuacgacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2
new file mode 100644
index 000000000..f86069181
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0004.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCTGAGGGCGACATCTAGGACCAAGCACGTTTGTTGCTGTGGTGAGCCTGTACACCGGAAGTAAAATTGCACGACGGTTTTACGATCGAGAATTAGAGGCCAGGCGCAAAGGGTATCGATGGTGTCTCCAGCAACTGCACGTAACGCCTCCATTTTTCAGTCCAGAGTCTAAGCTCTTTCCGATTAAGGGCTAACCCTG"))
+(assert (= z "uaggaucuacauaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2
new file mode 100644
index 000000000..c0ccddc2b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0005.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCTATATACTAGTTGTGCAGGGGAGAAATACCCATGCTTTGCGTTCACAGCTGTGGCCGCAAAACGATAAAAGCAGTAGGTATCAATTATCCGTTAAAACCTTGAGGTGTCACGCAAGCCGTGGAGAGGGCCGGCAGCTATTCCGATAGACATCATGCTGAACAATTAGGTGCCAGAGCGATTGGTGAATGGGGCGCAT"))
+(assert (= z "uauaaauagaguuga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2
new file mode 100644
index 000000000..4d01ab71a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0006.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTACTGCAAAATGTGAGCATCCGACCCGTACAGTGACGTCAAGCTGAAACAGACGTCCATGGGGAGTCCTTTTCCAGTGACCTAGTAATTCTTGGACGCGTAATATCCAGCTGCAGTTGTCGAAAGGATCTGTTGGGAGGAAAAACCAGATTTTCGTAAAAATAATCGAACCGGAGCGCGTGCTAATTGCCATTGCCTAG"))
+(assert (= z "cuagggcguauuguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2
new file mode 100644
index 000000000..570a961c3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0007.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATACCCTACGGACATGGAAGCCCTCTCGACCAGGTGAGAGTGCGCGGGTAGAGTAGCTAACGCTCGTGATTCCGCGCCACATATGCCCGGACGGGCAATGGCCCGCTGCAAGACTGAACTAGAGGCGCTTTTCGTTACGGTTTCTACCATCACTAGGTTCCAGTAAATTTCACCCCTTAATGAGCCATGACTAACTGTTT"))
+(assert (= z "cugagcgugcucggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2
new file mode 100644
index 000000000..c0c09ab97
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0008.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCTAATACCCCAGGCGATATTGGGTACACATCCACGTCATACATCTGACTTATAATAGTTTCATATGGTCACCACATCATCACTCTTAGAGAAAGGACCGCTAGAATAGGTCTCACGCCTAGCTAACGTAAACAAGTCTGACGCTTTGAAAAGGTTGAAAAGCAAATCCCCTTTATCTGGCCAGAAGGTCCACTAGACG"))
+(assert (= z "acaguuugucaugcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2
new file mode 100644
index 000000000..1efab9632
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0009.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTGTATTATCATGTCTAACGTCTGGCCGGCAGTAGTCTTGACTAAGTGCATCAGTTAACCGGGTTACGTAATAATGTTAATTGAGAGTAGCTGGCACTATCCCCCCTTTGGTGTTGTTATACACGGTTCGCTGTCGACGCCATTCAGATCGCGATGGCCCTCACCGAGGCCCATACCGCGCATTGCCGGCAGCTGCGGA"))
+(assert (= z "augagucccugacaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2
new file mode 100644
index 000000000..1cb745697
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0010.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAAGACGACCTAACATCCTACAACAGGCACCTGATTGGACGTAGGCAAGTGCGTAATCCCGATCTGCTGTCTGCCCCTACGAAGAAAACGGGCCTCTGCAGACAAGGCTGAACGTCAGCTATTCTGCAGAGACAAGGTCACGTGCGTAGAATGTGGCCAGAGTGTAACGGAAAGACGTGGCCATTATGATAAGTAAGCA"))
+(assert (= z "uagucuugggggcca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2
new file mode 100644
index 000000000..cb209d12b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0011.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGACCTCGAGTATTTCAGCGCCTCGGAAACCAAGTAAGGTGGGTAATTTTTTGCTTACAATCGTTAATCACTGAGTCAGTTTCTGAGGCGTAGGCGTTCGGAATATCGAAAGCATGGAACCCCGCGAGATCAACTCTTGGTTCTAAAACTTTGTCTCGGGATAGACCGAAGTAAAGGATCTAATTGTCGACAACACCTGT"))
+(assert (= z "agcuagugcgggugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2
new file mode 100644
index 000000000..0ad98c8f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0012.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTGCAAGTCATGAGTTTGTACCATAACTCGACGATCTCGTTAATCTCCTCGGAAAGAGAACACGCGAAAAGCACAATCGGTGGTTGGGGCCACAAACACTAAACAAACCCCTCCATATACCTGTCATAGAGGCCTGCCCTATCATAAAGATAGTCGCAAGAGCTTCTGCAGGTTTCTTTCACAGCGATGGGCAGCCGCGA"))
+(assert (= z "aggugguaaucccgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2
new file mode 100644
index 000000000..e6bfa8f5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0013.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTATCCGTCGGACGTACACTTTTCGTATAGAGCAACGGCTTACGAGTCTACACTATGAAATATGAATCGTCCTGGTATCCCCTATGTATGTAACCCAGGGTCGTAGCGGGGTTTCCGCCCGCGAATAAGGGTCTACGACACGGACACTCTTGCCCGGCGACTGATTCCAACTCTGGTTGACAGGCCAAAAAAGTTTGTAA"))
+(assert (= z "gccaacuugccgcag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2
new file mode 100644
index 000000000..5a9fcf374
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0014.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTTTGTTAAGATGGTTGACCCGGCGTCGGCCCTGTATCAAGAGTAGATAAGGATAACACCCCCGCATAGGTGGCGCTCCAAACATAGACGGGAGGCCGGGCGACGCCACAATATCGCCATGCGGAGCTCAGGCTAGGAACCGTAACCTGGGTGCTCACTACCCTCGCGTTACGAGATTCCTGCACGATTCACTGAGAGC"))
+(assert (= z "uguucacagcucgga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2
new file mode 100644
index 000000000..0ccf7169e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0015.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTATCACGAGTGTGAAGCAGTCCCAAACTGTTCTACAGTTTGCGATAACCTCCGCCTATTCTCTATCGCAAGTGACGTGGTAGGGGCCGCTGTAGAAGGACGGGGGTGACGAACTGAGACTACGATTTTTTAAGACGCTCTAAGACCGCTGAGACGCTCTGCTGACCTACCGACTTCATTAAGATACGCAGTCAACTCA"))
+(assert (= z "gcucugagaggccgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2
new file mode 100644
index 000000000..84c43cf0d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0016.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAGTGGTACTCTGCGTCTCCCTTGACGTCGATGTATATCTAGTGGCCATGGTTGGTTTTCCGGTTTGGCACCTCGAAGTAGATAGGCAACATTCCAAAAGAGCGATACCACCGTTGCCGTGATTGGTTTTTTTCATCACATAAACGATAGAAGAGGTCAGACAACGCCCCAGCCGCCGTGTTTTGATTGGGCGCTTCAT"))
+(assert (= z "ucaauaggguaauau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2
new file mode 100644
index 000000000..54c9d111e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0017.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGGTTCATCTAGAAAGCCAAAACCCGCTCTCACTGCTTATCTTACTTCACAATGATAGGTGGCCGTCCGCGCGGTCGTTATCTGCATAGAGTAATCAGTAATTTTCGTGCCGTCACCGTCAGATCGTTACGATACCATTTAGGGCTTTTCGCCAGCTGAAAGCAGTTTGTGGGTCGGTATGTTTACGAATAGCTAGGAA"))
+(assert (= z "cacacgauuuuagac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2
new file mode 100644
index 000000000..3a4527bc9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0018.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAAACTTTTGCCATAAAAACCCACACGAGATAGAGAGCCGTAATAATATCAATAGCGTAGAGAGCCAAATATGGCTATGCGCATTGAGTTGGAAGGATCATGATCCAGAGATGTCCTTCAAACTTCGATTCTTCCGTTACCGAACTTGCCGTTCGTTTTATAATAAGTGAAATGCTCCTGCAGGTCGGTCATGTAGCATC"))
+(assert (= z "aaacagcauguuauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2
new file mode 100644
index 000000000..9a8aa41c5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0019.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGTGAGAAACCGTGTTATCGTCAGTGCCACCTCTCCCCAGACTCAGACGCAGTATTCATCCACCCCTGCGCAACTGAGGTTCGCAGATGCGTCACGCAGGCAGAAAACATCCCGGCGTGGTTTTAAACGTTGTGGAGGTCCTTAGGGGTCGTCGACGGTAATTCCGTTGTTGGACCTTTTACTCAAGAGGTCCTTTTAG"))
+(assert (= z "gaacuuucugccagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2
new file mode 100644
index 000000000..e28670970
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0020.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATAAAATGGTACGTCAACAAGGCTTAAACAGGTGTTTACCATTACTGCTCATAGGTGTGTTTGGGATATGCTAGTTTGCGGGAGTACTCTCGAGGCACTGCTTCTTCAAAGCCGTGGGATTGGTGAAAGATCGCCTGAGCCACCAGGTCAGCATTTAGATTTCTGTCTAGTTGAAGCAAGCCAAGCGACTCACCTATTG"))
+(assert (= z "aacaacgacgaggac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2
new file mode 100644
index 000000000..cc5520208
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0021.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATGAGCTCGACGCCTCCTACTTATTGTAACTCGTGGTTGGGCAGGATCAAATCGGGGTTTGCCCTCAGCTACTGCGGAAGAACTCTGCATGTGAGCGCGTGTCTCCCACATGTCTGCAAAAGCTAAATCCTTTTAGGGGTATTCAGTAAGTCGCCAAACGCTGCATAACGTGTGATTTAGAATTTCCCATGCATCGTGA"))
+(assert (= z "agacaucugaaucca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2
new file mode 100644
index 000000000..c6c6f217c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0022.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTGCTCCGACAGCTCATCGTTGACTCTGGGCTTCTGCAATCCACATGGGCGTCTGTGCAGTATGCTCTCGTGTTACGACTAGGACTAACCGTGGACGTTCCTGGGCTTTGTCGGTGACTGGATGCACGTATGAGGCTGTCATCTTGTCTGAATGAGTGCGTTTGTGGAGACTCAGCCACCAAAGTCCTCATGGGCACGT"))
+(assert (= z "gaaguggacaugugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2
new file mode 100644
index 000000000..aa3205166
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0023.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAAAAGCCACGCGGAAGATCTTTTAACATTGCATCTGGCAGGGTCCTGACTGTGGTTCGCAGAAACCGGATCTCGCGTCGCTTGCTCAGGCGGTCATACCGGAAGATACGTTTCCGACCACGCAAATGGTTCGGCGGTTTAACTGATCACTTGGCAAGGGCAAATCCCCCAGCTGATCTCGTAAAATGATTATATGACC"))
+(assert (= z "cacuacccauucaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2
new file mode 100644
index 000000000..fdc0954fd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0024.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCTGTAAGTCTGTAGTCCGAGGACAATACCCCTTCAGTGCAACGAAATTTAGCTATAGTGCAAATAATAAGCGGTCAATAACTGGTTTAGTCTCCTCGCCCTTGTGAAACCCTCAGGAGGTCAGTCGGCACACCGCTTGTTTAGGAGCATTGAGTTTACTCTTCGCCATAGGTGGATAGGCGATCATATTAAGGAGTTAA"))
+(assert (= z "uguaaguggggucac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2
new file mode 100644
index 000000000..fa3cfb893
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0025.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGTCAGAGATTATAATCTTCTTTTTGATGACCAGCGTAGTTGGTCAAATCAGGCACTCCACGGGGGACGGTTGTACACGGGGTCCGAAGATCCATACCAGACTGGTAATGAGCTGGGCTTCTAGAAGAATCAGGCGTCTTCATCACTCTTTCTCGTAGCGCTCGGAGATATTTTAGCAAGACGTGCATGTATCAAGTAC"))
+(assert (= z "cgcuugguuugcgcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2
new file mode 100644
index 000000000..6c9d0cda4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0026.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAGGGGCAGACACTTTTAGGAGTCAGACACGACGTTGCGATATGGACCGCACGTAGGGCGGCTATTGTTGTACCTTATCAGCTTACAGCCCGTCTCGTGCCGATAAGCATCTTACCAATCAGCGTCAACCACATTCTCCTAATGTGGAGCGCAAGTGTCAAGGTAACTCGCCAGGTGAGCCATGAAAGGGGAATGGGCT"))
+(assert (= z "gguaucgaucggcag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2
new file mode 100644
index 000000000..655ddc7f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0027.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACACTCACTATCGCTGGCATTCAAAATGCTGTTGACTTAGGAGTGTGGGGTCCACACCCGTGTGGCGAGACTCAGCGAAGCCTACAGATTTCTCCAAAAAATCAAAGGGTTACTGGTAGCGGTCCCGCAAACAGACGTCGTGACCCATCCTCGACGGGGCCCCGTCAGGTAGGTGCCAACCGACTCGGCTTTAGAGGGGT"))
+(assert (= z "gagguacuucucaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2
new file mode 100644
index 000000000..b2278d58a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0028.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCGGATCCCGTGCCAATCGAGTAAGTCCCATAATCACGGCTCATACCATATTGGCCGCAGCACCGACTTAGATTATCCTGTGAGGTTCAGGCTATCCATAGAATTAGCACTCCTGCGAACTTTCCCTACCGTTGGCCTTGTACGTCCGAGATTACAGCCGACCCAGTATAAGGCAGCTTCGACGTGATTTTTCAGCTTGC"))
+(assert (= z "gccugggacccagcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2
new file mode 100644
index 000000000..012abb522
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0029.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTTCCGCTCTCATGTACTAGCCAGATCCTCCAAGTAAAGCAGGCGGACGCATAAGAGGTAGCGGCGGCTTCTCTGTTCGTTATAGCCTAAGCACGTCCCTTCGAAGGCCGGGCTAGCCGTACTAAGGTCTGTGAACCAATAGGACGATGCTGCATTCGGCGGCAGGTTATAATGGCAAACACGGATGTGCACCTCGAGA"))
+(assert (= z "aggaguccuaauugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2
new file mode 100644
index 000000000..141e77bdd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0030.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACGAATCTTTATTACATGGCCAGTAGGATGGTGAGTTGCCCATCAGGGTAAATCGTATAAATGCTGGACGTGGTAACTCCGAGGTTTTACCCACTTCGACATTTAATGGGATATACTGCGGACGTCTAGTTATACTCCGGGGCTGGCGGTGTAATAGAGTGGGCCGGAATTTGACGTGTATAGCGGCACTCCCCAGGAG"))
+(assert (= z "cacgcgaagugguau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2
new file mode 100644
index 000000000..63cccb008
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0031.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGCCAACCCGAGCACCCCCTGAAGGAGTAAAAAAGCACAGTTATTCCACTGGCCACGGGCAGTAGTAGAAACTGCAGTTAAGGTCGGACTCTTTACTATTATCTGGGGGGCCGCACGCTCCCTTTGCAAGTACTTATTGTCTCAGGATCCTAAGAAATCCCCTTCGGGCAGCAGAAAGATAGCTCAAAGACACTACTTA"))
+(assert (= z "caagguccgguuguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2
new file mode 100644
index 000000000..05c4e5a96
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0032.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTTACAACTCAGGTGGATTTGTCAACATGCCCAAGCCGGTCAACAGGCGGTTCCGAGAAACGCCAGTGTGGAAAACTGTCGTGGGCGCCTCGATTGCCTCTATACTAGCCAATGGTGAATCTTCGAACATTACCCTCAACCAGTATGGAGCTTGTAGTTCAAAAAGTGTGGCGACCTAGGATTCGACGCGGCGAAAGTTT"))
+(assert (= z "gugaaaauuguacac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2
new file mode 100644
index 000000000..3399cb0d3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0033.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACACCTATATTTTAGCTAACCTATCTTCTAGTAGCTCAGTGGAGTTAACACTCAATGGACGTTCCAAATCGCAACGGTTTCGGTCTTGTTTTGCACCCCCTCAACATGTGTCGGGCTCCTCGGATCACAGTTTTTGTGATATGAACAGACTGTCCGTCATTCTCGATAATAGCACACGAAATGCCATGAACGCGCGTAT"))
+(assert (= z "auccuacugucguau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2
new file mode 100644
index 000000000..e02946ec9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0034.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACAATTTATGACTGATTTACTAGATAGTTGGAGTCAGATCACTGGTGAATTTCGGGTAAAACGTGCAGACGTGGAGTGTACCTTTCTACGCAGTCTACCTCGGGACGACCGTTGCCTTTATTTAATAAGCAATGAACATAGATCCCTATATTACACCTGTTCACGGGAAGCGTCCTCTTCATACAGCACCGGACTACAC"))
+(assert (= z "ggcucguacgaguag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2
new file mode 100644
index 000000000..5d9e25be9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0035.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAATAGAGCGTCTAAGCACATCACGGATGGATGGGCAGCATATTAAGGCTCAATCTGATTGCATCATGGAGCATCGCCGCTCCAAAACAATGCGGTTCTTAGAAGGTACAATGTTAGATATTTATGTGCGGTCAAAACTGCGCGACACGTTTCCGTGCTGATGATCCTCGTGTTGTATCACTTGTTATGTTAGGTCATT"))
+(assert (= z "augacccugcaagcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2
new file mode 100644
index 000000000..6dbe1b9f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0036.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATATGTGGATCCCCTTGATGATCCTTAGTTTTCTCAGCAACCACTGTCATTAATTTTGTATAGGAACCTGTAAAATTAACGTGCGCCAGGAATGTGCGTCACGCACTGGTAGCCGCCCACCGAAACAGCTCATTTCCGTGTTCTAGGGGTTCCTAGCGTTTCACGTGGAATACGGCTCGCCTCCGCGACAAAGCGAATG"))
+(assert (= z "gauuucgcaccaugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2
new file mode 100644
index 000000000..4345ce286
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0037.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGACCTTCGTTAGAGTAAAATTGATAACAGACCTCGCAGGCATGTCCCGATATGCAATGCAAAGGTGGTCTGGGGCGAGATGATAACGCTAGCTGAGGTCTCCAATCCTCAACGCATAGGCATGCCACATGCGTGATACGAAAGGGCCCGCCAATCATTCCAGGGCCATCGCTGACACACTGGGCACTGCGATTTGTTA"))
+(assert (= z "accuuuacggauugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2
new file mode 100644
index 000000000..b822331cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0038.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCGAAGCCTTATTAGGCGTGCAAAGTGATACCGAATAAAGGGTACCCCACAACATCCTAATCACGCCCAATACACTCGAGCTAGATGTTGATTGAGTTACGATCAGGACACATGCGATGGGCCACGTGGCAACCAGACTTTCGCACCGCACACCATTTTGGGTAGGATAACCGGAAACGTTATGACTAATTCCATGTAA"))
+(assert (= z "aguugucuaguccag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2
new file mode 100644
index 000000000..3e8544268
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0039.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAGGTTGCGGGATTCTCGACTCGTCCCCTGTGCAGCCAGAAATGAGTAGGTTGAAGCCATATCTCCTAGAGGTTCCCCTGAGCTAGATCGGTTTCCAGTTCGGGTGCGCCTACAATTACCCTACGAGGGGCGCAAAAGATCAGATCTGGTACACCAACCGTTACTGGTGTTCCCCAACTTGCTATACAGGCAGATCGTT"))
+(assert (= z "gcuauuucuuuucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2
new file mode 100644
index 000000000..515d79ee5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0040.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGAACGATGTTACTTGGTCGGCTACGGAGGTCCCCTCAACAGCGTCAAAAAAGAGAGACGAACGGCACCCACCGGTAATGCCCCGAAAAGGGAAGATCCACGAGATCCGAATCTGGAGATAGAATCTACCAATCATCGCAGCCTTTTCTAACTAGGGCATCGATCAAGGCCAAGTGAACTCACTCGGCCGGGATTGGCA"))
+(assert (= z "gggugcgaccacagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2
new file mode 100644
index 000000000..029e4d31a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0041.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATCTCTTGTTTCGCCTCGAAGTGAATAGTGGGAAAATCTTAAAGACACATACCAAGACTTATCCCTTAGGGTACGCTGTGAGATTCCCTGTTTCAAGGGTTGATTCAGCGCTCGAACAAACGAAGTCGCCACGCAGAGCATCACGAACAGGGGAATTTAGCTACGAGTCCTCAGATATTCGGATTAGATTTAACACGCAC"))
+(assert (= z "uucacacuacgcaau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2
new file mode 100644
index 000000000..24a05af6c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0042.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTACGTCAACCAGGCCGGTAGCGACGCTCGCGTCTTAATTGATCTGAACCAAAGTGCGGGTCCTACTATTTCGTGTGGTCCAAGTAGTAGCCTTTACGCATTCCAGTGGTTATTCCGGGCCATAAGAGGGCAGCGAGACAACCCTCAGGTTCTGGAGAGCGGAGTACAGCCTATTAGCTTACGACTATTAGCTCGCATCA"))
+(assert (= z "cuuuccaucuagcaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2
new file mode 100644
index 000000000..10d1041f5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0043.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATGTTGTCTTATACCACTCTAACTGACTGGTCCTCGTAACCCGTAGTGTTCATCCCTATGACCGCGCCGGTAAGACAAAGGGGTATTGATTCTCTTACCGCTGGTAGGTAAGCTGGCGTAACGGGACCGGCGCATGCGTAGACCTAGTATCCACTATAAGCTATTACGTCACCTGGGTTCGTGAGCGGATACATTACTA"))
+(assert (= z "gaaacgccucaccca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2
new file mode 100644
index 000000000..23ae5ae8b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0044.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGCAGAGTTTAGCACAGACTCGTAGAAATTGGTGACCTAAGGCGGATGGCTTTTTTTAAACCCCCTACGAAAATTCCCAACCTGTAGTGCAAAGGCGTTCCGACCGGGTTGAGAGAAAGCTGCGCATCTCGCTGGCAGACAAGAGTTTTCGATACCACTTATTTTATCATAACTACGCGACGCTCCGTGCGAGTGGGAG"))
+(assert (= z "uauugagagugucca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2
new file mode 100644
index 000000000..24532c825
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0045.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTGGGTAATATATTTGACCGGTGGTCCTCGAGTACATTAAGTTAAAAGAAGATTCAAGACCACTATGCCGAGACGAGAATGCAGCTTCAATTATCAGGTCTATACATTGACCCAAATCCTCGACCGTAACCCACTAGATATGCCGAGCTTATGAATTTTACGTTCATGCTCACGCGAAGGGAGTAAAGGTATACACCTC"))
+(assert (= z "aggacgaccgaaaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2
new file mode 100644
index 000000000..137f00cbf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0046.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGGATTCAGTACATCCCCGCTGGCACATTTGCCAGCTAAGGTTAACGAACTTGCTATACTTCGTCACTATAAATGAATTCACGGGTTCTCTTTTTATCCTCAAACATTTAAAGCCAGCAACCCCGCTGCAATCAAAGTCACGATTTCTTGCGCACATATTATGGGGCAGGAATAGGGTTTGGTGTGCACAACCATAACA"))
+(assert (= z "gggugcacgucuagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2
new file mode 100644
index 000000000..66c47a2f0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0047.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACAGTCTATCCAGCACGTTCCATTACTGAGGGTAGTTTCGTGAGAATTCCTGTTCACAGCGGGCACACGGAGTTAATCAACTACTCTCGCAGATGTACCCGTGCACAGGAAACTAACTTAAACATTTGTTGCTTTAGAGATACAGGCATGTTCCCTTCTCGTGCGGAAGTGACACCAACATAGGTGGCGCGGCCAACCT"))
+(assert (= z "ccgacguacuaugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2
new file mode 100644
index 000000000..2104fca1c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0048.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTACTAGCACCAGCCGTCCGTCCGTCGTTCCCAAGCTAATTACGTCAGACTCGACATCACGCACAACCAGTGGTAATAGCGTCAGGGGCCAAAGTATAGCGCGCATGATTTGCCGTTGCATAATTGGAGACAAACAGTACACGTACGTATCCTTGGGACCTGACGCGAAAATAGTGTTGCGCTTGCGCCAAGAAATGTCT"))
+(assert (= z "accagacucauauua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2
new file mode 100644
index 000000000..32cff766f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0049.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGACCCTCAGCTCCATCTGCCAACGCACGCGTCCATCATAGTTCCGTGTTCGCGCGTTGGATTCTTGACCGATACACTGGGGCGGGTGGTAACGTTCAACCATATCGACCACGAATACTTGGTGCAGACGTATGTATTTGACGTCATAACAACACCCTTGCGACTACCTTATGTAAAATCTTCACTAGCATTACCCACTA"))
+(assert (= z "accagagcacagccg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2
new file mode 100644
index 000000000..654233e83
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0050.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCAATTAATGAGCGCCCTCTTTACCCATGGTTACATTTTTACGATGTAAACCTAACGAAGGGCATAGACGGCTACCAGAAATTTGCCTAGGGCTGAGTGATACTTAGCGAATGACTCTGTTTCATCTTGATCAAGCCGGTGGACTACAGAAGCAAGCTATCCGGGTTACTCTGTCCCGTACAGAATGCAAACTAGTAAC"))
+(assert (= z "acuaaccagucgcgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2
new file mode 100644
index 000000000..a128244c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0051.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCAATCACTATGGTGAACCATCCGAAGCTTGAGTTGCGCAGCAGTCTCACCTGGAGGGAAAGAGTGAAACGCTACATAGAGCCAGTTCAGTGTGCCCATATACTTGATAACTGATAGGGCCCCTCGGGTGTCTCAATCACGAGATCGCTACACCAATCCCCGAGCCCCAACCTACGACACAGACTGATGTTGCTAGTCCC"))
+(assert (= z "gcuuauuaaugaucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2
new file mode 100644
index 000000000..cc9ceaf14
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0052.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGCTGAGGAATCGCGCCCGTCCCTCCCTGAAGCAGCCTTATAGGATTGTTGTCGCCACCTAGGTGATACTGTCTTGCCAGACTTCCCCTATCTTATCGTCTAGTAGATGAAGTCTTGATACCATACACAGTAAGCGGCTAGATGTCGCCTGCCTACCTCAAATATCTCACGACACAGGTGTCTGGGTGTGATATCCGAC"))
+(assert (= z "ggguaggaugcgugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2
new file mode 100644
index 000000000..7de680d27
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0053.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTACACGGAAATACCACCGTTTTTGAATTGCAACTCCTCGCGTATGCAATCACCCTTGAATGTGTCATCAAGCACAGATAAGGCGGCATAATTCATGAAGTGCGGTATCACCACCCGTTGGTTCTAAGCAACTCGCTGAACTTAGGGCGGGGAGAGACGAAACGGGGCATTGGCTTAAACAATTCAATAATAGCTTACGC"))
+(assert (= z "uguaugaggaacauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2
new file mode 100644
index 000000000..b0c9e619d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0054.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATTGTCGATGTCCCTCAAATAATAGCGTTAACAGAAACGTAGGTGCACACACGTTCGCGCCACCCTTAAACTCGAGTATTGCTGAAGTTCGCGCAGGTGAAGCTTAGTAGTCCTGGCAATCTGGTAGGGACAATCAGACAGTTCTGGTAATTAGACGAAGAATCCGCTGCGGCGGTATGTACCACACGTCCGTCCCACA"))
+(assert (= z "uaacaaugcgauacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2
new file mode 100644
index 000000000..9d1261aba
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0055.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAAAGCCTGTTTACGCTGGACGCGAGCGTTCGAGCAGCGTCATAACGGACTGGCCACGACATGGAGAGTCCCAGCCCTGGAGTGAATGATTGGCGACAACCAAATGCTTCCTGTCAACTGTGATACGGCATGCTCCGTGGCGTACCCAACAAACGCCTTAATTTTGGTTCTATAGTAGAATCGTAGTTGAATTACAGCGT"))
+(assert (= z "gcuuucgcggauaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2
new file mode 100644
index 000000000..a3351d815
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0056.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAGAATTGGTGTGATAAGCGGACGCTAACCGCTGTGTCAACTTCCCGCTCGGTGTGATATTAGCTCGTGCACCACCCAGTCGGGACGCACGCAGGCTCAGTCCGAAGCCTCCCAAACTCGATCTTTCTGCGTGCACCCCTTATGGCGCAGGTCTACTGTGGTGATGTGAATGTATTAGACGCCTATGTGGCTACGTATCT"))
+(assert (= z "acgcggacgugagga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2
new file mode 100644
index 000000000..565823848
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0057.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATATAGATTCCATACTCCGTAAGAACCTCTCGGCCGCGCATCATTCATCTGGGAGTACTGTAAAGCCACGGAACTTAATTCCCCCGCTTCAATCCTTGCTAAGGTGTATTCCCTATCGAAATGGGTGAAGCCGGCTTCATACGTACGTACAAAGCTTCCTATCACCGAGCTCAGACCTATTAAACTAAATGCAGAACCT"))
+(assert (= z "aagagugacuacccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2
new file mode 100644
index 000000000..71342d328
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0058.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCAAGAGCTTTGGAACGACAATGAAGTTCACGAGGGTGGCAATACCTTCCGAATTGCACAAGCTGTCGCTGCCTTGGCATGGATTTCCCACTCGACTATTGCCGCCGTTAAAATCGCCAGATCGATTGAGGCAGGTAACACTCAGAATAAGATCTCCAGTCGAGAGTCCTGCAAACGACATAGCTGTAACGACAAGCTCC"))
+(assert (= z "agaacaugugaugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2
new file mode 100644
index 000000000..6935d58ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0059.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCGTTCTCTCTTGGTTAATACCCAAACTCGCGCCGACGTAGAGCCCCGCTAGGGGGGCCACCATTCTGATCGATTGGGCTCGCGTGTGTGCTAAACCCAGTAGTTGACCCTATTTGCTGTGTATGCGTAGCTTAGGGTCGCTGTGTGTCATTCAGCAACTTCTCTGTCCCATGTCGAATATCCGCCAGGCTACCTGGGT"))
+(assert (= z "gucccccgcuuauua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2
new file mode 100644
index 000000000..81297de02
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0060.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCCCTAGTGGGAAACACACGGCCCGAAAAAAGAAGCGGTCTTTATCCATACACGGTGCTTTGCGTACCCGTTTAACATTGAAGCGCTCTCGCTTGCTAAGGAGTGCCCGCCCTTGTGCGCGGGTAAGTAGTTAGGGTTTCCGTTCAGATTCAGGCACAATTACATCGCCAGCGCCGTTGATCATTGCTTGGCTGGTTTTA"))
+(assert (= z "cuauaggcgcuucuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2
new file mode 100644
index 000000000..d39522e66
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0061.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCATAATACGGTTACGTGACCCTGTAACTCCTTAGGCCTGTCTAAACTTGAATAGAGTGCGTTAAGAGCCGAGCGGCGCCATAGTCGCGAGTGCCCGTATTAAGAACTACTTTAAGCTTTTTCAACGGAACTTTTCAGCGTTAGTCCAGTCCTTTAATTCACACACTCCGTTCGAACGAAGTGGCGCTCCGGGAATAAGT"))
+(assert (= z "ugggggagggcgacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2
new file mode 100644
index 000000000..4358b0766
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0062.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGATACTTGGAGCTGGCTACGACACTCGCCACATCCATCAAGCGGCACCCGATCACGGGTTGTGAAAAAACGTACCAACCATGCTTTAAAACCTAGGCGATTGGGTCTACAGCACACCGAGTCGATGAATATCGAGCTACCAATAAAAGGGGATACGGAGACAAAGAATTAAGGCCACACAGTTGGACGCGGCTTACATA"))
+(assert (= z "acggucuugacgagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2
new file mode 100644
index 000000000..2c80ce713
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0063.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGGTAGGGAGCATGTCGGCTGATCGTCTGCGCGTCTGTACGCCGAAGAGCTACAACGACCAGGTGTCAGGTCGATGCCAAAATGTTTTATGCTAGCCACGGAGTATGATCACCGGAAAGCAACTATTTCGATGTCTTCGGTCAGACGATAAGGTCCGCTTCCGGACCGTTTTTTAACTCTAATTTCCTGAAAGTATGAG"))
+(assert (= z "aggcguauaccggug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2
new file mode 100644
index 000000000..e23233da9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0064.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGATCGATTGCGGCTGATACAGTATCATCCTTGTCGAGGAGAAGATAGTTAAGTAATATACGCTGTCGAGGTCAGAAGACGCATAAAGACGGTCTTTCAGCTAGAGGAGATAGCAGGATGCTTCAACGGATACCGCGGCTAGACTCACCTGAGAGTAAACGAGACTACTTAGTAAACAGACTGAACGTATGGAAGTCGTG"))
+(assert (= z "cgcggcucgagaauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2
new file mode 100644
index 000000000..dd088b601
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0065.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGAATATAGGCGTGGGCATAACCTGGTATCCAAGGGCATAGAGAGTGGGGAGTCAACAACGCGGGCGCAATATTGTTTAAACCACCCCCGTGACGTCAGCGTTAGTTCGGTTCTCCCGCGCGCAGGATCGTTGTCCGTCCCGTAAGGAGTTATGCATCTCTCCTGCGGGGCCCCCCACGTCCGATTTGTTCCCATTGGA"))
+(assert (= z "acacuuuuugagaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2
new file mode 100644
index 000000000..16f96022c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0066.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAAGTGCGCGGCAATTATACCAATGTTTATGGGTCTCCCATATTCGAAGACTACGCATTAAAGCTCACGTTTCTTCCCAGATGTAACTCGTACCTTTGGTAGGGTCGGTTGTGTTATAATCGTGCAAAACAAAAAAGCACAAGATAAGTAACGCGGACCAACGGAATATCGCTAGCCCTTCGGTCGTGGCTTCCCTGCCA"))
+(assert (= z "caugcgagcucaugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2
new file mode 100644
index 000000000..b727644d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0067.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGCTCCTTAGTCAGTCTGTTCTTAAATAGACTTCGGCAATGATTACTCTCCGAGAGTTATTGTTGCCACTACATATCATCGGTGGCCACTTAACTGGTGTATCTGCGAGGCTTTCCACGACTTGATAAGGTAGCTGACCTAACCGTCTTTACCCTTCTAGACATGTTGGATTGTGCCCCCCGTTCCTGCTTCGGCCCGG"))
+(assert (= z "cggcuagacuuguca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2
new file mode 100644
index 000000000..68d1842a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0068.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCTTACACAAAGTGGAGAAGCAAATGGTCGCTCGGACAAGCCAGGCCCGATTCCAGTTTAGTCGGGGAACAACTTTCTTAATCAGGACGTCCCGTCATAACTGCCAATGTACTCATGTACAACACTGGTACCGGAAGCCGGCGGGATGAGCGCCCTCAGGCGCGGCTGCGTTAAGCTGTGCGTAGCCTTGCGGGTAATTC"))
+(assert (= z "gucuuuuauaaagua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2
new file mode 100644
index 000000000..182f96a78
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0069.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTTGTTGCCCCCTCTCCATACCCCCCCGACGTTGTAGAGACAAAGACCCGGACCGGCACCATCCCGTAAATCGTTTTCTGGACTGCCGTTGGCCTGCGATTTCTTAGAAATTAACATGTGAAGTCGGGGTAGAGGGTGTGCCAAGTACTGGCGCGACCCACGCTCGTGCCGCCATTTCAGACTAATTAGAGTTGGGACA"))
+(assert (= z "ccacggacuuccuug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2
new file mode 100644
index 000000000..5f84c11e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0070.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATCACAGACGGGGTAGTCACATGAGCCCAGCAGACGAGTGAATGTGACAATGATGCGGTCTCAACACTGGAGTTGGACGTTCTCATAAGAGGCGACACGCCGTACATGTATTGGCCCAATTTATCGAAAGAGGAACTACATTTAGAGTACGTCTTTCGGTTCTACACGCCTGAGTATTCCACGCCTTATGAGGGACGCA"))
+(assert (= z "gugcucggcucguag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2
new file mode 100644
index 000000000..3d70be08e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0071.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACTACGTGTTACTCTTACGCGCACAATGCAAGGTTCCGGTCGGAGATACCCAAGTGAGGATGTATGAATCCCCATGGTGTGATCCTCCAACCACGAATAGGCCCCGGCTTTCAGGTCATACAAGAATCTCTTGGCGACCCATAAACTATCGGTTTTGCAGGACTTTAGTGATCTAATATAATCTCGATAGCCACCAGCC"))
+(assert (= z "agaacccagugacug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2
new file mode 100644
index 000000000..ec56ae94d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0072.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCACCACGTGATTTCCCACTATCCTGCTCGTTCGATGATGCCAATCGCGTTATCTCTCACTGGAGAACTACCACAGCGTGCGTGCTGCGATGCGTCTGACGATATTTAGAGACACGCGTCTCAAACAGGACCGAGAGTCACCACCATTGGATGATTTCATTTTTAGGGTCTTGGGCACCGGGGGCGATAAGTGCTACTG"))
+(assert (= z "acgauggaaaugagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2
new file mode 100644
index 000000000..d2c90353a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0073.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAAAGTCTTATAGTGTGCGCCACAAATAACCAGTGCAAGCCCATAAACGATAGACCCGTTTCAAGGACACGAGAATCTGGCGAGCGGGTTAGAATATGACTCGGGGCCTACCGAAGAGGCCTTGTAGGGCCTGTCCTGGTCTCAGGGCGCCTCCTCATTCAAGGATAGGAGGCTCGTATCGATGTCTGCGTCGGTCTCGA"))
+(assert (= z "uguugauucuacguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2
new file mode 100644
index 000000000..04568e472
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0074.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTGTAGGATGGTACGATTTAGATGCCTTGGGTGTAGGGGGGTTCAAAGGAGAACGAGCAAGGAAGTCTACAAGAGAGTCGGTCGCGCCTTTATCATTATGGACTTTGTCGCCCGTGGGCCAGCATCCTGGCTCCGGATAACCCAAACTAACGGCTTGCAGATCGATGGTTATGGCCTGCTCGTTCGTTGATCCCTCTTG"))
+(assert (= z "gagcggggcuuaucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2
new file mode 100644
index 000000000..abb614a64
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0075.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATGGCCTCTCTCTCGAGGTCCGTGCGCCTCGAATATGTTTAAAATTGTGGTTTACCCGAACGTCAATTTAAGCCGAACCCCGCTTATCAAGGGCCACTACTACGTGACGGGTAAACAAACGATCCTCGCCTGAATATGCATCGTGCCCCGTACTTGTCGCACCGCCTGACATTATGGATGTAACCGCTATACACGATGC"))
+(assert (= z "aauguucccgaaaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2
new file mode 100644
index 000000000..d49ea8de5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0076.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTGCACTAGAGGGATCCATGTCGATTTTCTCCACTCCGGCGCACGGGGCTAGGATGTCTGCAGGATGAGTGCCTAATTCGGGTGTTTTCATATTTACGGGCTACCCCGTGCGAAGGGCCTCAACAAAATCCTCGGACGGATTTACTCGGAAGACAGTGTTCCTACAGGACGCTTGGACTTTGGACTCTTAATATTGGAG"))
+(assert (= z "uggacaaauacuccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2
new file mode 100644
index 000000000..8b3b45211
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0077.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCTCTACTCCGATCTACAACGCCCACAAGAATGGTGAGTCTAACTATACTCCGGCGCCTGCCCGTCACTGCCGAGCACCGTACCCGCGCAATCCTCGATAAACCTATTGCGGGAATGTAGTCAGGGATCTCGGCTGTTACTATGATTCGATAGATCATCAGTAGTGACAAGACGGGTTCGATAACGGAGCTCCGGGTCA"))
+(assert (= z "aucagaugaggggca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2
new file mode 100644
index 000000000..e2bb42b6f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0078.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAGAGCTCACGTCTTGTGGAAGACACTGCATATACGGCTCTAGCTAACCACGCGAATTCCGACATTTACAGCTCCCATATGAAAGATCACATCCCGTTCCAGAACTGGCTAGATTGTAATCATTTTATCGGGAGATGCTGGTATTCAAGCATGAGTACGTGGCATACCTCGAACGGAACTACAACTTTGAGTCACCGTT"))
+(assert (= z "uaaaaaguuacgcag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2
new file mode 100644
index 000000000..cc1b645dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0079.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCTAACCTTATGCGGTCACGATGGTAATAGAACTCGAACAAGCCTTGCGCCGCTGCGGGAGCCCATTAGTGCTCTTTACCTACGCTCGATTAGGCTTTCGGTACAGGCTTCCGGGATGTAAAAAAGACCTTTAGGTACGAAAGGGCTTAGCATCTACAGTACATTTTAGTAATCATACTGGCATGTGTAGCCGTAATGT"))
+(assert (= z "cuaucucgucgcucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2
new file mode 100644
index 000000000..4b6fb17f4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0080.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACCCAGCTTTGGGGATCGGACTTTAAATCGTAGAATCTGAAAGCGTAGCTGCCGCCGATGCTGACGGACACTTTATGCATTGGGTGCATGACGAGATTTGCCTGCTGTCGCATTAGTACACCAGTATACAGTAATACTCGAACCACATATTGAGAGAGTCGCATAGCGCCTGTTGGACCGGAAGGGTCCCCAGCCGCAA"))
+(assert (= z "gaggccucccacaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2
new file mode 100644
index 000000000..5f3033e36
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0081.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGTTTGTCCAAGGGACAGGATCAGTAGGTAACACTAAACAAAATGCGCCATTGATTTAAGCCCTTCCCATCTATACAAGGCAGACGTAAGCGTGAATTTTGAAAGATGTCCTTAATCCTACTCGCCGCCCAATGGCTCTAGCTTTCGCGTGCACCGACCCGCACTCTATTTCATTTTAACATCAGTCTACGGCGCATCC"))
+(assert (= z "ucuucaugggacuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2
new file mode 100644
index 000000000..f9d83c40f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0082.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACAGGGGACGGTTCTGGTGGCTCCTTGTGCGAAGACAAGTGTTCATCATACTCAACGGCATGTCTACATCTCCAGCTGAGATCAGAGGTGGCTAGGGAAGTCGCTACACCCGCCTCCCTTCCCGTTCTATTACAATTAGACTGAGCTGTTTGCCAACAGGCGCACTCGGGTGCTGACCTATGGATCCATTATGTAGTTA"))
+(assert (= z "ccaaaaaucacuagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2
new file mode 100644
index 000000000..0cc519dde
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0083.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACACTCAGAGCAACTACAATTAGGTACTGTCTAGTTCATCAGCCGAAGACCGATAACACCTTGAAGATAGGTAAGGTGTGTCTGAAAAGAGCTTTGATCATTTCAGGTATCTTGGTCTCGTTGTATTAGGGGACTACTATAAAATAATTGCCACCGGTCACTTACTACTTAGACACCATGTGGCTAAGAATGTTCGGGG"))
+(assert (= z "aucgcaaaggccagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2
new file mode 100644
index 000000000..4370be2a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0084.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGTAATACTAAATAACAAAGTTAAATGCGTGCAGCCACAAACCTTAAGTTTAGAATATATCCGGAGTTGCTCTGGACCTCACCATAAGGAGGTAAGTTAATACTGATCCGCCTGGTGAACGTCAAAACGCACTGAGCTATAACCGGAACTATGTGCCCCAGCTACCTTTGACGATGGTAGAGTGACTATCCCCCATTGTC"))
+(assert (= z "gccgugcuggcugau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2
new file mode 100644
index 000000000..696a01133
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0085.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTATGAGTGTAGATAGTTTACACATAACTTTGGACAATGGTTTGGACGGAACATCACGAGAAGGGGGTTACATTGATCACTGCCTATTCGTTATGTTAGCACTGCGGGCAAAACAGCCTGCCTAGAGGACAGGGCATAAACGGAGCTTGTGCGTTCTAGGTGAATTACGCTGCCGTCTTCTAAGAAAGAGCTTGCTGGT"))
+(assert (= z "gggaguugguugacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2
new file mode 100644
index 000000000..153f59102
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0086.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGATTATGTTGTTACATCACGCTCCCAACATATTCCCTCGGCCACATCATGCATTGAGAGCTATGCTCAGCTTATACCGGGAAGCGGCAAGCTCCTCCCGAAGGGAAGGATACCCTCTTAGCCTCCGTCAATTTTTCGCTGATTCCAAGAGGTGACAGAGAACTCCGTAGCGCTTAACAGTCTGGAAGAGCTTGAAAAG"))
+(assert (= z "uaauccaaucgagcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2
new file mode 100644
index 000000000..860b1e213
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0087.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCAAGCTCCAGCGGAGAGACGGGGGGGCCTACGCAAAAACCACGAGAGTTACACGCATGCATGTTTCCATTTACCCGGTGTGGTCTATCACCTTGGATTGGCGATTAAAAGTCGCTTATTTTTACGCAACTAGATTTCCATCCCTGGACGGCCAAAATGATATTATGGCAGGTGCGGCAATATGGGGCCATGCTCAGAG"))
+(assert (= z "cuguaaugauacacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2
new file mode 100644
index 000000000..351e5f5bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0088.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCAGCGGTTGGCCCAGTGCTACGACATTGAGAGACATAACGGACGGACAAAAGTCCAACACAGCCATTCGCGTTCGGTGGGGTGAATCCCTTACAGCTGAGCAGAACTTACATCAGTCCTAAGATCGTACGTTTTCATTACCCTTTTGTGTTCCATGGGTACGGTGGTGATTGACTTCCTCGTACTGTGTGAAAATCAG"))
+(assert (= z "aaaaauagccacguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2
new file mode 100644
index 000000000..41944cca2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0089.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTCCATCAGTACCAGCAAAGGAAACTACGTAGGGGGTCTGCTGGTCTAAAGTCTCGGTTATATGTAACGAGTCCGCAGGTTGGTCCAATCGCAGAGCCTCCTTTTGCGTCCTTGGGATATCGCCAAGACCCAGGTCTGTTGATAGCTATGACCAGTATCCGGTTACGAGAGCCTTTATCTGGAGGCTACAGTAATAGAA"))
+(assert (= z "ggaagggccguguag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2
new file mode 100644
index 000000000..e48053b46
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0090.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTTTGTTAACAGCAAACATAGTCTACAACACAGCATCTATATCCGTCACCTACGCGAAGCGTCAGTGGGTCAGAAGCGACCGGACGCTGGCCCGTTCCCGTGTGGGGATCGTCTTCTACGCCGAGGAATCCACTTAACAGCACGCGGGCTCCCTCAGCACCTTTTACTACATGAAAGAGATGACGGCTAGCGTGTTGTT"))
+(assert (= z "aguacucucagugac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2
new file mode 100644
index 000000000..b9292ce14
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0091.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCAGTACCGAAATTTGATCAATGAAAAACGAGCTTGGCTAGCAAGACAGCCCACCGATTCTCGAGTCCATCCGTGACAAGCCGGGCTACAGAGGGTTGGGACCATGGTGGGACCGATCACTCCGCTCAAGGAAAAGGTAGACTAGTTGCGCTATGTCCAAGGTCGAAAACCGGGGAGTCAACACATTATCCGGTGCTA"))
+(assert (= z "ggucucuggccacgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2
new file mode 100644
index 000000000..1d4cf9408
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0092.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCCGCACAGTTGCTGTTGTGTTTACATTATATCACACGCAAGATTTAGTTGATACCTCGACTAAATAGCGCGCTACCGAGGCGATCTCGAGACTCGTGAGCTCCTAATGCGATTTTGAGTCACTAGAATGCCGAAGTATAGGTGCTGAGACATCCGATAACGGTGACTAACGTCCTCATTTATTTTCAATCCTTCCGGTA"))
+(assert (= z "acacauggaccacuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2
new file mode 100644
index 000000000..14e315ad6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0093.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAGCACTGAAACACAACCCCTGGGTCGGCGCGTGCCGGGCGAACGCTGGACGGCGTCGGTAGAGTCAGGTTCAACCAGATTAATTCTTGGGGCAACGGCCCGAATGAATAGAACCAAGCTAGCGTCACGGTTGCAGGTGGCCGCTGAAGAAGGCTTACGGCCGAACTTATCTTACCGTGGATCCATCAAATGCCGTCCC"))
+(assert (= z "uuguuauuuagauca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2
new file mode 100644
index 000000000..e1cf0ea72
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0094.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATCGGAGAATGTGTCGAATATTCAAATCCCCGAATAGAATGAAGTAGCGTTCACGATGCGGCAACCTGTGCTCAACGTTTCCCCGGCAGCCCCCTTACGGTGTAAGATTGTCTTAGATTTGTCATGTGCGATACGGAATTGATTTTGCTCGGGTAAGCGCGCTTGTGTGCGAGTCCTAAGGTTAGGGAAAGGAGGTTTTT"))
+(assert (= z "accaugugaguccca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2
new file mode 100644
index 000000000..3d2c4e093
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0095.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CATCACGCTTAATTCTTATCTGAGCCTACAACGGTTCGGTTCCGTGGAGTTTTGTTTGCTAAAACCAGATACGGTCGCGTAGTTTCGCTCGGAAGCCGTCTTTCCTGCGTTGCGCTTGATGGAGAGTTGTGCGACATACCTAAGCCTGATAGAAAACTTAGGGACGAGCTTGCGCATGTGAGTCCGGGTACGCGAGCTCG"))
+(assert (= z "gaccgauuacaacug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2
new file mode 100644
index 000000000..f73030d75
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0096.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTAGCCGACTCCGTATTTAGAATCGTGATCATTGTCATAAGGCGAGATAGATATACGTAACCCCGCCAAACATTGCGGTATGCGAGGTACAAAGCACCTATGTTTTGGCATCCCGCGTTCGAGCTATCGAGAGATAAGGAGTTTCGTCGTTATCCGGAATCATACAGAGCGTACCGTCCGCAACTTAACAAGATGTTTT"))
+(assert (= z "gaggcuccuauccgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2
new file mode 100644
index 000000000..61d273eef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0097.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGTGTTTACCACAACAAGTAGGCACCAGGAGTACATTCCAGACAAGCCAAAATGGTAGTACTGGGGTTCGGGGTCCTGAGTTTCTCAACTCGTGAGGGCGTAGCGGGGGAGTTAGCTATAGCACTACCTGGGGTTCTACTACGACTGGACCCATGTAGAGGAGTCTCCCACAAAATCCCACAACTAACGAATTAGCCTCG"))
+(assert (= z "ggcagcuguuuagcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2
new file mode 100644
index 000000000..8cec5d563
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0098.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGTTAAAGTCATTCGAGTTTGAAATCGCTGAACAGTGCAAGAATCCACTCCCAGTTAGTTTGCGCACGCTCCGGATCTCCATTCTACATATTATTGCGACTGATTCGTGGTAGATGGTCTCGCCAGCCTCGTACATTGCTGCCCTGAGTAGCACTAGCCGTGCCATACCATTCCATAATATCTTGGATGTCATGGCATG"))
+(assert (= z "ccucguauuugggau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2
new file mode 100644
index 000000000..3cbeb0031
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0099.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGCGGCCTTATACGTAGGATATTCATGTGGATAAAAGGGGTTGCATATTATTATGTCTTGGTCTGGGCACATGGATGCGACCCGAACGATCCTTTACAAGTTCAAGACCGAAGCGGTACATTAAAGTCCCGGCCGGGGTCCAAAATTGACAAGAGGCAGCCCGCAGACATAGACTGCGCCCGGGCAACGATTGAGAGGC"))
+(assert (= z "agacgguucacgcac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2
new file mode 100644
index 000000000..27574e1de
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0100.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTTAAGGCTAAAAGCGCTATTCTAATAATATATCTTCTATATCCGAGTTCTTTCCTCATATGTCGGGCTGTTCGTGTCAGCTGGAATCAAACGAAACCAGTGTAAGTCGGAACGACTACGCCAATCATTGATAGCCCTATCTCCATTATCCTTAAATGTGTATGCATATCTCATCCCCCTCTTGATCAAGGTGGTGTAT"))
+(assert (= z "ucauccaucuugcgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2
new file mode 100644
index 000000000..31fb14690
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0101.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGTGACAGACGCCTGCTGCCATAAGGCGCTATCACATGCGTGGCTAGAGGTGGGACTAGAATTTGTCTCCGTGAGTGTGGCTGGCAATCATGACTGACCTTCCGGGACGATGGAAACGTTTGACGTCCGCAGGGCAACATAGCCAACTGTTCCGCAGAACCAAGAACACCGATATAGTCTAAAATTGAAGCATGTTCGT"))
+(assert (= z "uguggucaaccgggg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2
new file mode 100644
index 000000000..052554405
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0102.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTGGGTTGATGACAATTTACTAGTGCACTGGACTACCGAGAAGAAGTAGCTTTGTCAGAATTATCTCGCCAAGGAGAGGACACCCGTTAATGGCAGTTCACATCGTACAAGGTCAGTACGGCAGTACTATGTGGGCGAGGGAGAAGCTCGAAAAAGTCACTAAGCAAAGACAAGCCTGGCAGTGGTCGTCACGGTCAATT"))
+(assert (= z "agggccgcgcgacau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2
new file mode 100644
index 000000000..692d78a5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0103.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCCCCGAGGCTGCGTGTTGTCAGTATGCAGCTCCCTCAGTCCGTCATTTCAGAACTAGCCCTAAGAATTAACTTAACGGTGCCGACTGAGTCGATGGCAGGGGAATCTGACCGAGGCCGGCATACGCGATACATCGCCACGTAGAGACGTTGGCAGCGACACTTTGAGACGATTAAGATTACCGAGGATTGCTTCACCCC"))
+(assert (= z "auaagugaggagagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2
new file mode 100644
index 000000000..499551b89
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0104.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACCTAGACCGGGTAGCCAGCGTCGTGCTTCCCGTTATACGAGGTGTAGGACGAGATGTTCAGATAATATAGGAGGAGCTCCGTGTCTGAGTTAGATGACCCAGGTATTATCTTATTTCCGACACCTGGTGCGGCCGGAGGGAGCAACATGCAAACACTTAAGTCGATGTCCAAGCCGGGCAGAAGTATGTTGCATAAAG"))
+(assert (= z "gucucaggacuacgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2
new file mode 100644
index 000000000..4edca381d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0105.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCGTGGAATTCTCTGTTTAATTGTACCCCACGGATGATGTAATTTGGGCTAGTATGCGTTTACGTCGTACTCGGAACGCCTGCTCCCTGCGGACGTACGAGCGGCCGGGAGGTGGCCTAAAACTCATAGGACCCGGCCACTAACATTCCAGGCCGGGGCACACCTGGCTCTTAACCAATAGGAACTTTGTATGGATTAGC"))
+(assert (= z "aacauauguccgcug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2
new file mode 100644
index 000000000..da30d600d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0106.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGTTTGCACGACTCTTAAACCGGCGACGGTCCAGAATGGCTACAACATCCCAACTGGGGTATATTGAAGTAGTATTCCTCTTAAGCGATGGACAGCCCTAACGCATAGGACGGCAGCCTGACGTTAAAACTGGCTTAACAGTAGGGGCGCTATGGCATTTTTCTAAAGGCTACTGTACCGACGGCGCACTGAATTTATG"))
+(assert (= z "ggccauguuacugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2
new file mode 100644
index 000000000..92b46bbd8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0107.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGAGGACATTCAGAGTGGGGCGGTAATCGGATTATGCAGGGCTTGTATAGCGAAGCCTTACGTATTCGTTTTAAGTTACTAGCCGGGGTTCGGCTTTATCGAATCAAAGACCGCGATCAAAACTTGCTGAACGGCACAGTCAAGATATGCCCCGGTCCTGTAATCAACGGATGCGATAAACAGCGAGACGACTTGGCGG"))
+(assert (= z "uauaauaaaacgacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2
new file mode 100644
index 000000000..d304aa9a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0108.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACAACCGAAGTTGATCTCCAGGGATGTGTAGATATACTGGTGGTAAAAGTCATCCTTCGGTGCGCTCAACGCGCGCATCACCTGAATTTCGGGTCGGTAAAACTCATCAGGCAGTATCCGGTGAATCAAGCGGAGAGCGTCTTCTTCTAAGATCATCCCTTCACGTACGCAAACTGTTACAACTTGAACCAGGCGTAAT"))
+(assert (= z "uaggugguagaaaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2
new file mode 100644
index 000000000..dea6ef9d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0109.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGTCAGCACCTTTGTTCCGTGCTACGATTGGGGGGGCTTATTCTTATTATAGTTCACTCTACTTAACATCCGACATATAGATCGGTAGAAACGAGGGGTGACGGCCGTACCTTTACCTCCGGACCCTATGCGAGTCGCAGTTCACCTCGCTTGCTGATACCATGACACAGAACTGGTTTATAACGCTTTTCGATAGATG"))
+(assert (= z "gaacaacgaucccug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2
new file mode 100644
index 000000000..45626be1b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0110.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCACAGCAGTGATTTCAAGAAGGTGTTCCCTGGTCTGGACACCTGTTATTACTTAACTCTGTGGACTTAACGTCGGTTGGCTTTGCGCACAGACTCTGGTGTGCCCGGGGAGACCCTATCCAGGGACACTCATGAGACCAACAGACGGGCTGCTCAAACGAACACCGGCTGATAACAAGTCTCAGGTATCTGCTGACAC"))
+(assert (= z "ugccacaugcugcca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2
new file mode 100644
index 000000000..f360a7559
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0111.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGTGGCCTCAGGTAAAAGCCCCATAATCTGAGTGCGCTCGCTACCAGCAGTCTTTAAGCCTACCAACATCCCGTACTGGCTTTAAGGTATGGTCTGCATGCATATGTTTAGTTGAAATAGACCTACGGATAGTTGACGTGCCGCTAAAAATGCCGCTAGTCTAGCGATGAGAGAAATGATGGCAATGGGACGGCATATA"))
+(assert (= z "accuuuccaugcgga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2
new file mode 100644
index 000000000..640aeb97f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0112.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGGGTATATTACCATCTACAGTGCTTGCATGTGCGTGCTATCTCTGCTTCCCGGCCTGTTGCGGGATTGCCTTCTAGAAAATGAGAGGGCAAGCAGCACGGGCTTGTTGGCACATTTAGGCCCGTGTTAGGGGTACCAGAGTGAACAAGTATTCGGTAATATAACCTGCGTAGGCCGATCTAACAAATGTGTGTACGGC"))
+(assert (= z "ggccuguuuuucgcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2
new file mode 100644
index 000000000..146a2df40
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0113.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCCTCAATATATTTACTAATCACCAGGGAGGGCGGTGGCTAAGTGCATCTCTTCTGTCGCCAAATAGGAGGTTGCTTCTTACGTCACGCGGAGCGCGTCGGCCATAGAACCAGGTGGCAAGGGCCATGGGTACTATATCGTCGTAAACTTGACCTGGTTATGTCGGATTCAATCACGGTTCTCCGTAAAACGTGGCGCA"))
+(assert (= z "agugggagagacgcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2
new file mode 100644
index 000000000..1ebd3a4b7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0114.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGTAGGCAACTACCCATTTCGTCGGACAAGAGCGTGCGAGTGCCTATGCGGGCAAATTACGTCCAGCCCACGGCCAACGCAAGGAGTGTGGGCTCATCGCAGAACTATCACTCGGGGACTCAACGTAGCGAAGATGCTCATCAGCAGGAGCGTTACCCTTACAAGGACCTACGACGTGATTACCCGTTTAGGCGCCTAC"))
+(assert (= z "auugccgauuacuag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2
new file mode 100644
index 000000000..c5d424e46
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0115.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTACGAGGGGAGCAGTATCAAGTCTTCTCGGCCCGTAAGTCCTATACCGAACAAGCGTCAAAATGCGCAGCTGCGTGTATGATGAAGGACAGTGTTCCCATCATCAGTAGCTACCATGCTCAATGAAATTCCTCTTACTTAGTGTGGCGGGTGCGATGCAATGCCTTACTAGTAACACAAAACAGCTCATATCGCTGCGC"))
+(assert (= z "guugcggaugagaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2
new file mode 100644
index 000000000..62ce6bf34
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0116.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGTTGCCCCAACGTCCCTCACGGATCTGGTGGTTCAATGAGTCCGCGTGACTTCCATGCGCTCGTCACGGCCCCCTATGCTGGTGGACACGCTGTCAGGTTACGACTCCAAAGCGAAGACGCTTGCATTACTCCCCGATCTCAACCATGCCAGAGCCAGCACACGTAAAATCCCGGTCCTTTCGGCTCATAGTCATGAC"))
+(assert (= z "caugucgguauucgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2
new file mode 100644
index 000000000..7e1db0125
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0117.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGAGCGTGTGGTTAACGAGACGAACGAGGAACGCGCGGAGGGATTCGGTGTGGTGATGCTCAGATAAGTACCTAGGGATTAAGCGCGAACCTGCATGACTTACATCGTGTAATTAGTTCGTTCCTCTCCGTAGCTCCACTCTATACCCTCAGCCGGCGGTTCAGTACAGGCATGTCTTGTTCGTCCGTCATACTGAGGCG"))
+(assert (= z "ccagggcgauacauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2
new file mode 100644
index 000000000..5a2466e08
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0118.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGCATGTGACGCGAGATTTCCCTGTCAAGATCCACTGTGTGACCTGGGCAGAGGAGTTTGGAAGGGACGATGACCTTGGATCTCCCGGTCATTCCTTTTTGTAAAACACACATAATATTACAACTACGGGGACGTTAAGTTTAAAAACAAGCACTGCATGGCCAGTAAGATGTGGTAGGCCCCATTTAAATCAAGCGCT"))
+(assert (= z "acguugaggcgaauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2
new file mode 100644
index 000000000..9295d0d54
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0119.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGACAGCCGGGTCACCCGGTACCCTTGCCCCATGACAGGAAAATCTGAAAACTTTATCTTTCTTGCGAGTTACATTATCAAAACGTCGTCAGGGATCTGCATCCTAATCTGGGAGGCCTTACATGCACGATGCCCGAATCCATTTCATTAATGATACACGGAGAACGCCTGGAAAGAAAAGAGTACCGCATACATGGGCA"))
+(assert (= z "agccgcuauagucaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2
new file mode 100644
index 000000000..f56b44142
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0120.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACTAATTAAAGAGCTACGCGTACCCGTGAGAGAGTCGTAACTCAAAGATACACGGATGGTCCTCCCGGTGTTTCATGGAATGGAATAGGCGTGTGTTGTTCCGAAGATCGTGGAACGAGCATGACTACACTCTCATTCTCCATCAGTGGGAAGCACGTACATTACGTAAACATTCAACCGCTAACAGTACTTCGCCCTC"))
+(assert (= z "uugaucgcagggcua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2
new file mode 100644
index 000000000..e296a4df7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0121.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCAGCGCCTGCCGCGTTCTGAAGAGACCTGCGAATATCACATACTGGAGTTCATAAGCGGACCGTGTGACTTTCGAAGCTGATATATTATCGTGAGTTGCATACCGACGATGTACCGTAGAACTCTCGGAAACCCCGCATAAGAAAGAAACCGCGCATTCGCTAGAAAAAATACGGTTAGTGGCCTGAGGCATGGTTTCT"))
+(assert (= z "gauagauccguaaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2
new file mode 100644
index 000000000..003d9ab06
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0122.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCAAGGAAGAACCGCCTGGCAGCAGGGCGGCTAAAAGGTAAACCGACCCCTATGTAGGGTTACGCCACAAGGGGCGAGTCTGTGCGTCTAAGGATGTGTTTTAAGGGACACCAAGCGACGGTCGTCGTGGGCTGTAATGTAACGGATACAAGCCGACCCATCGACTTAGGTGCGGATACGACCTCAAAGATGCCTTTAAC"))
+(assert (= z "caccgccgcaaucga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2
new file mode 100644
index 000000000..b55684c85
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0123.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACAACGGATGAATTCGGATAAGGAAGCCAAAGCCATCAAACTACGTAGATATCACATTAACTTCCCTCCAACCTTGACACTTTCGGTCAGGCCATCAGATGAACGGCTCCGCGTCACCCTTAGATGTTTTCTAGTAAATGTTATCTTCGAGCGGAGCCAAAAAGCTCTGCATATTTTCTTCGGTTATCCCGGACTTTCA"))
+(assert (= z "gaccgcaaaagucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2
new file mode 100644
index 000000000..573c9c44a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0124.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAAACCTCAATGCCCTCGATGTCCCGGAATTTGAAAAGAACCGATGTAAGAAGGGACGATGCGAACTCGTGTAGTGCGCGACTTCAGTCTTGGGGCTCTGCGTCTCCAGCGGTTGACGTACCAACGCCTTCACCTAGATTTAAATGAAAAGATCCAGTGCGGAAAACCACTTCCTCCCATAAAGAACGATCGAATTTACA"))
+(assert (= z "cauacuggucagacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2
new file mode 100644
index 000000000..3314fe77c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0125.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCGCCAGGCGTACGCGATTTGGATAGAACATGACGCTCAGCCCCCGATTCGCATCTGGGACGCAGAATGTTGTGTCCTAGCTCACGTTGGGAACCCCAGGCAGACGACACCCGCAGGCATATCGCCGCGTTGTCACAATAAGGGTTGCCCCGTTAATTGTCTTTTAACCTTGCACTACCGTACATGCACTCGACAAAGG"))
+(assert (= z "uauuagcgugauuug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2
new file mode 100644
index 000000000..7472286e7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0126.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CATCCTCCTATTAGTAGTGTACTAAGGACCACTTTATCGTTTGCTTTGATGCGGATAACTTATGCCGCACCTAAGTCCACCACTAACTCCATGAGAGTACCATAGGCTAATCTTCACCTGAGGAGCGTTAAATGTGTGGACAACTTGCACGCAAACACAGTGGCTCTCTTACCTTGCTTACTGGCATGAATCGGAGAGCG"))
+(assert (= z "cgcuucaacugaaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2
new file mode 100644
index 000000000..170959752
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0127.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGGGCCTGGAGCGTTTGAACCCTGTAGAAGCGCTGCGTTGAGGACAACCTACTGTTTTATTTGGTGGGTAGGATCGTTGCGGGGCATATGGCCGACACACGTGACCAAGAACAAACGGACGGTGCGCAGTCCTTAAAATGTGTTAATGGGGGTTCGAACCTTATGGCGGACACGGATGTGGTGCGGTAGAGTTATTTGT"))
+(assert (= z "uaaggggacgaacac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2
new file mode 100644
index 000000000..ab67649c6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0128.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTAGCCGTTACTGGTACATCGATTTCACACGCCCCGTGAAGGAGCGATGTTTCCGGCGTTCTACTGATTGCTACACGCGTCTTCTCAGAGGTTGTGAACTTGATTATAGGCATAGGCGCAGCGTCATAGACGCACGCGGGGAGAAACGCATTTATGCTGTTGTCAGTGACGGCGGTTGAACCGTGGATAAACTTTTTGG"))
+(assert (= z "acgggcuagucuugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2
new file mode 100644
index 000000000..cc89b41f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0129.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCCAATGATAGCGACACGATTATGAAAATCCTATAATTTTGATCGAACGCACAAGGGTGCCCGCTGGCTACACTTTATAATGCTATCACAAGTGAAGGTCGTAAATTATTTGAGCACACAGCAGCGTTCTTGCACGGCTTCGTTCACGAGCCCACCTCGCTAGTCGATGACATGTAATTGATGATTGCGCCCCGCAGAA"))
+(assert (= z "caacuuaucugcccg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2
new file mode 100644
index 000000000..78b8ddcc8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0130.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTAACGTTAAATAACAACTATAATATTAGGATCACTGAAATTGTGGCCAATTTCTATCGAGCGTAGGGGGAATGCAAGTAATCCATTCTACATATATCGCGAAAAACCTAAACCTCACTTCGTTACCAGTGATGAACTGGGATCACTCGATAAACGGAGCGCATGCATATTGCGTACGCTCCTAGAGATTAACAGCCC"))
+(assert (= z "acagacgacucagaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2
new file mode 100644
index 000000000..dc371c37e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0131.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGATTGCGTCAGTTCTCCGCAGGTTCAGGTGGAGCTGAGAGGTTTCGAGTTTCGACCCGTTCGTAGCCCGTTCTAGACTGCTTGACTACCGTTGGAGGGTGGGTGCACGCTGATGAAACGAGCCTGTCTAAATTGACCTTAAACGGATATAACAAAAGATTCGTGTCTCTTAAAGAGGGTGATGAGAATCTACTCTTCA"))
+(assert (= z "agguguguagaccuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2
new file mode 100644
index 000000000..eacf90e35
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0132.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATGACATTTTCATAGCGGTATTGCGTGTTCCAATTATAGATCGCCATCCAACTGCTATAATATCATACAGCTATTCTGGTTGGAGCAGCAATGAATAAACGCTAATTCCCGGCGAGCTATGGCGTGGCCGAAACCAAGCCGACAGGGGTAAGCCATGGGCTTAAGGCTTCAGGTAGTGTCGTCAGGAATACAACGTAATA"))
+(assert (= z "aggaggucgcaacga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2
new file mode 100644
index 000000000..e114a7249
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0133.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGTGTTTATATCTATGTGTGCGTATGCCATGATGTATCCTATAATTTGAATTCCGCCTTATCTCTCCCGTTGATAGGCGTGTCCTGCCGAAGTATTGTTCAGAACGCTCTGGGGCGAAGAAAGGTGTACGCCGCTATCTTTGAGCGTCTACGCGTGTTTCTCCATATGCGTGCGTTTCCGTTTCCAGGTCATCCGGGGT"))
+(assert (= z "uuuccucgccggauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2
new file mode 100644
index 000000000..93f522ed3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0134.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGACGGAAGATCCTCGTAAGCCCTCGCTATCGAAACGCTCTCATTGCTGCAGTTGCACAAGTAGTGGATGGAGATCTATTTACGACAGCAAGACCTTATAGCAGGTACATTTCAGTGTGCAGCTTCCATAAGTTACTGCAATGGTGTTATACGCTTGCACCGAATTGGCATGGACACCTCTCCCTAGACGATTTTGTCA"))
+(assert (= z "gguacgagacuauaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2
new file mode 100644
index 000000000..d9943a3ee
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0135.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTAAAGCCCTACGGCAAACCTCTGACCAACCCACAATACCTAGAATCTAGTCTCCCCGCGCGCTTCTTCCCATGCCTAGGTGAAAAATAATTGAGCATACCTGGTTGGCCAGCCTCATGCGGTTACGCAGTTATCTTGTTTGGCAAACGAGACCTGGTTGGATTCCGTGAACAAATCTGCTGAAACATAAGCTATTGG"))
+(assert (= z "ucccggcgccaucgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2
new file mode 100644
index 000000000..e35ba4919
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0136.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAACAAACTGGCTCCAATAGGCGCCAGACTATTAAATTAACAGCCCCGCGAGAACGGGGATTGGGAATGAAGCTTAGGCTAGTATCTGGGTGTGGGACATTCCGGCCTCAGATTCCAAAATTTATAGGTAGCCAGGTTGTGAAGTTGGGCCAGGAACGACCGACGGAGTCTGTAAGCCAATGTTCACCGTGTGATCCTAC"))
+(assert (= z "ggucuaaggccgugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2
new file mode 100644
index 000000000..4a5ada3c8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0137.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCTACTTGGAAATTTACGTGGTGAGCACAAACTGTCTTAAGTATAAGAACAGTGATATCGGAATCCGTAACTAAAAGTCAGTTATCGATCGGTCCCTCGAAGTATCTCTCTGGATGGCAGCACTGGACACAACGACCGTGTGTGGGCCACCATCCGCGCCCGTCGCTGAGTTTAGCATTCTCGAGAAGCGAGTGCTTCT"))
+(assert (= z "aaccgguagcgcacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2
new file mode 100644
index 000000000..4e40c774b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0138.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCTAGCCCCCGCTCGTCGTCCACGATGCCTTTCTCCTACCCCTTTCCACTGAACGCCTCCCTTAGTTGGCTGTGACATGGTGACTCGGGGAATACCCACTCTAGGAGCGTTAGACGCTGCGTCCGCGATTTGAGAGTTCATGGGCACGTGTAGACCATAATAAGTAACTAAGCCAGGCACAATATCTGCCGTCACTAGC"))
+(assert (= z "cugccgauaagauga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2
new file mode 100644
index 000000000..187e29e89
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0139.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCTATCTGAATTAACCTCTAAAAACTTTCATACCTTAGAGGGGTGCTAGCGTAGCACGCTGAGTGCCTGTTCGTGCTGTTGGCTTGAGCAAACAGGCGTCCACAATATCGACGAATCGGCTTTCGAAGTCGTCACATGAAACCTTGGGCATGTTGAGGTGTGGCCTTGTCCCCCGAAACAACCGTTCGCCCTGCTGATC"))
+(assert (= z "uucaguugcauccua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2
new file mode 100644
index 000000000..507c9d7e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0140.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTGAAGGCACTTTGTCATCATCGAACCATGTGAGTTACACTATAGACCAACCGATTGGTGTTCCGGCGCTGAATATCGAGTCGCGACCTGCAGTTTCCTATGTATTTGGGAACCTCTAGGTTATCGTGAAGCGGTGATCTCCTCCGTCCACGAGCATCGTATACTAATGTTTCTAAAAAGCGTGGCAGGAGGCAGTTAT"))
+(assert (= z "uagggcaaugaauga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2
new file mode 100644
index 000000000..bfe90ff80
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0141.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAGCACAATAAGGTGACGTGTATATCATTCCGCTCGGTGATCTTTGCGACTGGTCACCTAATCTCCGGGAAGTCGAGATCTTCTTCTCCACCTCGTAGGTAAAATCTTGGCGATCGAAGCTCGGAACGACTGGGGCGGTCTATCATTCCCATTGGAGTTCTAAGAAGAAAGCGCTTGGTCGGTTTCATCTATTAAAAAT"))
+(assert (= z "acaaagguccgcucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2
new file mode 100644
index 000000000..3da25db8c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0142.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCTTTATAATGATCAAATGGCATGATACGTCGTTGGTGCCCATCTGATAGGAGCTCCTGGGTAACCATTTGATTAGGAGATATGTTCAACGCCCGCACGCGCAGATACACATGAGAATCAGCATAAATTTAGTCCGCCGCATACAGATGCTGCCTAAGGAAGTCGTTCTTTATTGTGAAAGGCTCAAGGTGTAGCGGCT"))
+(assert (= z "acauacaauaguaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2
new file mode 100644
index 000000000..31f361f87
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0143.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGAGTCGTTCTAAGATGCCCCCTAAGCTTCCGGATAAATCGTGATGCGGTGGGCTGGCTGTCGACGTACAGAGAGGTAGAGACCATCCCCCAGAAAACAGAATGCTGTCCTCTTGTCAGTGTCCGTGCCGGGCCTGGGCTACAAGCCTTAAAAAACCGCGCGCGAGCGTACTACCCTTAGCCTCGATAGACGCTGGTCC"))
+(assert (= z "ggguuuuauuuuugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2
new file mode 100644
index 000000000..21963a89c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0144.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGCCTTATACCCATAACGATAACGTATCATGTGTTTCTTTCGATTGGAGCGCACGCAGTGCCCCAGTTAGCCCGATGTGTAGAACACAGACTATTTAGAAAAGTTACTACGGAGGCGAGCCACCCGATCTCTCGGCTGAGTCAGCGCATGAGTCAGAACACAAGTCCACCTTGTGGCTTTGAACCGTTTTGCGCGCGTT"))
+(assert (= z "cuagcuaacaccaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2
new file mode 100644
index 000000000..ad7477ebb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0145.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCTTTCGCCAGGTGTGTCAGTTGTCTCTAGGGTCACTGCGCCATGACACATTCTTCCGGATGCCATATTGGTGTTGGCTGTCGCTACTTACCCGTGACGGCTATTCGATGACCCACCTTCAGGTTCTATCCATAATTATACGACCACGGAGACGTTAAGCCATCGAACCCGACTTCCTTTGCGTCCTGTTATATCTGTG"))
+(assert (= z "ucucagucuacaguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2
new file mode 100644
index 000000000..02d098f49
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0146.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAAGTCCGGTCCGAAGCTGTACGCGGTAAGCTTGGACAATGAACATGACGTAGAGAGGCACACAAAGACCTTAGTTACCATATGCCAGGCGATCCAGCCGGTTCTCCTTGCCCCGTCGGGCCAACTACAAAGTTCCTTGCAAATCGAATTGGAATTGCGAGCTTATAATTCGGATTAATTAAAAAGTTTCCGCTGAAGTC"))
+(assert (= z "ucuggguaaucgacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2
new file mode 100644
index 000000000..3d66b828b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0147.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTACAACGGCCCTGGATAAATCAGGACCAGCCTCGGCCAAATGCAGTTTGGACAGGACACTTGGGTGGAACTGGTAGAGGTGCTAAATGAGCTGATCCCACCCTAAGAGGATCTAAAGCTAAGGGAGGCTAAAATCGCACTGGAAGAGGGGCGAGTATCGTTAGTCGCAGATATTCTACTGGCCGTATATCGAAGTAGA"))
+(assert (= z "ggggaagaggcuauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2
new file mode 100644
index 000000000..2ae54c3d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0148.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGGCGCCACATCACCCGCGCTATAATGTCTTCAGACGTTTGGCGATGCTCATGGCGAGACTGCGATCGCCAATGAGTTATGGCCGCTCTGAGGAGCGAGCTGCCGGGATAGCGTGCCAATTGAGATTTCTGCCGGGAGCTCCGAGCAAAGATTGTCTAACGGAGGCTCATCACAGCTGATTCAAAGCCCTGATATGTAG"))
+(assert (= z "cgaacaggauaccga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2
new file mode 100644
index 000000000..4fb0cb655
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0149.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAATCCTTAATCCCTTCCCCGAGGAGCGGGACTTATAAACTCTTGGGCAGTTTAAGTCCCCAACGAGATATCGGCTAATTAAGATTGACAGACGACTATAAGGGCGACCTGGTTTCGGTAGATGACCCCTGGGGGGTTGGATGCACCGATCGATGCACATAGGCCGCTCCGTCACCGAACGCATGGGGATCTGTATCAGG"))
+(assert (= z "gguccaaaauagacg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2
new file mode 100644
index 000000000..4ef5f6b88
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0150.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATAGGTATGACGGCCGAGACTGCAACAACTTTCATAAGCCTTAGTATTCCGATATGTGGACTCTAAGGTGCCCTCACTTGACTCAAACTGAGCCAGGGGCATGGCGTCGGGGCGTCATCTCCCATCAAATGGCGTAGAAGACACGAGTGAACTCAGTGAGTCGTGCCGTTCGCCTAGTGGATAATCAAGCGCCACGAAT"))
+(assert (= z "gaaacagggacaucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2
new file mode 100644
index 000000000..6fb58f722
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0151.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTTACGGCTTGCCGCCGAGCACTAAAGAGCTTGATAGCCGGATGCGACATCTATTGATGAGAGCTTATGGTAGCCTACCATCTCCCACTTACCCCCAAGCGACCTAACTGATGGTGGTTTATCGGGAGGTCGCCCTATCCATAATTCGTGGCGTCAGTAGCGCAGCATTGTATACTGCTGAAGGATATTCGTTTTCATC"))
+(assert (= z "cacccuuucaaagac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2
new file mode 100644
index 000000000..78d16c957
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0152.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCCCCAACTAAGCAAGCGTCCTCTTCCGCGATGCTATTAGGACTGGCTAATAACCTGCTCTGAGGGGCGTTCGGACTCTTAATAGGCGGAATGACGCTCCTGTCCCTTTACGGGCCGTGCACGAACCAAGGCAAGCCCTGTCCGCTATAGGTGTGTGTTAAGCCGCCCTACGGCTTCGTCGTTAGTGTGCTTGTGATCG"))
+(assert (= z "cuuuggcaguucuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2
new file mode 100644
index 000000000..a360e0cf3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0153.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCACAGTCTCCTCATCAGCACATATTTATTCGAGGTGGCGCGAAACTTACGTGCATAGACCCTAATGTCCCGGCTAAACATCGCTACAGAAGACTTCTTGCCGCCCCACGGCATCCCCAAACTATGAAGCGGGCCTTATTACTGGTTATAAAGGGGAAGCTAGTTACCTGTCCCACTTATGATCGCTCGTCTTCTTAGTC"))
+(assert (= z "agucuucgaucucca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2
new file mode 100644
index 000000000..737353169
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0154.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAGTCTGGTTTTCGGCAGAAGGTCTTCCAACTTATGCTCGAAAAAGTCAGATTCTTTCCAATCCAAAACCCCAATCAGCGTTGCACTCCCACGCTGGCCAATACCGTGTCCGAAAACAATCTTTTGGCGCTATTCCCCTTCAACTTCGCAGGGGAAGATCTGACGGTAGACTGACCAAGTTCCCTATACAAGGAGGGTC"))
+(assert (= z "ggguacaggaagaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2
new file mode 100644
index 000000000..d89d3db7c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0155.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCCTTGCCCCACCATATCACGTTCTCCGTTATACAAGTCTTGCTCCCGCCGAGATACGATAAGATATTCTAGGAAGTACTCTTAGGAATGAGCGATTCGTATCAAAGGGCTCGAGCCAACTGCGCGGTTCGGCGTCGAAAGTAGTAACCTCTGGAAGAAAGTAGGGGACGTTATGCCAAGAGTGCGCGAGACCGATCTC"))
+(assert (= z "gucgaauacacugac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2
new file mode 100644
index 000000000..987ee3014
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0156.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACGTTGGTTGGTCTCGTGTCTAGCCAGCGCGGTAGTTAGGTCCGGTACTCCTGTGCTGAGGAGGACGATCGCTTATCCGCAACGCTTACACCTGTTGCCGAGATTCGGCATAAATTCGAGGGGGAACTAGCTTGTTTAGCTTCGCTATCAAGAACTTTGTCGAGCCTGGCTTATTGTTAAGGATTCCCGGATTGCCTTG"))
+(assert (= z "uguaguuacacccgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2
new file mode 100644
index 000000000..247d2699d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0157.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATATGTACTGGTCTCCCCAGGTATCAGGCGTATTTCATCGAAATCAGACGTAGGCGCGTACAAACACTTGGCCTTCGGCCGCTAGCTGCAAGTGTCCAAGCCGTCCATTCGGCGGAGAAATCAGAAAAACAAAGTTAGACCTTTAGCAACCTACACCTATTGTTTCGCAACGGAGATACTCCTGTGTGTAATAGTTTTT"))
+(assert (= z "cuucuuuuagucgcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2
new file mode 100644
index 000000000..9f0fd25df
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0158.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCATATCAGTCTCTTCTTTCGGGCAGGAATCTTGATGTCGTGCTAGTCGTCTGATCTTCCAAGATACATTTCGACCATAACTACTCAACATCCCTCTCAAGAGCGGTGGTCATAGGGCGGCAGAGCTACGGCAGGTCCTTTAGATATCTGCCATTCAGCACGTTTAGTGATATGACTAATTCACACGGTGTAAATAGAGA"))
+(assert (= z "agagacugcuagagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2
new file mode 100644
index 000000000..1d4b7d769
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0159.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACCGTATGTGAATAATGGCACTCGTATTGCAGACTCTTGTCACTAGACAAGCGGTGGGCGACCTAAATTGTACCTGTAATACTGGGGACCTGGTCGTAGTACTACAGCTTTATGTTTATACCTAGTGGCTCTAGAGCCTTAGTTCAAGGTGTGGCCCCTCGAGTCAGGGTCCCTGTAACATCAATGGTCAACAACGACA"))
+(assert (= z "cggucaacauacgaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2
new file mode 100644
index 000000000..7a2013288
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0160.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGCCTACTTCTGCGTCTACCTCTTAACCTCCGAGCTTGTAGTATGTTATGCGCTATCGTGACCATGATCGGCTGCAACGCCCCTCTTAGAGACTGTACTATTCTTCTGGCGGAATTCCAAATGGGCTCATGCTGGTATGTGAGGGGACAAAAGCGCAGCATTACGACCCAAAAGGACGTCCTGATCCGGGATGCTAGCTA"))
+(assert (= z "accggcgaaccuuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2
new file mode 100644
index 000000000..84e01ff99
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0161.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACACGTCTGCAGTCCGACCTAATTTTGGTCGACTAATCGCCGATCTGTTTATGTCGACCGCAGTACAAGGGGGGCAAGCGGGTTCTATACGAAAATATCTGCTACTATACTAAATCTAGAACACATAGTATATTGAACTGAATGATCGACTCCAAACAACACAGGCTGTAGAATCAGCTGATCATTCCGCGCATCATTT"))
+(assert (= z "aaguuagguauauug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2
new file mode 100644
index 000000000..13a11aaa4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0162.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTCTACTACAATAAGATATGGGACTACTATTGCACCACAAGTCATACGAAGTGATGGTAGAGTTTGCGGTTGCTCGCTAGCCCAGGCCACCATTATGGTGCGGCAAGATACTTGTAGGATGATTGCTATCTCCGTCGAAGCCCCGTCACCTCTTGTACGCCCTGCGTCACTCAAGATCCCCTGGAATGACTGCTATCTT"))
+(assert (= z "aguaaacaagggcgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2
new file mode 100644
index 000000000..9db0a6797
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0163.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTGCTCGTTTACTTTTCCATCCCTGATACTTCTCAGTGTTATCATCGCGCACGTACAATATGATAAGAGGTCTCGAACATACACCGGTGAACCATCATGAGGAGCTCACAAAACCTGAAATTAGGAGTCACCTCATTCGGTTACAATAGCCCCCAACACTAGCGAATGTTATGGATCCAATCCCCAGTGTCGGAGCCAAC"))
+(assert (= z "cgacgaauacuugca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2
new file mode 100644
index 000000000..d3a7acd2a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0164.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTTAATACCGTCGGAGCAGCTAGGCCCTCCAAAATGTTAAAGTGACTGCTTAATAACCCGCGCTGCGACACGCTCATCCTTGGCACCGCGGATCCGACATGATGATTAACAGCACGCCGAGGCAGAAAACGGTCAGCCGACCAGTATCGGCTTATTGCCCCTAGGCGGGGCGGCGTACTCATAGGATTGACTAGATCCC"))
+(assert (= z "aucuacccggacccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2
new file mode 100644
index 000000000..7b4376e03
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0165.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTGTGTGTCCCAACAACAAGGCGAGCCCACTTGGTAAGCCGGTTTATACACTCTGCAATTAGCCGGTTAGTAGGTTTGATTCAGGGGGTCTGTGGAATCAGTGCCAAAGGCCGTCCGGGGCTGGTGAGTCTGCAAGATGGGCCGAGGCGTCCTTCGGTAACAGCTCGCGAGCGCCACGCCGCTCGTCACACTAGCGCCCT"))
+(assert (= z "acucgugagaccuca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2
new file mode 100644
index 000000000..f519c4544
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0166.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCACAGCGTTTTATGCTGTTGAGCACGTCTAGTTTAATGGAATTAGCGTTGGGTCGCTTCCGTGGATCCCCCAAGTACTCTTAGGCATTCGTAGTGCAGGAATGACCCAAGTGCCACCCACCTAATAATGTAGTTTGCAGATAGTCGTTTATATACTTAAGGTACTTTCGTTTACCGACGGGCATACGGGTGTTGCCCCG"))
+(assert (= z "caagugauauuuauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2
new file mode 100644
index 000000000..5dae69cb8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0167.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACGAAAATCGAGGATGTCAGAGAGCGGTCCGCAAAATATCCCCCTTGTGAGCACATGTCGTGGAAATTAGATGTTGATATTTGCATTTGACAATTATAGCCTGTGTATAAGCCCCGTCAGGAGGGCGTCCCCACCCTCGGATTTCTACTCCCGTGGATCATCAGCGCGCATATTTTGTCTGCAACCGAATTCTCCCACA"))
+(assert (= z "ggauuuggccgagau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2
new file mode 100644
index 000000000..29e84c60a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0168.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCTCCGCATTCCCTCTGGGTCTCACCATCACTTCCCGTAATATGACGGTCCCCCCGCCTGAGAGATTCGCCCGCGCCATAAGGGCAGGCATAACTAACATAATAACGCCATATAGTTTGTCATATTCCTAGTCAACCTACGAGTTCTCATGCCTATTTTGCCAGTCCCCAAGCCACATGTGTATGTCGGATAACAGGAG"))
+(assert (= z "acauccgccucuugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2
new file mode 100644
index 000000000..f62e368dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0169.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAGGGTGTCTGATTCAGGCTGCCGCAATAGCTACGAGACAGCGGTCTGATCTGCATGACCGACGCCCCTCAGCGTAGACGACCTGGTATATTCCAAGGGATAACGCAACGCTTTAAAAAATTGAGGCATGCCATGACTGAGCCCTACATCATCGGTGGCTCTGTTCTTTTATGAACGGGGAAGAACATTGACATACGCAT"))
+(assert (= z "auaugugguaaguaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2
new file mode 100644
index 000000000..9154380fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0170.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGAGTGAGGATGTGCGTCCCCGCTTATTTATGAGTCGCGGTAGCCTCGCCGTGGCATAATGCGATTTTCTTTATGGACACTCATACCTGGGGAAGCAGATGGGACTCGGCTCGTAGATCCACGTACTGATGATCAACACGGCCTGTGCAATACCTCCAACGTGAAGGTTATGTAGCAGCCTATTTCGGTAGGAGATTTTG"))
+(assert (= z "ccagcuaggauacaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2
new file mode 100644
index 000000000..69eadb54a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0171.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CATCGCTTGCTTGTTGACGAATGCTGGGAGTTCGATAAGCGAGCTAGCCATTGTAGAAAAGGAAGCCGACGCTTTGGCTAAAAACACCGGTGTCGTAGTTTCTGTGCGCAATCTCGGGTTTACACAGTACGCCTTGAGCAGAGAAGGCGTTACCATGCATCGTAGCAGAACGTCCCTTACCAGACAATCAATATCTATAG"))
+(assert (= z "cgccggucacacggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2
new file mode 100644
index 000000000..c7372209e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0172.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTCATGTGTTTAGGCATCCATTACTCTGGCGGATACAGGGTCCATATGTTGCATCGCGAAGGTCACGTAGAATGTGTGAAAATTATCTCCAATAAGTTCCGGCCCAGTGCGATTCGCAGGCGTCATGGCGACGCACGCTTGATAATCGTGGGTCACGCAGAGATGGATTTTGGACAACCAGTCGGTCTCCGGGACTCG"))
+(assert (= z "guauaaacacuaagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2
new file mode 100644
index 000000000..4eede457c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0173.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGAAGGGGGTATGACGCAGTGAGGGGCCGTGATTCTCTGTCCCAGCCAGGTGTAACCTCATAGGCCAACAACCCTCGGTAACTGCCTTGTGAGGGATGAGCGTTGCATTACATCGAAATGCGAATCGCCATGGTAATCTGCGACATTAAAATAAAACTGTCGCTTGCGATCTATCAATGGTTATACCGGGACTAACGGG"))
+(assert (= z "aacaguuuaagacau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2
new file mode 100644
index 000000000..f5b8b2b89
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0174.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCATCGCCACTAGACTCCCTGGCGACATGGAGACGATTAGCCCGTAACGGCGTGTCTCAATCGGAGATCCGGACCCCTGATAATAACCACTGACCTTGCATATATGAGATATACGTTTGAGTCTCTAAATGGAATACTAAAGAAGGTAGCGCATTAGCGGTCAGAAGCCGAGCCATTCCCACAGGTGGCACCGCGGATAT"))
+(assert (= z "gcaagaguaggaagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2
new file mode 100644
index 000000000..e4b39b7a0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0175.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAATGGCACAGGCTCCTGAGAGGAGTGATTCCAGGCGATGCTGAACGAGCTCGCACCGATATCACCGGGTCGCAATCACTTGATGACACCGCTATCCCCAACCCCCAAGTAAACCCGCGAGCGACGCTCTGAGACGTTCTCAAGAGGCGCAACTCGAGCAGTTCAAATGCAGAAAGTGCGGGAAACAACTGGCTCGAGTC"))
+(assert (= z "ucuacuuggaccuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2
new file mode 100644
index 000000000..a789dc6fc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0176.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CATGATAGATTTCAGTTGTGTGTTGCAAAGAGAAGGACCTTGAAGACACCCCATCGCCCAGCCTCTGTAAGCCGCTGCTTAGGGTATTCGTGGTTCGCCTCGCAGCAGTTAATTGTCGATACACACCCTGTGGCTTTTCATCCTACTATCATAGACTTCGTGAGAACATGTTCTAGTTGGGCAGGGGAACGTTTAAGATC"))
+(assert (= z "cacaggcaagguuua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2
new file mode 100644
index 000000000..84fc71218
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0177.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTTCTCCGTATTCGTGGAGTATTGGCAGAGCGAGTGGCCTGTTCCTTGGGTCTATAGGAATCCTAGCTGAGTCTTCGAAAACTACATAGATATCCAATATGGACGCTAATCAGCTCTTGGCTCGAAGTCTATGGATAGTATCCCACTCGAGCGTACATCATGCAAAATAATGTGTATGCGAACCGAGACATTGAAGTAG"))
+(assert (= z "ucauggagcuuaaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2
new file mode 100644
index 000000000..057b292a6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0178.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTACCGGGATGTTTGGGGCTAGTTAGTGTCGTTGTTGCTTGAGACGTCACTTATAGGCGTAGACCGACCCGTCATCTAAGTCGACCAAACTCCATTCCGCTTAGGAGGGGGGATATTCGGCTCTACGAATTCCTTGAAACAGACAGTGAGGGTACCGCGACGTACCCAGATGGTAATGCGTGTCGCGAGTACGGGCTAG"))
+(assert (= z "caucaggguauuggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2
new file mode 100644
index 000000000..9d9eb15fc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0179.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGACGGTCTTCCCCGAGTATAAACCCCCGTCAAGAAACCGGTCCTACTTGGTATTTGCCATTAGTTGAGCGGACGCAACAAAGGTGGGGATGCGAGATACCCATAACAGCACCGCATTTACAGGCTCCAGGAATAAACTCGGGGGTCAGGTGTGACGAACTTCCCCGTAGGCAGACTGTGGCAGGGGCGGAAACGGGTCT"))
+(assert (= z "caacuuuaccugugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2
new file mode 100644
index 000000000..9d59eabdf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0180.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACGAGCTTCTTGAAGGTATGCAGCCCTTCATAGTATTAAACCCAAATCCATCCAGATAGAACATTAGTCGTTGCACAAGCTGAGGAGTGTACTAAACCATCTATTGCCCATTTCTCAGGCTGTTGGCGGCACTTCAGCCCGGTCCCACTGGCTCGAGGTATTTTGGTCATGATGGGGCTAGCAGACCCCAAGCAATACA"))
+(assert (= z "gguguugcacguucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2
new file mode 100644
index 000000000..e3d0f4684
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0181.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTTTATCACTGTTCTAGGTCCGCTTCGAAGACGCTGGGGTAGAATATTCAGCTAACCCAAGCTGCATACTAATATAAGTGCCATTGTTATGGCTATGTTAGCGTTTCTTGGACCATAGGGAGACGGATACGCCTACACAGCCATTGAGATCGAAAAGTACAGCCTAGATGCTGTGTCGCTGAAGCAACACATCCGCTCA"))
+(assert (= z "uggauacugaguugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2
new file mode 100644
index 000000000..d200cf507
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0182.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTGATTAAGGGCTGCTTTCACGCTGTGGGACCGAAGATGTTGATAGGGTACAGGGTTTAGGCATTCGAGTCCTTGGAGACGTTCGTTTGAAGCAGATTGTACAATCTGCGTTTGGCGCATAGCCTGGTAGCTAACCCACTTTGTCACAAATGACTCCGTGGTTACGTATCAAGTGAGGCCCTCCGTCCCCATTGACGA"))
+(assert (= z "uaaugcgauauaagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2
new file mode 100644
index 000000000..656a8bc8a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0183.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTCGCTTGTTTTAGAATGAGATGTTTTTCGGGTGGAAGCCCTCTGCTTTTTAACTACCAGCCCTAGCATGACACGCCTCTGCGGCTTGCAACCTTCGTCTGGCTTCCCGGCTCCGACCGCCTTCCTGGAACCACTATGGGTGGTACCTAACCAGAGCTTTGACATCCCGGCGCCGAAGATTGTACGGCGCTCGTGGAAC"))
+(assert (= z "gauacccgcgucuug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2
new file mode 100644
index 000000000..58abbe05d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0184.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCCGGTACATTTTGCCCCCTTGTGTACGGGGCCGATGCACTCTCATTACCCAAATCTTCGAAGGTCTCTAATAAAACTGCAATCGCCGGGTACGACAGGATAGCATGATTACCCGGGCATAAGGTCGGTTAATTGATCTCACGGGCACGAGTAAGTCATGGGCGTGTTGCTCCACTCAAGGTACAGCGCTAGAGAATA"))
+(assert (= z "ugcggcuccguguua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2
new file mode 100644
index 000000000..3ce85e357
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0185.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGAGGTTCTGACCAGCGTACTACCACGCAATTGTTCAGAACCTCAAGGACAGTCCGGCCGAAGCGCGGTCGAGGAAGTGAGTAGAGGATGTGAAAATTCTAGTTCCGATATGCTCGTCAGTTAATAGATAGGACACGCAGTCCCAAGTGCCAGTTTGTCGAACTATAGGGAATAAGCCCAACAGCTTGGCGCACACCGGA"))
+(assert (= z "aaccguaucucccuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2
new file mode 100644
index 000000000..aae3ebe90
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0186.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTATAGTATGGATTTGCTCGCTATGATTGCCTTGTCTCAAAAGAAACCCTCTCATATTGGCTCACGGCTTGTCATCGTGATCTTTCGCTGAAACCCCTACGATTATAGAGGTAGTGACATGCTGAAATGCTGGTGGGTGCCGTACTAAGTTTACAATAACATGCTTGCGAGATTTCGGGTTTTTTGCCCAGTACCAGCC"))
+(assert (= z "cagcucgagcuaugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2
new file mode 100644
index 000000000..89089409f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0187.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCGCGCGTACTCTTTCACCGAAGTGTGTATTTGCTTGCTTTAGTAGATTAGCTTAGGTGGCACAACGTCCCAGGGAGAAAACGGAGTATGGCAACGGCACCGAGTGTATGTGACGCTAATCACTGACACCTATCCAGGAGGAGTATCTCGTTTTTACGAGACCCGCAGCCTGTATTGGGAGCCACATATTTCTGCAGTC"))
+(assert (= z "ugcacuuuucccgcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2
new file mode 100644
index 000000000..c81f1dda7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0188.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGTAGGATTTCTGAGGTTCTGAATTACCTTTATTAGATAAATGGCGGGATCACCAGTACAGCCGAATCGATTCGAGCATCTGGCGAATAGAGATCATCGAAATGTCGGTTGAGAGGCACTCGGATTCGCACCCCATTAGGCCTAGTTAATTCCTTGTCCGCCATAGTTTAGTCTGTGGCTTGTCAGTGAGGAGCGTGCC"))
+(assert (= z "uccuucuacagcgug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2
new file mode 100644
index 000000000..beacb1c48
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0189.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTTCCCAGATAGTGAGTGCACCATCTTCATCCCGAAGCTACTCAGCCGAGAGTCCCCTGGTGTATGCAGTGCTGGTATTTGGGAGGCCCGAGTACTCAATTTCTTTAGGGAGGGCAACGGGACGTTGTTGTGTGATAGGGGACGCGGTGGTTTAGTAGTGCGGTCAAAGCGAGTTAATCCCGATGGAGCGCTATCACTGA"))
+(assert (= z "guaaccaacgugagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2
new file mode 100644
index 000000000..f3c1d8169
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0190.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTTGCCCCAGACTCTAGAAGTCCAATTGTGGTGATCGAATAGCCATTCTAACTACTGGCACGGGAGAATATCTGCCGTCAGTTGGATTACGAAGCATCAAGAAAGCAACTACTGGGATGCCCAGTTCAATCAGTTACCGCATGTGGGCGAGATTCTCGGGGGGGTCATTCGTCTGCTACTGATGTAGTGTGTCATCCGC"))
+(assert (= z "cgucgauacaugguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2
new file mode 100644
index 000000000..e6bb59345
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0191.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGCGTAACCGGTCTGAACGAGTCATTAATTAGGTTAATTTTCATCTAACGGATAATAAGTGCGCAGAGTAACAAATCTGCAGATTGTTGAAACGGGGTGTCGAATACTGATCAACTATATTGGAGAATGGAGTGTAAGTGTCAGTTATAGGTCGAAAATGGTAATTCACGATAGTATTACCGTAACTACGGCCGAGGAC"))
+(assert (= z "ucaaaaagaucuggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2
new file mode 100644
index 000000000..14697edd4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0192.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCAATGGGCTAACGTCTGTTAGCAGCGGATACTATCAAGTCATCCTTTAATGGTTAAAGGTAAATAGTTAGATGTTTTACTAGGTGTAACAACCTCGCCGACTGGTGCGTGAGATTTAAGAATCGTCGGGACGAAGGCTTTCAGGCTAAAGGCCCGGATAACCTCCCTTTTCCAATCCAGGATCGGCTGCTTAGTCCAAA"))
+(assert (= z "uagcccgucaccaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2
new file mode 100644
index 000000000..e9e7fc403
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0193.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTTTTTGTCTTAATGTTGTTGCGCACGCATATTATGGACGTCTTACTTTTCAGTATATTGTTCAGCCTCAGGGTGCCTGAGGACTCTTCAACATCCATTCGATAGCCTTCGTGCCAGCAACCCTGAAAGTAAACGGTATTTCTCCGGCATCGGACACAGGCGTCATAGCGTGCATTGAGAGCGTTGAACGCTTACCTTT"))
+(assert (= z "auuggucuuacgauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2
new file mode 100644
index 000000000..ca246872f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0194.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCTTAATTACCCAGCGACAACATACTAGTGTTCCGGTATCCCGGGGTTAGCGGGTTGCGGAGGGTATGCTAACCTCGCTCTCCTACATAACGTATCTGTAAGTGGGGACCTCAGGTCTTGCCACTCTTCATTCAGAGACTCCGGAATTCCCAGATGCCCTGGACCCCACAGGGGCAACACGTATGTACAGCAGATCATC"))
+(assert (= z "cccaaucgaccgucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2
new file mode 100644
index 000000000..3d797e22d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0195.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGACACAATCCCGGTCCGTTAGAACCACGCTCCCTAGAAACGTGCACCCATGCCGACGCCCTTCAACGCCCAGCCCCTCCAGGCTAGATTGTGCTCTCCGCAGAGTAGTCGGTCACGTGACATTTGCAATGAAACATTAACACTGATGATGTGTGACCCTAACTCTGAGAACTCATCACTGGGCCGGAGACCCCTCTTTT"))
+(assert (= z "ccuaauuucaauggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2
new file mode 100644
index 000000000..b0e8d392c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0196.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCCTAACTAATTCCGATATTGTCTATAGTGTATGGTCATATGTTCTATGGCTTCTACAACGATCCGGTGGCCCTAGACCGGATGCATCGGCGTGTATACCTTGCCGCCACTGTCTTGTGGAACCGGGCTGTCAAGGAACGGGTCAAATGAGATAAGCTCCCGTCAGCCCTTCCCGCAACCGCCAACTAGGTTCGACGCG"))
+(assert (= z "aucguucuaggaaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2
new file mode 100644
index 000000000..ad1468ffa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0197.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGATTTGAACAGGCTGATTATGGTGATTCGAGAGTAGATTGTTCCGCACGTCCTCGTCCGTTGTATGCCAGCTCCACAGGTGCACTTTTAGGACGTACCGAAGGTGAGGGTTTGGCGGGAGTGACTCGGACTAACATCATCTACCGGGAACCGTTTGCCCAGAGGGTGGTGGGCTGTAGGCTCCAGTCGATGTCTACTGT"))
+(assert (= z "aguccgggugggggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2
new file mode 100644
index 000000000..88b0509f7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0198.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCAGATAGGGGACCATCGGTGCCAGAGTAGATGTGATGGCTGGAAACGCTATCGATTAGGAGTTGTTTCACGAAGTGTTTTGCCGTCCAACCTCTGCCAGATCCAACGCAGATCCTCCCCGGGTATTGCAGCGATCCAACCTAATGTTATTACTTCCTCAGACGGCGTACGAAGTACTAGGGTAGTCCCTAAGACAGGTC"))
+(assert (= z "acggcuugaccuauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2
new file mode 100644
index 000000000..dc91c0718
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0199.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGTGGTCTACACACTCATTAAAATAATGACAACCGTACTAAACATGTCGGCCTGCCTTTCAAGACAAAGTCAGGTTAGAAGTTACTAGTACAAAAGTGACTGGGGTAAAGTTTTCGTGTTCAGCGTTCCGGGGAGGCTTGTCATGAGGGATTAACATAAAGATAAGGACCACACAGGAGTTGCGATACGGTGGTGTCGT"))
+(assert (= z "acaggcgaauggcuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2
new file mode 100644
index 000000000..a03da1f95
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0200.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGACAGGTTGATGAACGAACGCACACCATTCGGGTGCCTTTGGCCTCTAAAGGGAGGAACATCTTTTAAAAGACATCTAACCGGCGTCGATCATCAAATCGAACTACGGATCTAAGAACTTACGGGGTCCAGGCGATGGGGCAAGAATAATCATCACTCACGATTCTCTTGAGGAGCGAATTTATGGGGATCTGGATTG"))
+(assert (= z "gaguccuuaugagcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2
new file mode 100644
index 000000000..71ab13d5f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0201.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTGGTACCTTGTTGGACGTACTACCTGCGTTATACCCTCCTCCTTGGAACCCAGAGTTCCGATAGCGTAATCTTCGGATCAGACTCGGGATCTCACAAGAGGTCTTAGGCGGGCAAAACTCTTTTAGACCGGTCTTGGGACGATCTGGTATTTGCATGTAAGAACCTGTCACAGCTTCCACCAGGCTAGACTGGTAGA"))
+(assert (= z "gacgcauuugaaccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2
new file mode 100644
index 000000000..8db6ffe85
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0202.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCAGAAACGCGAAGGTGGCTCGTATATTAACAGAAAATGATTTGAACAACTCGGCCTGGTGTCCGGGTTTTGTGAGAAGGTCTCGGTACCATGTGGAAAGCAATGACACGTACTGAACTTTCGCTCTCCGTGACTGCGGGGCGACCTTGGTAATCGAATAACATGCAGCAGAATAGGTTTAGCCGTCTGAATGAGATTG"))
+(assert (= z "ccggcucagaaacua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2
new file mode 100644
index 000000000..25d57a4f8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0203.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGAGGTTGAGTCAATTGGCAGGATCACGGAAAGAATTCGGTTCGAGAACACGAAGGGCGATACCGAGGCAGTACGAGGAAGCCATGAGTCCGCAGTCACTACCGATTAGGTATACGGACACGTAGACGGGGGACGATTAGATCAACTTCCAGTTTCACCGGCGGGGGCGCTTCTAAACATTTGGCGTACCGTGTACTGGT"))
+(assert (= z "uuaugacccaugcga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2
new file mode 100644
index 000000000..e66f9ca96
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0204.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCTTGTGCGATGGTCCGTCGACTCGCCAGATTACCCGTACTTTGTCACGGTGCATATAAAGGCAGCTCCCTGACACATCTGCAAGCATGTATCAGGCGCCAAATCAATTTAATTAGGTCCAACAAGGTTGGAATGGACTGTCAGTCGTTGTAGGAGGGTAGTTACCTATATCCTCTACGCGAGGATTGTGCTTATAGAT"))
+(assert (= z "agcgaguuaggauau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2
new file mode 100644
index 000000000..cedfde9d0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0205.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGAGTTTACGCAGTCCCTTCACTAATTAAGATTTCTTTCCTGTAATTTTCTAGTTAGTACGACCGGAAGCTGCAATCTTATAACGATATCCACGATACCTGGGCAGCCGGGACAAAACCGGTCTATGGCCCAGTCGACGGCGATTTGTGCACCGCATGCAGGAGGCAAGTCCTAGCGGCGGACCGCCAGATACGACGGTG"))
+(assert (= z "cacgggaccauacga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2
new file mode 100644
index 000000000..9407546ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0206.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGGCACACGGTATGTCGAGAACGTCTGAAACTAGCTGGAAACAGTATTTGTGCTGCGTTTTTGCAGGATGGGGAGTCTGTAGGTAGATTGCACTCTGTAAAATGCGGGCCCCGGACCGCCGGCAGGGGTACCCGCTAACCGCTGAGCTTGGTCGGGCATACATGTCCGGTTAAAGCAGAATGCTTCCTTCCCTGTAGTC"))
+(assert (= z "cucuggagucccccg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2
new file mode 100644
index 000000000..b440aef29
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0207.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGGGGCACGCCCGGCCCCACTGTACGCTTGCATGGCCCGATGCGCCCCAGTGTTTAGCACCGGACTTTTTCCTTCGACGGAGCATAAATCAGCAACGATGGCTTGCACCTGGGATAGAGCAGGAGGGTTGCACGTCAGACCCGTCGGTATGCTGAAACTCATCTTGAAGCATCATAACTCCCGAATGCTCCCAGCTAACA"))
+(assert (= z "cggagaucuacacau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2
new file mode 100644
index 000000000..441013b7d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0208.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACCACAGTGAGAGCTCTCGGGCCCGCAACGAGTCATTACATTTTTTGTCCCCACCGGGACTAATGCAAAGAGGGCCGGGACACTGCATTGATTGCCACGACGAAGACTCCCTAGTTATAAATGTTTAAACCGCTCGTGTGAGTATACAGGGTATTATAAGTCCAGTGTATTTCGGATCAGGGATATATTATGAAGAAAA"))
+(assert (= z "caccgacauuaguau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2
new file mode 100644
index 000000000..b83c3cd17
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0209.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTACCGCTGAAATGGGTTACAAAGTACTCTTGGTGGCTTAGATACCCTGATACAGCCAGGAATGATAAGACGTTAACAGCTACCCGGGGTTGTGTGGAAGCACGTAAGGGTCATATAAGCCAAGCCGCGCACCGCGTACCACCTGTGTGGTAACCATCGTTACCGGGCCGCTACAAGTTAAGAACGATAGTCCAGACTG"))
+(assert (= z "cugacgucccguagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2
new file mode 100644
index 000000000..677f4e665
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0210.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCCGGCTGACGAACGCACGATATAAATCCAGAGTTGAAGTAATGCGCGGTCGTTAAGATATTCCGGTGCAGATGGTCTGACTCAAGCCCATGAAAGGTCCTCATGAACTTCCTGGGACACTCACTCAGGCAAGGTTTGGAGACGTGCTCGCGCCTCTTCAATCCGGGAGTGCCTGCAACTGATGTGGCCACACCCCGGC"))
+(assert (= z "accguuccuccucaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2
new file mode 100644
index 000000000..3d4f24886
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0211.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTCTCCCTTTGCCTCAAGCACTGCTGACCGGGCATTCAGAGTTGACTTTATTAATCTAAGATTGTATGTTACGCTCTTTGGCCCGGCGAGCCGTGATGAACCCAACAAGTATCTTTGCAACGCCCCTTGGATACAGAGACTGTTATATTCCCCAGGAGTCCTCTGGCCTGTCAGTCTTAAAGAAATGCTTCTTGAGTAC"))
+(assert (= z "cuauacagcaccauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2
new file mode 100644
index 000000000..e7aa33e71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0212.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCAGTCCGCAGCGAATAGCCGTCTGGGGAATCTTTTGGCTTAGACACTATCAAGCTTAGACCAGGCACCTTGCGGAAAGGTCGCCATCTCCAGCCTCGTGAGGATGAGCTTACCCATACGACGGGCTCCTTGTTAGTCGGGAGAGCTATACCGCCATCGAAATCTGCGGCCCGCTTAGACATGTGGCGCCCATCATGCTC"))
+(assert (= z "aaccgcggggaccua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2
new file mode 100644
index 000000000..e98b9f93b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0213.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCTCCTCATGTTAGCGACCGGCAGGTGTAAGCTAACCCTTCCCATTTGCAATGCCATTCGCGGTGTGTGTTAACCATTGGCCTCCAGCTAAAAATCCGCGGGGGAGGCCTGCTTAGTTCTGTAGCCTATCTGGCTAAAATGAACCATGCAATCTCCGGTCTTGTTTCATCGAAACATTCTGAAACCCGTTGAATAGCGAA"))
+(assert (= z "cuucccaguuuuguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2
new file mode 100644
index 000000000..926016959
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0214.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAGGCTATGCTGAGACATTCCTTAAACGCGTTGGGCGACACTTTGGGCGCGATGGTCCGAGCATAATGTTGTCAATCATTCGCTATTTCCCGACAGTCTAGGACGGAGGCTCGATTCTGGCCAAGACCCCGCGCCATACAAGGGTAGATTAGATGAAGGGTATCGTAAGCCGTCGCAAGCTTGTTGATCAAGTTGCGCA"))
+(assert (= z "gguagccuuggccca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2
new file mode 100644
index 000000000..c9043acaa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0215.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCCGGAGCGTCAGGTACCGCCCCATAACAATCTGAAGCCTATGACAAGTCCGATGAGTAAATGCCTTACGTGCCGACGGCTTACTCGACCTCCTAAGCCCACGCGGCAGTTGGGGTTCGGGCGTCTTATTCGTAAAATCTCTCGTTCAATCTGAGTGTCAGTTTGTGTCGCGGTTGATGGGTGGCAGAAAATTCATAAG"))
+(assert (= z "ccaauagaucuuuuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2
new file mode 100644
index 000000000..58e3df996
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0216.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGTTGAGGCGTGATCACATCCAGATCCGTTTGCCAAGAGCGCACTATTGCTAGCGAGTATCTCAGGACCGCATTCATTTCTCAAGCAAGTGTAAAGTGGCCATGGACTAGGTGGCATCTGGATCTTAACGCTTTAGATAACATTTGTACTGATGCTAGTTTATTTTAAGGTCTGAATTCCATTTGGGTGCTGGAAGCAC"))
+(assert (= z "aacuaaucaucaagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2
new file mode 100644
index 000000000..5cc6bc76a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0217.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAGCTGCTGATAGCTGCGGAGAAAGGACATTGATTACTGGAGGGCGTATCCGATCTTAGAAAACCAAGGATCTACGGCACTGACGGTGTTGGAGCACAAACAACATTATAGTGGCGGTGGACAAAAACCAATCCTCCTAGAACCGTCCCTTGCCGATATAGTCGCTGCACTTTCGACGAATCCGCCCGCCATGTCACCCG"))
+(assert (= z "cgcggcuagaccggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2
new file mode 100644
index 000000000..e954808dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0218.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGAGGGCTCTGCTCAAGTCCAATAGGAAGTACCTCACGTTAGGCGGACGAATGGCATGGAACACGCGCGCTTGATTTATATAATTGAGAGCCGACTCCCAAAAGAGCGAGGTGATAGCGGAAGCTTGGTAACATAACAGTTGATCATCCTTTGGTTGTTCGGAGTTATTCGGCTAGTGCGAGGAGCATGCAAACGACGA"))
+(assert (= z "ggaagaccgcccagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2
new file mode 100644
index 000000000..189f11520
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0219.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGTACTCAGTAGGCCTAGCCTGATTGAGTTAATTGCCTTCTTTGATTAAGAAGCGCAGGAACATCATCCCATGGGGCTTAGCGATTGGCATTTAAGAGCAGCAGTCGTCCGCTTATCGTCTTTGTCTGATCGTTGGTAGCGTACCTAGCACGCCAAGTCCCAAGCCATGTTGCATGCGGCAGGTACACTCCAGAGTAATG"))
+(assert (= z "ucgccuucucuacaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2
new file mode 100644
index 000000000..cfbca95b3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0220.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCGCTAAGGGTCGGATTTGAAATGGGAATCGGATAATGTTACCCGTTTAGAAAACCTTAGAGGCATAGTCTATATCAAGGGGTACCGAAGCTGTGAGACTAAGGGGATTGGTAGGATGGCGCCTATACGGACGTGGCGACACAAAGGGAGTTTTGTCTGGTTGCTCCTGGCGGAGCCAAGATTTACTATCACACCACG"))
+(assert (= z "guuuucguucacaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2
new file mode 100644
index 000000000..6a46740f8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0221.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACGGGTCATCGTGGATTGCTACATTGGATACCATGCCGGTCCATATGAGACCGTCCGCGAGACCCAGAATCCTAGGGCTCCCTAGGATCCGGGCAAACCAAATAGACATGGCCACATAGGGACTGTTTCTCTGGCACGCTCTAACGACCCAGCACAGCTTCAGTATATTAACCTAGACAGTCATCCGCGGCATGAAAAC"))
+(assert (= z "cagucuaggcuguca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2
new file mode 100644
index 000000000..2c77ef464
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0222.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTGCCTGCAGATAGCGTTCAGTCAACGTAAACCCTCCGGCGGTCAGAGACAGCCCAGCTTCATTCCTGGATGGTTTAAGCATGACCGGGTCACGACCCATGCTAAACAGATATATTGCATCAAATGAACGTTACGGTGCTTCGTTACATTTAGGGTAGGAAGGCGTAGGTTGCTCGTGGAGTTAAATTAGTCTCCGTAG"))
+(assert (= z "ucccaaauuuaaucu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2
new file mode 100644
index 000000000..2a359d5f0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0223.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTGTTGGTCACGGCTTACTGATCGAGCACTGCTGGCGACGATCGACGGTTTATGTTCGCCTCGGCATACCGTCGATATCTATACGATTATTCACTCACCCCAGGTTCCCATTATCGGAAAGCGTCTAGTTGAAAGCGTGACCCCCCAGCCGGCTACTTATTCTGAATTGGTGGCCGCTAGCCGATAATTCCCCCGGTTA"))
+(assert (= z "aaucguauauccagu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2
new file mode 100644
index 000000000..4412294c1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0224.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCTTGAGGCTAAGTTTTACCGTGTAATTCAGCCTTCATTGGTATAGGCACCCTAAGGCTATCGCGGAATGCACCTACCCGACTCGCGTCACTTACACTTCAGTCTATCCCTCTCCTGAATAGACGAACTCCTATAACGCCTACGAGTCATGGCTCGTGTCATGGTTTGGCGCATTTCCAATGCGTGACGAATAAACCCAC"))
+(assert (= z "uauucccuguggggg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2
new file mode 100644
index 000000000..2f228c9bc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0225.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGTTTCTTGCTGATTCTTGCCCTGTGCGGGCGCGGTTGTCTCGAAACATCTAGTCGGGGGATCCGGGTTACTTCCTAGAAGAGCCCCTTTCACTGCATAATAGCGGGTTAAGGGATTGCGAACCAGGCCGTGAACAAACAGATACATCGGGTGGCCCCGTGAACATTCTGGATAGCCCCCGCGGCAAAGTGCTCCTAGG"))
+(assert (= z "gaacagaccaacaac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2
new file mode 100644
index 000000000..3081dd33e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0226.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGTGACCCATAGTTATCCTACACAGGTCCACCTGAGTCGACCGGCTATCCGAGGAAAGGGAACCCGGCGAATACTTTGCTGGCAAAGGATGCCTGACCACCCGATTGGGATTGGCTTAGAATGCGTCTCGAAATATGTGGCGCCTTCCAGCTGCTCGAGGGAACACCCATATTACAAGGTCATAGTGTGAACATAACGA"))
+(assert (= z "cuguugaucagcaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2
new file mode 100644
index 000000000..5bcf2e166
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0227.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAATCAGGAAACGATGGGAAAACGGATGACCCCCCCAGCCTAAAGACAGCAGGCCTGACTAGGCATACTAACCCCGACAGCCGAGCCGGGTTAGGCCCTATTGCTGGACGGCTGCTTGCGGAGCCTGAGCCGCGAGCGATGCCCGTTATGCATATCCATACAGTATTACGGTTACAAATTTTTTTTTTTAACATCAACAA"))
+(assert (= z "cggagauacuccacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2
new file mode 100644
index 000000000..a7145d1e3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0228.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAGACATTATGAACTGGGTTAAAGGCTTCTTCGCATCAGATTGGTTGCGCGCGGACTCTCTCACGGCTTTAACCGTGTGCAAGCCGAGCACTGGGGAGTGAAGTATTATAAATAGGTTCGCGTGAACCTCGTCGGCACGCTTGAAGGTAAATTTGCTGCTCGTAAAGGGGTCGGGTGTAAATGGTTCCTTCGTCAGATTT"))
+(assert (= z "gaacuaacgcuuccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2
new file mode 100644
index 000000000..60abb8446
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0229.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTGAATTTTGAAAAACAACGTTTTTCTCGGGTAGATTACTCATGCGGTTACGGCAGCAGAACCGCTTTTGTAGATGGTAGGGCGTGTGCACGCCCCTGTTCACAGAGACCTCCAGAAGCGCAGCTTGTTGTATCATCTAACTGGGGATTTATTGTATTTATTGTTTAGCCATGAGTTTTAAGATGCATCAAGACTGCTA"))
+(assert (= z "ccaagugacaauaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2
new file mode 100644
index 000000000..59a08ba3f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0230.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACACGTGCGTACGGAGGAGGTGAAAACCCAACGGGGGAGTTTTGTAATGACCGCTACACTCGCGGGCTAGGTTCGTCGGCAATCTAAGCGTGCAGATTAGATCGAGTAACACTAGGAACTTTATGAGAATCGATAATCCTGGATGTGTCATCGCGATCATCAGGACTATTCACTGCATATGACTCCTCGACTGCGGTCT"))
+(assert (= z "acacuuacaacuaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2
new file mode 100644
index 000000000..640c45d94
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0231.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTTAGGGCGACGGTCACTGTCGTGAGCGAGTCTATTACGCTGTCGTAAAGCCTATCATTCACAACCACTTGTATAAGTGGTTATACCCAATGATATGCTTATCTCGGGATCTTCGTTTCTAAGCTCGGGGGTTAGGCGAAAGACTGCTTCCGTCGGTTCAATACGGGTGCCCATGTTTCCCAGCCCGCAAACAACCATG"))
+(assert (= z "ggggguguucgcccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2
new file mode 100644
index 000000000..bee5e6c01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0232.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACTGCCACGTAGCCGGGCTTCTCGGCTTCTTACGCCTGAATTTAATCCCGTTCCTCCATGTCTGAAGCAGTTTGAGCTCACGTGGTGGTTCTGGCACGCATCCCCTATGCTGCGCCAAATCACAAATACCGCGAACACTTTGTGGGACGTACGAGCACTTGTGGTCCGTCTGTACAGGGTATACAACTTCATACACCGG"))
+(assert (= z "uccuauguugucugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2
new file mode 100644
index 000000000..58d755c34
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0233.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAAGAACAGTATGCAGCAGGGCCGGTAACGAAAAGAGTGCACGTGTTTTGCCGGAAGGCATGCGGCGCATGCCGACCCTTATGGCTACCCTCTCGTAGTTTGAATTACGTTTTCTATTATCCATCAAGATTGTAGTTCGGAGCAACTCTGGCCGTCCTCAGGAGCAGAGCGACACATCCGTGACCTTCGAGTGACATTCG"))
+(assert (= z "agaagggugggcaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2
new file mode 100644
index 000000000..fb7fae79b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0234.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGACCCTGGAACGGTGTGTGCAGCAAAAATACACCATTAAAAACAAAAAGGCACCACGGCCTACAGAGTATTTCTAGACGTATGTTTCTGACTTTGGTCTTTTATTATAGTGTCCCTCAGCGCTCCCGTCCGCTGACCGGCGTTAAAAGAAAAGACTCCGGAGGACCCCTGAGTGCAAACTTCCAGTTCAACCGGTGGC"))
+(assert (= z "ccuauaucucccugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2
new file mode 100644
index 000000000..acb7cff17
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0235.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATCGTAACAATGGATCAGGCAGAGCATACCCTTATTATTTGTGGTATTTCATCACTCAAAGAAAGTGCGCGCTCCTTTGCATTGACGTGTACATTGATCCTGTTGAGACCAGAGGGGGCACTTGAGTAGTCGCGTGTAGGCTGGGGAGTTTCCCCACAGTAGGTACATCACAGTTATCTATGCCGTGCTAACTCTTCTCA"))
+(assert (= z "agccacaacaaaggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2
new file mode 100644
index 000000000..f484dd056
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0236.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCTGTTACCACTTCTTCCAAAGGTCCGTGGCCGCTGAGTGGACTGCAGTTGTGTAGCACTGCCCAAGAGAAACCTTGCTGTGAAAGCGAGAAACCAGAGGATGTCACCTGTGCACCCATCTCACATACTTACAACCTCGCCCGCTCCTCACGACGCCTGTACGTTATGTAGTAGAGCCTAGTTCATGCGCTATCGATCAT"))
+(assert (= z "uugggacguuuggag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2
new file mode 100644
index 000000000..09d3e1685
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0237.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCATATGTACAAAGGGTTCGATCCCATATATTGACAGCCCCATCGAGCTCGGCAAGAGCTCGGGGGCACGCGTTCAGCCTGATAGGGATTCTGTAACTTCATCAGGCCCAATTCAGGATATTGTGCTCATAACGCAGTCATCCACGAACGGAGGCCCGATGCGGCCCTTAGAGTCATGGATTTACGTCTTTAGTGCAAT"))
+(assert (= z "cgugaaugggugcau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2
new file mode 100644
index 000000000..9adfb607e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0238.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTTAACTAGTACCTCGGGAATGACTTCGGGGGCGCGATCCAATTTCTAACGCGAGGAGGCTCCACGAAATGTGGCCGTAATGAACTTGAGCTATCCTGTGAGTCCATTTCGAATTACACGAGAGCCCAAATGTGCCTGACTTTGTAATGACTGACGTATGTTTTTACTTACATCGCCGGGTTTGATGGCCCGTCGAAAGG"))
+(assert (= z "guguacacccgugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2
new file mode 100644
index 000000000..0eb27c0bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0239.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCTTAAGATGAATTGCGAGTTGGTAATATACTTTATTGAAGGCACATTGTGCACTCATATATTCCGAATCCTTTACTTTCCCTTCTAAAAGCAGACTAGCTTCAAGTACCGTCCCTGTGTCCACAGTCAAGTCAGTCAGCACACGAACCTGGGCCAACAATCTACAGCCACGCGGCTTAAGTCAATCTCAATGACAAGC"))
+(assert (= z "cagcgccggaacuua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2
new file mode 100644
index 000000000..4119b1421
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0240.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCGGTTAAACGCGCCCAATGCATTCAAAACAAGCTCTTATCGAAATTTGAGAGCCCAGCATCAGCCCGTGATTTCGAATGGTGCGCTTGTCAATGCTCGTCAATTCATGCAACGATAATACGGGCTGTCCGAGACGCTACGGTTCTGCGATGGGGCCACAACTCAATCATTTGGCCACAACGCTCACAATAATATAGGCA"))
+(assert (= z "ugucgugggguugca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2
new file mode 100644
index 000000000..02a3daa01
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0241.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTCGGGACGATATGGACTCTCATTGTCATTCTGTAGGACTGAAAAAATAATTATTCACGGGTCTGCATACGACAGATATAAGATGCGGTCCGCAAGGATCGGCTCTTGCCCGGCGATCCAATGTTATTTGCACGTACACCCAGCAAGCTTATGAGTGACCCCTTGCCACATGCGTAAAGTGGAGGTGACGGCGAGGCAG"))
+(assert (= z "auuuaggcacuuuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2
new file mode 100644
index 000000000..bff00d382
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0242.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTAGTCAGCGGCGCCAAGAGCATCCATTAGTGAATTCGCTAAGACCAGATGAGCATTTAGCCGTTCTGAGACGGAATCGACCTGATACGGGAAAGACGCGCCACCAGGTCGACACACATTCAATTGTACTGCGGCTCTGCGCCATATCTCCATGAAATGGAACAAGAGATACCTCTACCAATGAAGGAAGGGGTCACCC"))
+(assert (= z "uacccugacaccaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2
new file mode 100644
index 000000000..2f6d483dc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0243.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGACTCATCGCGAAAACCCGTTCCAGTAGCCAAGGTACGACGCTCATGATTAGACGTGAACTCATTGGGGATGCGCGAAAGGTCATCCCAGCCTCGATTGATACGTATATGGCATGAGGCCCTCAGGGAACTTAATAACTACGGGTGCTCGCGGCTTGACCAATGTGCTTGACCACTTCCAAACCAGGAAAATGCTGGGA"))
+(assert (= z "gggacguuuuuguaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2
new file mode 100644
index 000000000..7b5ed956e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0244.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACGCTGTGCACTCTCATGCCCCTCATCTTTTCGGGAGTACCCCGTGCCAATACCCATGAATGTATTTGAGTTACCATCTCATTCACATTAGAACGCCAAAAGGAGGTCGTATTGGCATATTAACTCAACGAGATATGTTCTTCCTTGGTTTGCGAGTAAACTAACTGGAACGTTTACGGCGAGCTTCTCCCCAAGAGAT"))
+(assert (= z "ucaucuacggcgcgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2
new file mode 100644
index 000000000..44ba52c12
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0245.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGCATGGACAGGGAGATCTCCGTCTACATGTAAGGACGTAACCAATGAAAATAACTTCACGAACCCTACGGTGAGCTCTAGAGCTCCGTTCTGGGCGGGAATCGGGGAGCCATTAAGTGTGACCTCCCGTCGGCGGTGTCTACCAGCTGGCGAACCACCCAGGGTCGTACACAGTCAAAATGGCTACGTTTTCCGCTGG"))
+(assert (= z "gcauaagucagcacg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2
new file mode 100644
index 000000000..e6a41aa51
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0246.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCAGGGCAACCCAAACCAAAATACCAAACGAACGCTCAATCAGCATCATCTGGCTCTGCCATAGCTCGCCCCATCAGAAATCCCGGCCAGCTATCTAGACTCAGCAGTTAAACCGCGTAAAGGCGTAAATGCATACAAGATAGGCGTTAGGCAACGCTATTTTCCCAGCCCTCATCGACTCTTGATCGAAGAAGGCCGA"))
+(assert (= z "agauguccacaguua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2
new file mode 100644
index 000000000..ea7226352
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0247.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACATGAAAGAGTTATCCGTCACATTGCCGCGGTAGATAGACTCCCCGCTGCATGAGCGTAGAGTTGAGCATCGCGCACAGAGTGGCAGTCTGAGGCGGGGAGGCAGGTCACACGAAGTCGGCGACGATGAGCCCTATCTCTCCGGGACCCTAAAACGACCGCACCAGAGTCCTAGGGCCTCTAACAGGGGAAGCGATGC"))
+(assert (= z "aucuuacaguuaaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2
new file mode 100644
index 000000000..c069b4bc0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0248.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGACGGTTAGACGGGGATCCCCTATCAGTCTAGGAGCGGGGCTATAGTGCGTCCATACCACGAAATGCATGGCGCGAGAAATCCTCCAACCCCGAATTTGAGGCATATCACTACTTACCCGGCGATAAGTCCTCTATGCTGAGGCGGGGCTTGTTGGTTGTACTGAGATGAGACGGAGATTAATCAGAAAGCTAGTTAAC"))
+(assert (= z "cuuaccgcguggauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2
new file mode 100644
index 000000000..7c4bc64f0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0249.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGATCTATTACAGCATTTTAAAGTTTTCGTGACGCGTGTCACGCATGCGTGTTCGATTAAACACAAGCATACTTGCACCAGCTGGATGCCACAAGTATCAAAGAATTAATAATATTTGCATTCACCGTCGGAGGGGTCCCCAACGGAACGTCAGACGTCGCCGAGTCCACGGAGCGCTCGCGGTGACGATATTGCTACT"))
+(assert (= z "augggaggagggcgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2
new file mode 100644
index 000000000..78c477abd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0250.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCAAAGGGGCGGTTGGCAAGGTTGACGGAATTGGTTATTCACAACATCGCGTCCCCTGATTGCACAGGTGTGATGTGTGCTCATGATTCGATAGAGAGATCCGTCATCAATCTGGAACGAAAAGCGGAACGGAATGAGTGGAAAGGGTGTTTGGTGCTGATCGAATCGACCCCGAGTGGGGAGAAAGGGGAAGCAGGCA"))
+(assert (= z "gcuagaucugcucgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2
new file mode 100644
index 000000000..f75510715
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0251.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCGAATGGAACAATGACATTTCGGCTTAGCCTGGGGTCAGGGTAGTGCAGCCTAGTACTACGGCCGACAGGTCCATCGTCTGCCTTTGAAAAGAGTACGATTCTCTGGAGTGAATCGGGTGCGACCAGGCGTAATTAGACTTAGCCCATGAGCCATATCGTGTGGGGGTATGACACCGATTTCTAAAACTACGCACAGT"))
+(assert (= z "cacagcuaaccugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2
new file mode 100644
index 000000000..d6c05fed6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0252.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGTCAGAATTGTTCTCGCATGGAGCCATGTTTTATTTGAATGCAGGGTAGTTGTGACCTTGCTAATCCGCGCTCTGCACGACGGGAAAGAGCCGGCTGCATACACGCCAGCTGCCACCCTCCGCGATGGTGCTGTTGAGGACCCTATGAAAATTGCTCCCGCAGAGCTGGTACGTTGATGCATCCATACTAGTTCTACCA"))
+(assert (= z "gaguugccugaaggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2
new file mode 100644
index 000000000..389589259
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0253.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGTGCGGGACCCTTGACCGACATAGATTAGCGCGGCACCGTCGGCCAGAGTGCTATTACATCTAGAATCGCGTATAGGCGGTTGTCTACGCCGAATCATAGCCAATAGCCTCGGACAACACGCTTGAGGAGTATTAGCAATACTTCACGTTTGTCACGGCTAGTTCGTTACGTTCGAGACTGCTTTTCATCAAATGGGAC"))
+(assert (= z "cacuagugggaugcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2
new file mode 100644
index 000000000..c961f8a88
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0254.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGCTCGTCCGGTTAATACAATACGTGGGTGTGTTATATGACGGACTACAATATCTGGTAACGTCATTGTTGCGGCGTGTCAGTCACCTGGCTGGGTAGTTTGGACATGACATGGCCGTACCATATTAAACCGCTATAGCAAGGATCTCCAAGAAGTAGTTGAAGGCAATTTTTCGATCGCGAGCCGACTTGACTTGCAT"))
+(assert (= z "uacuggguuaaccau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2
new file mode 100644
index 000000000..56aa4173d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0255.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGTCCGTCTAATGGCGCACTGACGGCGAAACATTGTTTAAACAGTGTTCTCGTTGGTGCTGGAACCAATATAATCCCGGTGCCAAACAGAGCGGGATGGTTGGGCAGCGGAGTATACTTAACGTTGAACGAGCGACGTGTCTGTGGTGCCTGACAAAATTGAGAACATAGTCCTGCAGGGATCACTGCCTTCCTAGCCTT"))
+(assert (= z "ucguccuacaacuca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2
new file mode 100644
index 000000000..57c95356e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0256.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTTCCCCCATGGTGATGAAGACCTGTAGGAAGTATAAGACGCTCTAACTCTGTAAATGCAGTAACGGGCACGTCCGTTGAGGGTTCTCACATGTGTTTTTTGAAAGATCTTTCAGGTTTCAAGTGCGACGATGTTATTTGACCCAATATTAAGCTAAGTTCGGTGCGTCTTGTTAGCAACTGCACGGTTGGCATACCTA"))
+(assert (= z "cugucggggggucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2
new file mode 100644
index 000000000..d897e8b68
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0257.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTAAAGGCCCTGTAGATTAGTGAAAATTTAATCCCGGCACTGTCCACCGGGGTAGTAATGGTCCTGCCCTGCTTTTAAAGCCATTGGGCTCGAAGATTGCATTAGGGGTCATTAAGTTAAAACGTTCAGTATGAGGGTTTATGCTACGCACTGCGAACAAAGCTTCAATAGAGGGCCGATTTACGGTCCATGTAAGCAGA"))
+(assert (= z "acaagcucacuccgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2
new file mode 100644
index 000000000..6d9162151
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0258.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTTAAGGGTTTTACTCGGGTAAGGTTCCACCAAAAGTAAGCTGCCGGCGTGTCCAACCCAGTCAGTCCTAATGCGGGTGACACATGACGGTGCGGTCGTTAGCCTCGTACACTTGGGCCATCGAACTGCTCAACCGGTTTTGCTGCCTAGCCACGACTGTCGGCTTGGCCCAATCACACTTGTAGGAACCATGAAAAAC"))
+(assert (= z "cgaaaagugaacggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2
new file mode 100644
index 000000000..fb5ae0044
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0259.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCGTTTCCAGTCTTCCGGAAGACTGTTCAGCAAATCACTTCTGTGCGACAGTGCTATTCTTTAGCCGACGCAGAGAGTCAGCAGTGATTAAGTTGCGCTGCGACGAGGACATATTAGGTATGGATCGGTTTACCGAGCAACGCTCCCTAGAGGAACCTTCAGGGGGTTAGGACCGCGCTGGTGGATCTGTATGCCCTTT"))
+(assert (= z "uaucugugcucucua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2
new file mode 100644
index 000000000..e0974b780
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0260.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCTTCCCTTTAACCGCTCTTTCAGGCTGCGACGTGGTCATTGCTCTGAGCGCTACACGGAGTTGGAAGGTCCTTGGGAAATCATTGAACCTCGCCTTGAAACCTCTTCCGGGGGACTAACTTTCATCGCTGGTTTAAGACGTGTGACCTGCTGATGTCACAGTTATGGGCTCCGCTTCTCCCCGCTCGTTCCAACACC"))
+(assert (= z "gcgauuuuaaagauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2
new file mode 100644
index 000000000..2efe01059
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0261.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTTTATTGTGGGTTTTCCACACTTATGAACGGAATAAATGAATCCCTCCCCATTTAGATAACAGCACAGGATAAACCGACGCACATAATAATGGCGCGCCACGTAGCTCAGCGTTAGAGTACTTTATCTGTGGCCAAGTAACCCCAATGATGTCCCGGACCCTAATACTAGACCCCCTCGGGGAGATCACCCAAGACCC"))
+(assert (= z "cuaggcacuuuuggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2
new file mode 100644
index 000000000..210090eae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0262.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCCATAAGGAGTTGCCAACAAAGCTGTAAGAGTAGTTCGACCAACCTTGCAATCTATTGATGTTAGTCGCAGGAACCCTAGCGACGATTAACTGACTACCCGGGTGGTTCAAGAGCCGATCCGCGCTCCTCTCGCAGCGAAAGGCAGTGAAGTGACCTCTGCTCTTAGGCCAGCCTTTTCAGCCTATGCTCTGTACGTT"))
+(assert (= z "guccgggcacuguaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2
new file mode 100644
index 000000000..180bcf731
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0263.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACTTTGGACTCCCCCGACTGCGGCAACTCTGTTGGTTCTGGGGGTTTCCGTGATGCAAGGCCTTGGGCAAGTCTTCTCCGACTGGAAGCTAGCCCTGGTGACCTCGTAGAGAACCTCCGTGGTTTAAAAAAAGTGCGCGCATGTCCCGATAGAACAGGCTCGCCCGCACGTATGAAAACTCCGACCGATCTAGCTTTCG"))
+(assert (= z "agcgaguuuagucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2
new file mode 100644
index 000000000..334422195
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0264.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATAACGAAGGTTAGCATATACCGCGTATCAGAAGAATCGACCTTACGACACGGTAATGCCGTGCGCACGGAACCAGTGCTGACCACACCTCACATCGCGGACCCTGTTTCCGTGAGGTATGCACTTAGCGTAAGGACTAGTCTCAGCCGCCCTCCGATAAGTTTCTCGGATAGCGTTAATAAACAGGCATGAACCCGTGG"))
+(assert (= z "accagucuaucucga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2
new file mode 100644
index 000000000..c57063072
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0265.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AACTCGGAGGACCAGTCAGCATATTTTTTAGCTTTACAATTGCCTATTCGCTGTGGCGCCGTAAATACCCCATGCGCTAGCCGCTGAGTTTGGTTAAAGCACACGTAGCTTCGGCTGACTACTACAGTTTCTCTACTCTGGATAGCGGAGTTTATAACGCCGATGAGCTACCGCGACCGCTTGTTCACAGACGGTTTGAA"))
+(assert (= z "uguggugggcuagga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2
new file mode 100644
index 000000000..21c3bc3b4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0266.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAATTCATCATGTAGTTAACGTGCTCACAAGGATAACTTGCTCGCTACCCCGCCACGGTACTTCCAGGTTCCAAAGCCCCCCGAGGGATCTGAATAGTATTGTAAACATCCACCCACTGGCTGCATCGCATGCGCAAACCATGTACACTTGTCCGCGTCTCGTATGAACCGTTCAAGCCAGCGTGTGGGAATACAAACC"))
+(assert (= z "uagacuguuaucaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2
new file mode 100644
index 000000000..ee240c41f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0267.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTCGTCATTTACGTGGATAGTGCTAGTTAACCAGTCTCCATGAGCTAAACTTAAAGAGTAGGGTGAGGATAAATCGCGCGCACGACTGTTGTTAATTGGTCTAGCTGCGAGAAGGATTAGCAACGCGAGAACCGTCCCACAGGACGCTAGAATATCTTACGATCGCGCTCTCCCAGCGTGGCACGTGGGACTATAAGAA"))
+(assert (= z "aaccuaaguacccua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2
new file mode 100644
index 000000000..e71fd993f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0268.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCTATAAACGCACCCATTCTATTCTGGCCAAGGGCTGTGAACTACCGGAATTTCTGCTCTACGCACAAGTAGTGTCTGAGAGTGAATGTTGGAACCGAAGGATCATTTGGCATCCAGGATGCGGTCGTGATATCCTCAAAGGCGGTCTTTTGACAACGAAGCCATTTATAACAATCACGCGTAAAATGCCCGATTATGA"))
+(assert (= z "ucaacaugcaacggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2
new file mode 100644
index 000000000..e0f303928
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0269.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGCTGGCGTGGAGACTCCTACTCTGACTCTAGCAACTCCGAATAGGTCAGTTACCTGACCTGACGAGCAACACCCGCGAGTCCTCTAAAAATTCCATCAGCAGATACGGGTTTACAAGTCCGCAATGTCATGAATGTACCAATCACTCCCGAACCTCTGAGTTGGCTTCGGAACTGGACTGAGTCCCCCATCTTTCCAC"))
+(assert (= z "ucggaccgacaaugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2
new file mode 100644
index 000000000..2c48fd038
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0270.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTAAGAATCTAGCACGGTTATTGATCTAGCGTCCTCCACGATGTAGCGTGTGTGCTCCCTCTATAACTAAACATACGAAAAACAGATAGCTTCCTAATTAGCGCGGATGCACGGGGAGGAATCGACAAACTATCATGCAGTTTGAGCACCCACGAGTAACTGTACGGACCACATGAGAGAATTATCCCGGGCTATGGTTA"))
+(assert (= z "agaaaacagucaaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2
new file mode 100644
index 000000000..479e329d7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0271.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATAAACTCATGTCCCATCAAAATGAAGCAATATTTCGTAGCCCTTCGGGTCCTTTTGACACTCTGACACAAACTGGTTTAATCCTTGGGTCTGAAACTTGTGTCCATTTATCCTGATTTTGTGAGCACGGCCAAAGTCTTCACCGCAGTCGCCCAGACGGCTGCTGCACAGCACCAGTCGGGCTATCTGGGCACACCTTA"))
+(assert (= z "gccaaauauggugcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2
new file mode 100644
index 000000000..812f845ac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0272.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTTCGGTATTGCTGTCTTTTGTGAGGAATGGCTAAACCCTGGCGTAGTCAAACCGGTTAAGGTAGCATATCCTGGCGCCTCAGTCCCCATACATGCAGTCGGACCCATTCTAGATGCTGAACGTAGTCGCGAGATGCCCCATGGGACTGTCGTCCGAACATAGAAACTTTGGCGTCTTACCAAATGGCGTGAGCAACAG"))
+(assert (= z "caugcugaccugcgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2
new file mode 100644
index 000000000..dbdd0d2a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0273.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTCACCCCAGTCTCACAGTCAATTCTCTCCCGAGTATAGACCATTCGTCGCCGGCGGCTCTCTCAAAAGGCTCACCTTGTTTTCAAATTTTGTTTCCAATTGCCTCGGGCTTGACTTAAACCTTTTGAACGTCACCGGTTAACGGTACGATCGATTGTAGTAGAGTGCAGCCCACTGGCCCTAGAGGGTCGGACCCTTC"))
+(assert (= z "uaucacucacgauua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2
new file mode 100644
index 000000000..2b4d8f5f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0274.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTGACTTATTAACACGCAAACTTCCATCTATGCAAAAGATCGCGATTCACGTTATGCCGAGACTAATCGACCGAGGCGGCTACTCCAGGGGAGCATCTGAGTAGCCCATGCTTTATGGATCGGGACTCTATTATACTGTGGCGCTTATCAATGTGGCCACAACAACCATAAATTCATCGTGTAAAATACTGAATTACGG"))
+(assert (= z "uuccaucuacuaaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2
new file mode 100644
index 000000000..a2d3842ed
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0275.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCATCTTATAATAAGGTGACCCGTTTGCTACTTACGCACTGTTTGGTTTCGAGACTGCGCGGTTGATGTTAGCCCATTCCGTCTCGTTGTTACTTCGGCGTAGCTCTTTTACGTATGTCTACGTATGATAGCCCGATTATTAGTGACTACAGTCAATAACGCGCGTGCGTCACGGGTTGCCGTATTCAACCTGCACGT"))
+(assert (= z "cccaauaagguccgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2
new file mode 100644
index 000000000..914346cc1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0276.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACGCTCACTGGTGTTTTATCCCGTGCGTATAACCTGCGAAGCCAACGCTCCAAAATTATATTTCAACTCTAGTTGATAGTTGGAGGTTTGCGCACGACTGGATCGGTTTGAATGGTAGACGTCAGGCCGAGGTGTTGTGATACCGTCCCCCACTAGGTTCCAAATACATTATGGCAGACAGGGGGACAATATTTAAATG"))
+(assert (= z "guuucccaguaaaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2
new file mode 100644
index 000000000..0ada94a87
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0277.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGGCAGACTACTATACTCCCTAGTCGCACTAGATAAAGCCAGCCGGGCAGCGTGCGTGTTAACGATAGGGCCAATCTGGAGGGTCATACCACTATCCGACTCTGTGGTATTTAAATCCTGCGGGTGCGCCCCGTGGAAGCAATGCATTCAGATAGCAGTGACCGGGCATGCCGCCCCGTAACCGTCACTGTCGACTCGG"))
+(assert (= z "ucucgcuaaugggaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2
new file mode 100644
index 000000000..568863c4f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0278.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTCGCGCTAAAACAATAGAGAACAACGGCGTTGAGTAGCGACTCCAAGGCTCGTGTTGACGATTCAGTCCCTGATCAGGTTTGATCTTCCGTGTTTTATGTGCAATGACAGAAATTATAGCTTAATTGAACTAACCGTACAACAGTTGCACCCAATTATATGCCGGAATCCGTGACTCAAAGGATATCGTAACCGTCCG"))
+(assert (= z "cauuaugcugucccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2
new file mode 100644
index 000000000..e1067dac7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0279.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCGGGGGTCGGATTCACACTGACGGAAGGCGGACCTACCGGACTCCTGGTTTCATCAACTTCTGAAGTCACGGAGGTCTAAGCCGACGTGCTTCGGGATAGACGCAGAAGGATAAGACCCTATTAGACATAGTCGCGACGCAAAAGGCCGCGAATATTGTTTGTGACAGTACTCATCGGCTCTACAAGTGAGCTCCTGAC"))
+(assert (= z "ugugaccaauucgca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2
new file mode 100644
index 000000000..eba345135
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0280.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCTGACTGTAGATGTATACAGAGGCTAATTGCTTCCACTAGAGTGCACCTCGTAACCCGTGCCGATCTTTCTAAACGCCCATGACAAGAAGCGATTACGAGCAAGAGGACTTCTGCTCTCCTGAGAACTCCCGGCGACATTCGTGCATACACCTAGGTGCCATTTGCAACAGCGCCGTATATCTAAGGTGACCTGAGCG"))
+(assert (= z "gugcuaauuuauaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2
new file mode 100644
index 000000000..b0f9f0afb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0281.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGCTGCTCCCACCTAGCGGCATCTCACATCACCGCCCTAGGCTCGTTTATATCTGCGTACTCATCTTGCACTCGACACACGCCTAATGTAAGGCCATTTACGCTCTCTCTCACGATATGACCCCATCCCGATTTGTTATGAATGCGAGCAAGAGTTCCGCATTTTCCGACCGTAACCAGAAACCCGCTAAGGCGACATC"))
+(assert (= z "aucugcaaucgcgua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2
new file mode 100644
index 000000000..1d77229ab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0282.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCACCTTCCAATAGCGAATATGCGCCATCCTATAAATGTCGTCCGGCTTCTTCACGATACTCTGGTCGTTTTCTAATCTACTCGGCCTATTGCCAACGCATTCCGTCGCGCAACAGAGAACCTCGAGATGCTCAGATATCATGCAATTCGGTGCGTGGCGAGTTTACATTAGTTCTCCAGCTTTGTGGCAGGTTCAAG"))
+(assert (= z "aacauguccgcuuag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2
new file mode 100644
index 000000000..de200e304
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0283.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGGTTAGCCTCCCAGGCCACACTCTACCATTAAGGTCTTCAGCTGACGCGTAGGTAGGGGCTTTGCTCGTCAAACTGTGGATCCCGTACGCCCGGCCTAACGACACTGCTGTTTGTATCGCTGCCTAATCTAATCCGTCAACTACCGCGTAAAGCAAGAGGAAAACTAAGAGCCAGTTTATCAGGCAGTACCCCCGCAC"))
+(assert (= z "caccggcauugguaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2
new file mode 100644
index 000000000..dbafed098
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0284.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGTCGCGTGGTGTCAGACCAGCTTTACTTAACCAGCTCCGTGTCACTCAAACGAAATAACATTTTTGTGGGAACGGTATCTCACTCATACTGGGGCACCGTATGGCTTTATAACGGTACACTCACCGCTTCTTCGTACGGGCTCCCGCCGAATCAGTGGTGCACCATGCATAAAAACTGGGTCCCACAAGTGATCCAGT"))
+(assert (= z "gucacgguacaucuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2
new file mode 100644
index 000000000..ce0284b46
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0285.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCACCCTTCTTTGGCCAGAAAGGAGGGGATAACGTCATTACTCCAATAGTGGGAGGGATTGGATGAATTACGCGTCGGTACTTCGTACTCCTGCAAAACTTATCATACGTTACACAGTACATGTCTGCTAATATTTGGCATGCAGTATACTGATCCATGTAAGCTATACAGATGAGCGCACTGGTCCAGTCCATTCCCGA"))
+(assert (= z "acaucuguuuugcag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2
new file mode 100644
index 000000000..e1953df71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0286.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCCCGCGCGCTCAAGCTCCAACCGACTGAACCTTGGTCACGGTGCCACAGATTGCGGCATGGGTTCATCTCCTCAATACAAGCCCTTACTTGCTGTCAAGGGAATTAATGACTAGGCCCTGTCCCGAAAGTCGAGTTATCAGTTTAAGACCTGATGTGCTATACTGCGCATTGGAAGGAGCCTATCTATTGTCTATAC"))
+(assert (= z "accccaacuuggagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2
new file mode 100644
index 000000000..417c21d3c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0287.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTGTATATCACCTGGAACGAAGCTGGTATTTCGTCTTCACCGTGACATGTCGGGAATATGGCTAGATGAAGGCAGTCTTACGTCGAAATGTCCAATTTCTAGCTTTGCTCAATGGCGCACGGGTGTCATGTTAGAGTCAACAAGTTGTCGACTCACTAATTAACCTATACCTCGCCTGTTTCACATGCTGAGCAATGGG"))
+(assert (= z "aagagugcucacggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2
new file mode 100644
index 000000000..83c376747
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0288.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGACGTCTCACGGGCTAAATTTCGCCTGAGTGAACATCTGTGATCCGAGCTGCCGAGAGAGTAAAAGTATGTCGTATCACTGATCACCATAGGCGTGCATACTTCCCGCCGTGCCCTTGTTATCAAATCGCGCTCACTCCGTAAGCAATCGAAGACTGTCATTGCGGCCGGATTGCTATAATTATACCAGGACACTAACG"))
+(assert (= z "aguuauucccgcguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2
new file mode 100644
index 000000000..783cf90e3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0289.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTTGCACGGTAGTCGCTGACTCTGGTTGTGGGCCGCGCTAGAGTAGACCTGTTTCGCTAGCTAGGTAGGGACTGTGTTCCCTTTGTCCTCATCTCACAGATCGGCTAATTCATTAAGCTACCGCCGTAATCTTTGTGGTCGCGGTTTCTGCTGAGCCACGTACTGCCGACGACGTATCGATGTCGATTTGGGTCCTTGT"))
+(assert (= z "caaccaagugaucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2
new file mode 100644
index 000000000..38bcf9e3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0290.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTAACCGAGGGTGGTACGTGAGCTTTGCATTCGGTGGGTTTAGGATCCAGGTGCCAGAATTAGAGCCATGTAACGCGGCATCGGGACCTGCTCAGCCGCTAAGCCAGTTACTTGGGCCTCCATGAATGAAGCATGTCATTGGACGTAAACCGAACACTCGCGGTCGATCTACAACCTACAACTTACTCGAGATTCAGTT"))
+(assert (= z "gauccgaaagggugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2
new file mode 100644
index 000000000..57609ff43
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0291.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTCCCAGTGAGGAGGTGGATTGGTCCGCCGATCATAAGGCGTAGTCCGCGCATTCCCAGCGCTAGAATTTACTGCTACTAGAGTTTCACGGTGCGCGTGATCCATGACAGTACCAACAATTGAGATTGCGTGTAGTGTCATCCTCAATGATCAAGGCGATGTAATATATTCACGTCCGTTGCCGTAGTCCAACCGATCA"))
+(assert (= z "cguauccgccguuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2
new file mode 100644
index 000000000..36582a6fe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0292.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTACATTGGCCGTGATTCCAAAGAATAGGGGGCCCATGGCCATCAAGCTCGGGGGCGGGTCGAGTCGTAGCGAACCGCGAACCGACGCGATAATGGCGGATCGGCAGGATAGATACCGTCTTTACTCAGACCGAGCGAGCCCTGCGCACAAAATAGGTACGTACCGCTCGTGACGATTCGATAGCACGTTATCGCAGAAC"))
+(assert (= z "uuaaucaagcggaac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2
new file mode 100644
index 000000000..7c4e6e7cf
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0293.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCAGTGTGCAATTTGCATGCGTGCGTAAGTTCAGTTACAAACTAAGGCTAGCAATAGCCTTCAGTCCAGCCGTTTAAGGGTTGGATCGATTGACCGCACAGGGTTGTATGCTCTCGTACGGAGCCAAACAAACCCAAAAAAGATTCTAAGCCATCTGCGCTAGTCAAATTTGTAGCTCTAGTTAGTCCACCAATCTAAAC"))
+(assert (= z "cuagacgucguguaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2
new file mode 100644
index 000000000..c49670a02
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0294.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAAGTCGCACCAGATAGCTACTGGGCAGGCTTCATATCAAGAGCGTCAGCCCGAGATAACCCGTTACTTCAACCTAGAACGAGGTGCTATCAAACTGGCTTCGACAGACTCCGGATTGCGTTCTCCTTAGCTTGAACTATGAATTTGGCTGGAACCCCATTGGCAGCTCCATGAGGCCTAGCAACCAATCCATGAGGCGT"))
+(assert (= z "cuuugcaugcgaucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2
new file mode 100644
index 000000000..eec791161
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0295.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCGAGTGAGTCTGCCCTCAGTAGTCCAGGCTTATGCTCGGGAACCTGAAGATACTGACGGAAAAGTTCACCGACTTCTAGAACAGTACCAATACTCGCTACCCCCGATATGGCTATGGCTATAGAGTTCAGAGGCCTCTCAGCTTTAGTTCCAACATTGACCCCAGTTGTCACTGCTTAACAGGGGTGTGCTCCATTAC"))
+(assert (= z "ggauugcggugcaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2
new file mode 100644
index 000000000..abeee8c79
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0296.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGAGACTATTAACTCTCAATTGTACTTAATCACTTATCTTGTGTTTGTATTACGTCCGTCGTAGTTGATCCGTATCATTTACATCCGCACCAGCACAGCGTTGTCCACCAATGATATAGGAGGCGATATTCCTATATGACTGTGCCGTGCGGCCCTTTCGTTCGAAACCACCTCCGAGAGCTGTCGGACGTGAAATGTCT"))
+(assert (= z "cguacggacuauuag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2
new file mode 100644
index 000000000..51c78baeb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0297.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCAGAGCCCTTGATTTCTTTTGTTTAGCCGGAATTACCCATCCGCGACTTACGCGGAACCGTAAGACGGTCCAAATCCCCCTGGTGTGTCCATTCACTAATTCATTTAGCATAGTGGTAGGCAGTATGTTTGGATGAAAGGCTTTGAGATCTCCTGCACGTATGTATCAATTGACAGGAGGCTAGAAGTTTTATAGACC"))
+(assert (= z "aaguccuaucgcccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2
new file mode 100644
index 000000000..1883ae372
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0298.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGGCTTCATGTGCCGATTATCATTCGGTGGACTCTCCATGGTAATTTGACTAGGACCGCTGTTCGTAGTAAAAATCAAGCACACGGTGCCCTGCGTCGCCCGTTCAGTATTCCACGATACGTCCGAGCGCGCTACAATTCCAACGAGTGGTTGTTCTGACAATCTCGCTAAGCGCAGTATAGCTCCGGCTGTATCCATG"))
+(assert (= z "ccuauugcaacaaac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2
new file mode 100644
index 000000000..a53cae30e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0299.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCGCTTTATATATGCGTTATATGAGGGGGCGAACCATAGCAAACAGATGTGCCCCAAACGCAGCTGAACAGAAATCCGGGCATAGTACGAGACTGGGGCGCGGCCCGGGCGTAGGAACAATAAGACCGGCCCATTCCTTGAGTGTCCTCTAACGAAATACAGCGATAACACCACTGCGTCGTGACTATCTGTACTCTCC"))
+(assert (= z "ugaugcugcgccgcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2
new file mode 100644
index 000000000..cca60e3d8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0300.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCTCCCCCATGCTTAACCAAAAGTTCAGTATCCTTAGCGTTTTGCTACCTAGGGCAGCCTTGCTTTTCGAAAGTGATTGTCGAGGTCTCTCTTCGAAGAAGGCTCTGTACGGCTAGCTGGCAACGAGGACGTTTCGATGCATTAGCAAGGACCTTACTGATGTGCCCTGGCGGAAGGCCTTCTAACGACGAGGATTCAT"))
+(assert (= z "ucgcauggccaaaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2
new file mode 100644
index 000000000..65ab26b7f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0301.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACTACACGAATTCCTGTTGATATAGGTGTTTTGTCCTTAGGCAAATAAATACCCTGCCGAACGGCAAGTGGTCGGACGTCAGCTCAACTGTCTGAAAAACCTACTCGTGCTTTCTCTATCTACGGGCTAGTCTAAGAGTGTGCCCGTACCCGGCCACTTACAGTAGTCTCTCTTATGCGGATCCAGTAGTACATCTGAA"))
+(assert (= z "aauaagauaggcccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2
new file mode 100644
index 000000000..14ede440d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0302.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGGCTCCTGATCATTATCTCGATAAGACGAGAGTAGTCCTAGCGGGCGGCTGTCTGAAGATATCTACGTACCAGATGAGAGTTGCCCATTACCTAATCTTCATGGCTCGGAGACCCTAGCCGGTGGCCCGACTTGTATCGGATCTAGGTACATTGATATAGTTGATTCAAATAATCCGTCATGCTACGTAATATGCAGCA"))
+(assert (= z "cugcgguaauauuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2
new file mode 100644
index 000000000..0d5f13b0e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0303.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCGCCCCGGTTTCAAGAACTTAACTTGAGGATACAATCCGCGCCGAGTCTCTTGCTTTATTCCTCGCGCACCGATGGCTACAACAGAGTAATTCTTATCTTCTTTAGGTTTGTGACGGCTATAACCACGTCTCTCCCCTAGGAATGTTCACTTGGTGTCTGATGCGAGCGTGAGTACGATAAGCGGTTCTATGGAGGGT"))
+(assert (= z "uugaccucuguaggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2
new file mode 100644
index 000000000..de1036d1c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0304.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGGCGAGGATTCAGAGGATTGAGAGGTCCGATACGTACCATGTCGCTCAATTCGGCTAATGTTCCATATACATCGTCAAGGTTGGGTGATCATATCGGTTGATCTGCCCAGAGCGGTCCAGCGTGCGAACGCGCCAAGTAGAGGTAGAGAGCGCTACTTCTTGACATCCGAGAACGCATACACCGTAGATCTGCGCTCAC"))
+(assert (= z "aucauacugacucau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2
new file mode 100644
index 000000000..5f2bbe8c8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0305.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGAGGGCAGTCTGTCATCGGATCTGCGTATAGGCGGAGGAATGGTCGCATGTTAACGCTAGGCACATCGAACGCAATGAGACTATCAAGCCAAAAGTCTAGGACCCATTCGCAGGGGGCGATTTGAAACACAAAGCGAAGAAGCGTTTAAATCGGTCCTTGCCTTGGATAGTCGATAATTCCGCTTGGTGGCAGCGCTA"))
+(assert (= z "guaagagaauacuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2
new file mode 100644
index 000000000..e4abf71f8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0306.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAAGACAAGACACCGACTTAAGTTAGGGAACTTATTTATCTTGCGCCCGATCTATTGGGATTGTTCCGTGCAGAAGATTCCTCGGAGGTCGACCTATTATCTTGCGATTCAAAAAGGTACTTCGTAGAGCACGAGCAGATCTTCACATCGGTTCAACTCGAGGGAGTAGCCAAGTGCGAAGGTAATGACTTGACCACGTA"))
+(assert (= z "cucuugccuggcucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2
new file mode 100644
index 000000000..fb1aa62a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0307.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCTAGAGGCGCTAGACACCAATTCATACTAGAGATACGTTTGCTTTCAAACCGAATGGCGGTATTTTGTTCACTCCATATGACAGCACTGAGATTAATCACTAAGATACGAGGGTAGTAGTTTGCTGAGGCGTGATGAACGGACCACTTTGCATGGTACAAAGTACGGCCCAGTAACGTCCGAATCCTCGATCGTTCGC"))
+(assert (= z "ucaaacguuuagcgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2
new file mode 100644
index 000000000..2fbbb3d57
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0308.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTGTAAGCATGGTTATTAGACGCTCGGATACTGCGGTGACGCTGGCATTGGTGGTGAGCTGCAGTCGGGGCCAAGATTTAGGTACGGCTCTAAGTCCAGTAAGAAAATCGTAACGGTAGCAAATCGATGGACAGCACGCGGGACACGATCATCCTAAGAGTGCGTATCTTCCTGTTCTGTCTTCTTAGCTGGGGTGCCCC"))
+(assert (= z "ggacccauuucagag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2
new file mode 100644
index 000000000..85b8eb735
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0309.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGAAGGCGTCCAACCGTCGTCGAGTCTACGATAATCAGTGACTCGATTATCAGCCATGAATAAGGGCCAGCCCAGTCCCCTAATCGTTGTCCCTTGATACGGCACCCCGCGGAATAGGAGTGTAAATGTACACAGCGGCTACCAAGGAAGTCTTTTTGTTTACGCCACTAACATCAGGCAAGGGTAGAACCCCTGGAGC"))
+(assert (= z "gugggcuaggaacac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2
new file mode 100644
index 000000000..1c67a409a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0310.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCCACGATTTCAATAGGCCTGCTTGTTAAATGGTGCATTTATCGTCACAGCCTAGCAATCACATAGTATGATGTGCGGGACACGATTGCAATCGGGACGGCCTAGTTACATAACCGTCGGCGAGACCCAGACTACTTCTTGTCGTCATCTTCCTTAAGCAGTCTATGGCAGATTTGCGCCCCTCCGGTTAACGCGGTC"))
+(assert (= z "gaccuugcaaauagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2
new file mode 100644
index 000000000..e43b12b48
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0311.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATTTCGACATGGCCGACTCAAGCCGAAACACGCGCACGTTGACATTGTTTTCTTTCGCTAGTCAGCGGTCTCGGACTACAACGGACAACTTACTTCTCCATATAACATTCGCTCGATCGGAACTACACAGCGACTCGTAGAAAGAAATAAGTCCCACCTCCCGCGTGCTTGGTAGAGAACGATCAAGGCGTTTAAAATG"))
+(assert (= z "agcuaagugaugauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2
new file mode 100644
index 000000000..5d0d3ddf1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0312.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAGAAGCGTTGTTACCGACCTCATTTTCGTCTACGAAGGAACAGCCTAGATCCGAATACATTTACACTTCCGCCTTAAGATGTTCTTCGGTCGACCGGTACTCACAACAAAGGATCTCCAGTTACGGAAATGCGTGATCCTTACGTCGCAGACCCATAGTATGTCTAACGTCCTATTGCTATGAGTACTCCTTGGCTGGA"))
+(assert (= z "ggacccacagcuccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2
new file mode 100644
index 000000000..143219f58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0313.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAAGATTCACGAATCCTGCCATAGAAGAAATTGCCTAATAATCGTAGCGGTGAAGTTACAGTGGGGAACACCGGTGACTGGTAGTTGATCCAGCTACTGACTATAACGAAGTTAGCCCGGGGCCCAAAAGCACTTAAAGGGTCTCTTTCGAATACGCCTGCCCCTCATATCAAACTCTCCGATCTCGACAGTTTTTGCTC"))
+(assert (= z "aggacacgucuaguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2
new file mode 100644
index 000000000..dbc1397d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0314.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCACTCACCATAAGTCGTGCCAGACGCTGTGCTGACAGTTGAGGTTCGGTAAATAACAGGCGACCCTATAGCGTATATTCGCGCAATCGTTATGGGCAACAGCCCTATGGCCACTGGGTTTCTTCGGACAATATATCGTGGGTACGGATTTTAACAACTGATGACCACCAGCGGGGTCTACTTTCATTAGAGCGGGTCTT"))
+(assert (= z "uucgauagcugggcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2
new file mode 100644
index 000000000..ac9d4f567
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0315.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTGTAAGCTCCTTCAATCGCATATCGGACCCGCGCCTAAGTATGTCCCTGCGGAATCTCAGGGTCGGTGTGCTCCGCGAGTTGCGGTTTACCGATCGGTCTTAGGCACCTTCGTCTTCTCTCCTCCGCGCCCCGAGACTTTATTCAAGCGCTGGCCTTTCCTGACCGGCTAGATATCTATTTGCCTGCGCCAAGAGAGG"))
+(assert (= z "uucuaacgcuaggua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2
new file mode 100644
index 000000000..baf207a26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0316.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGCATTACCGGCACTAAGCTTCACACTAGTAGAGTGAACTCCTGGCTGCTGTCAGGGCCGCATTAAAGCTTCTGGCTTCGCCTTGTCATTAGGGAACTCGCCCGCGCTGACGGCCTTTATGTGGGATTTTGTGGCAATGACTACACGGAACACTGGTGTACTCTATATACCACGATCGGGCCGGACGAGTCTCCAAAGGC"))
+(assert (= z "uguauaugauaggug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2
new file mode 100644
index 000000000..e6f3bcaa6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0317.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTTGCATTCTTTATCCCGTTTCAGGAATAACAGTGTTCTTACCAGTATTATGTATTGGAACATTAGGTGCGACAATCCGTCCATCAGGTTTCACAAAGTGGACTGCCAATTTAACGGTTGTCGTGTGTGAGTAAGATACCAAACCGGAATCACCAACAGACTACCGTCTCTCACCCGTACTCAGCCTTCTCGTGACTGG"))
+(assert (= z "auacuacaacaugug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2
new file mode 100644
index 000000000..f17123d45
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0318.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTATAGGGGGCTATAATCGCCCAAAATCTTACCAGGGCCAAGAGAACTGCTTCACCGAAGGCGGTAGGCCAATGGGCGCAGGATTCGCATCCACGTACGGACGTCAATTGGCTGAAAGGGCCAACTACCGCTCATTGAGCGTTATCATTTTCCCTAACCATTACGAATTGTGGGGGATATGATGATCGAGCGGTCCATG"))
+(assert (= z "acggaacuucucgca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2
new file mode 100644
index 000000000..4550008f1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0319.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCAGTCAGTGCTTTGGAATTATGTACAGCGTTTCTTTAGACTGAACTGGACCCTTAGGTCTATGGTGTGGCTGAGTCTGACCGCATTGTCGCTCCCCCTGAGTGGAACTTGTTTACAATCATGCTTCACCGTAGGTGAGAGAGACGTATGGAGGGTACCAGAGAAGGTTGGGAGGCACCGGTCCGCGGGATGACGTAGG"))
+(assert (= z "caaguaucgguucug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2
new file mode 100644
index 000000000..95dfa5a7e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0320.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGTTGAAGGTCTTAACCTGATGTGTGGCTAAGCAAGGGCTTGTACAGGATCGCGGAAAAGCGGAACAAGCGCTCAGCGTGACACGCGCTATTTGCGCTCTTGTAAGGAATTTGGCGCAAACGTTCCGTTTACATAATATGCCAGGCCACTCTCCGCTAAGCGTAACCCTACGTGTAATAAAGCAATGTCTCTTTGCGAC"))
+(assert (= z "ggguucguuaacaau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2
new file mode 100644
index 000000000..5e965c29b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0321.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTCTAAAACCGTGATGAGCCACGTTCCAACTCCAAGTGATAATTGCAATATGACTGGGGACAGAAGCCAAAAGATGCGCTTGGGCACTCCCAATAACCTGCAACGTCTTGGAATCGGAGCCCCGGTCATACATTCAAGTGTTTAATGCTACGCCGCACGGATGGATACTGGGGAGTGAAGCTACAGTGAACTCATAAGT"))
+(assert (= z "guuaaugccccccca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2
new file mode 100644
index 000000000..b3232fd28
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0322.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCGGCTAGTGTGTTATTATTTTACTGTCGCAGTAGACGGCACTGGTGTGGGTCAGACGTGTAAAGGTGGGCCGCCGGCAGGCTTGTTATGGGTGCCAATTTCCTCTGCCGACTCTATCTTAAATCCCATTTACAGGTGCCACATGTATAAAATAGGAATCAATCGCAGTGCGTTAGGGAAGGTACGCGTGCTAAAATCC"))
+(assert (= z "uccgaugagauagcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2
new file mode 100644
index 000000000..b4a8ce694
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0323.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACGGTATGCGGGTCTGCTTTGGTGTTTTTCTGTGTCTGGATCTCTTGCACGACTAAGGTGTAGTTTCCCTAGCTTAAAGCGGTTACGCAAAAGCTCTTGCCGACTCCCGCTCTGACCAGCATCAATTCATATAGCTGCTTAATGGCGCTGATAAGACACGTACAGCAATAAGCCTAGCAACAGACGCGACAAAGTCTAT"))
+(assert (= z "gacucuuggagucuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2
new file mode 100644
index 000000000..bbd1bd41d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0324.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTCCTAGGTGGGTGCAATCACATTGAGGTCTGTAAAGCAAAATGCTTTTTATCGGGAATGATTTCTAATTTTTACTAGAGAAATGCCCATCCGTGGGCACCGACAATGACTGTAAGGGATGCGCATCTAAGAGACGGACAAATGTATGTTGGCTAAAACTTCCGACCTTTGCTCGTCGAATTTTGAGCATTACGGTAT"))
+(assert (= z "accggccaauagaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2
new file mode 100644
index 000000000..da105fced
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0325.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGCTTGCCCCGAAGCGTGTTATCGAGGATGCGAGTCACAGTACTAACCCTCACGAGTTTGTCCCTAGATAATGGGAAGTCACTGCCACAAACCACCGATGAACCCCAGCTCTCTCACATTCCACGCCATGTTTGGGCGCACATATTCACGTCCTGAACACAAAAAATTCAATTCGCAAGCGATAGAGTTCGTCAGTCTG"))
+(assert (= z "gcucaguuguugugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2
new file mode 100644
index 000000000..dc430e8b2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0326.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAAATACCAATTGTAGATGCGGTTGTGCTAGCCTAGGAACTTAAATACACAAGATCACATCGTCGAGAAAAACGAACCGGTGATAGTTAGGTCGACCCGGGTCAGTGAAGTCTAAGCGGCTCGGCCACATGCGGCCCCAGGAGTAATAGTTGCGGAGCACTGGTTTGGGACCCTTGGGACATAACTGTGCTTTCAATTAA"))
+(assert (= z "gcuccagaauuagag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2
new file mode 100644
index 000000000..d5af1ad73
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0327.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAAATAAAAGGCATAATCTACTTGTCTGCTATGGATATTGCCCATAATTTGCATTGAGTGCATTGGCCTTAAGAACCCCCCTGTCCCACGCGTTGCGTGTATTCAAGGGTTCCTTACAGCAGTGACTTCCGAAAATGGCACGTTACCGGCCGCAGTTGGTATTAAGCACATTTGGCCCTGCTTGCCTACGACATGGAGG"))
+(assert (= z "cauugcugggucgca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2
new file mode 100644
index 000000000..2a2a824dd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0328.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAGTCCCGGGCACGCTATATCACTGAGTGATAAGACCCAGGCCCAATAACCAAAGATGGGGCGTCACCTCTGTCGCAATACGTCGGTGAGTGTCCCCCTTGCAATAGTTATTGCTGTAGTTATCACTGAGCAGTCGGAAAGCCGAGCTCGTCCGAGGATGCCAGTGGGCAGCGCTCGTAGAGATCCCATAACGCCAAGG"))
+(assert (= z "guauccguacugcgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2
new file mode 100644
index 000000000..9b936a976
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0329.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCCTAGATGGTGATTCTGCTGACGATGGTACTGCTCCGCTTCGGATTCATAAAGCTACCAACGGCTCGGTTGGATTTGTGCGGCCTGTAAAGGAGTTAAACGTATGTTGCTTCGGGCTCCATCCATTGGATGCAAGTAGGCGGTTCTTGGGCAAGGAGTCGCGGACCATTATCGGACAGAGTGGAAGAAGATATGTCCC"))
+(assert (= z "ucucgcgccugucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2
new file mode 100644
index 000000000..06d3302a2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0330.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGAACTATGGACGGGAATCAGTATTCGATCTGTCCACAACGAACTCTTGTATGGTTCACGGGTAGTAATCCGCGGCGTTGGGTTGGGGCGTTCACGAGCCCCTGCGCGATTCGACGTAAATACATTACTTGAGAGCAGCACCATGGCGCGTTCGCCGAAATAGGAGGCGGGCCATGACAGTATGAGCAGCGCCTACCAAC"))
+(assert (= z "cucguggaccacgcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2
new file mode 100644
index 000000000..ae75484d5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0331.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGTATAGCCCAAAGTCCATGGCGTAGATATACTTTACTTCAAAGTTCCCTCAACCCAGTTAGCGATACTACCGTGTGATGTACGTATACGCATGTACAAATTGACTGCCGTTCCTTTCGCGACCGGTGGATGCACGGCAGTGTAATGATTAGCAAGGCCCTTCGAGAGCCATCTGCAGGACGTGGGCATAGTAGCGCTC"))
+(assert (= z "uaacccugguuccaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2
new file mode 100644
index 000000000..dfa3c3108
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0332.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTATGAGCTAGCCTTCCTCGGCAAGTATACTCGCCCTCTAAAACCCAGATATGAGCTCGGATACACTCGATAGACGGATATTGTGTAGAGACCAGTCCTTACTTATCTCATAACGCTGCCCGCATCCTCTGCCAGAAGAGCTTTTACGACCTCAAAGCTCTGTCTCTGCTTATTAGCTCAATCGGTCGTACGGAGATAA"))
+(assert (= z "ucuaucguugagaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2
new file mode 100644
index 000000000..7bfaf7929
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0333.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTCTCTGCTCGAATCTATCCAACACCGTGCGAGCGTTTCGAAGCGATAGGTCTACGGCAGTGCAACTTAGTGTTTGAGAATAGCGGCCTTTAAGAGGAGACCCCATGATACCCGTAAGTCCACGACTTACGGGTTGACGGTTACTGATTTCAACATTGTGGCGGCGATCGTCGGGGGGCGGCCATTGGCATCTTAAACG"))
+(assert (= z "acucgugguccaugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2
new file mode 100644
index 000000000..8faab1e4b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0334.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGGCGATTAAGAGAACTCAAGGATAGGGCATTCGTATATGGCTCGCTAAGGCTTTGCGTCTCCGACCTGGTTTGTTAAGAAGCAGTTATACGAATGATCTAATATAGCTATACTTATCACACAGGTGCACCTGCGGGTAATTTTCTTGTCGCGGCCACACACGAGGGTGGCAAGATTGTATATGTTCTCTCAAAATCCG"))
+(assert (= z "cuacugaugaccagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2
new file mode 100644
index 000000000..993ca1836
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0335.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTATTCTAAGTTCGGCGCCATATGTAGGCACTGAGGACCAGCGTCTAGTTGCGAATGCACGCTGTTATTAGAAGTACTGTAGGACGCGGCTCACAGGGTCGGATTCTTTCAGAGCCGGGTCCACTACGCCTCTGAGGCAACGTTACCGGAACAATTTGCAGGCTATTGCGTCATTGGCCATCATATCATATAGCACAGA"))
+(assert (= z "acagggggaacuccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2
new file mode 100644
index 000000000..57d6a30c6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0336.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTTACGCTAAAGCAAATAAATAGGGTCATGGGGGTTCACGGGTGGAACCGGACAGATGAGTAGGTGTTAAGCTAGCAGCTCAGGGAGAGATCGAGGTGTACTTCTCTTGATTCCTATTCGGCAATCCGGACTACCCACCACTAATCCATTCGTACCCGCGTAACAACGTCAGCGCCACTCGAACCCAGGTACATTCACA"))
+(assert (= z "ccaacuaacuguccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2
new file mode 100644
index 000000000..245dff301
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0337.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGAGTCTGTGTGCGTCTCGAGTCGTACTTGCGTGGACCGTTTGCAAGGAAAAGGGAATGTGTAGCGCGGCTAACAACTATGAGTAGTGTTCAGACTGCTCACTTGCGCAGCCCGGGCCCCTGGGGTCTGCATGCGGCGGGATAGTCAATGCATAAGGTATTCCGGTATCCGGGTGTGTCCTAAACCTAGTTTCATCCGG"))
+(assert (= z "cgcgucacuuuggcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2
new file mode 100644
index 000000000..4442ca8a6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0338.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGCGCCCGCGCTTCAACTCGTCGGTTACTAGCCACAGGGTAAGACTCTGCAAACTTTGGCAGCAGCCCCTCCGCCCATCACCGCGAAACACCATCAAAATCATAACGATGATGAAATCTATCGTACCGAGCTAATCTTAGCGTGGCAGAGGCCCCCGATAGCACTAATTGCATTTATTGCTCCATGACACGCTACTTAC"))
+(assert (= z "augguccgcguugcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2
new file mode 100644
index 000000000..e29e180ae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0339.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCTTGATTACCGAGTTGTCTATTCCGTCGTCGTTAGACGCCAGGTTGAACATATTGACGTAGATCGTACACTCTCTATTGCGCGGCGTCTCCAGAGATATCCACGGCAAAAACGACCAGCGACGAGATCAACAAACATTCTTCTTAGTGCAAGCATGGTGGCTGCGAGGGGGTGAGTAGTAAAATCCCCGTTGTTATG"))
+(assert (= z "gacaaccgggaugcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2
new file mode 100644
index 000000000..231cc5a1f
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0340.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCGGAGCGCCATTCTTTCCAGTAGGACCGATGCGGCGACGTCACACCCCGAACGATTAGGACTTAAGATTGCGCGTCCATCTGCATTTTAAGTAAAATCCCTCCTGATGGCCCTTCGTCTCACTCGAAGAAACCACGCTTAACACCGAGCAAAGGCGGGGAGCCCAAATGGGTTGCCGGGATCGTACTGCCCAACCAGA"))
+(assert (= z "accauacccgacaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2
new file mode 100644
index 000000000..c18ba4f0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0341.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGCAAAGAGGAGTTCTCTCTGAGTAACGACACCTAAGCTGACACCTGACCCCGCACAATTGACAAGTATTGAATTAGTATTAAGGAAAGACTGCCCTGCTCCGATACAGGGGGCACCTAGGACGCAGGTTCGTTGTTAGGCTTTCCGCGAAAGAGCTGCAGTAAAACCCCAACCTATCTCTAACTTCAGTTTCCGCTATT"))
+(assert (= z "ucccgcggggggaau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2
new file mode 100644
index 000000000..94c10a974
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0342.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTCGGGCCCTATAAGATTGTAGAGCGGCCCTGGAACTATAGTCCGCAAATTCAGCGAGCCTTAGGTAGAACCGCGCACGGCTCTAGTGACAGGTGGCAGCCTGCGTTTCTCCCATTATTGATAACCCCTCACATGTTAATCGTTCAATAATCAATGGGATAGATGCATCCGGTTGCTAATGGGGCTCCACGACCTATGC"))
+(assert (= z "auaacguucuaaucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2
new file mode 100644
index 000000000..8a92cd16b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0343.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGAGCGTCGTCACGGCGTAATTGAGTTGGCTGTTACTTAGCACTATCCAGATAAATTCCCCCAACCGCCTTGGGTGGCGATATCGAGACGCGATTAAGCACGGTATTTACAGTAGTCAACTGTTACCACCGCTTCATCGACCCTACTGGGCTTTGCTCCCGTTTGGAATGCTATTACGCGTATCAAGCTTTTTTGCATC"))
+(assert (= z "cguauguagcacguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2
new file mode 100644
index 000000000..e4d3b5476
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0344.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAATGGTATAGGAAGCTTTCTTACAGCTATGGGGTTATAATCCGCGTGGTATCTGATCCGGCTCTGCCCACTGCTCTTATTGGATTGTTGCCTATTTAGTTACGACATGTACGTCACAGGTCTACGGGCCCTAGTAGCGGACAGCGCGTTCTAGCAGACTTAACGACATAGGCCCAAGGCCCGTAACCTCTGCGCCCTGG"))
+(assert (= z "agggcucaguuucca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2
new file mode 100644
index 000000000..192bbe6ce
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0345.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACCGGCTCGGGTGGCGTACACGGGAAAAAGTCCTCTGTAACGATAATGGGAAGGTACACCATGGCTCGGAGCCGCTCTAGCTACGGGACCACGGGCTCTTTTCCGAAACTGTGAACCTTGGATTTCTCAATGAGAAGAGAAGCGCATGAGTTCGCCCTCGTATGAACGTTATTCGCGCCAGGTCCTTGCAGGCATAAAG"))
+(assert (= z "augccaugggacugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2
new file mode 100644
index 000000000..06b162666
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0346.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCGCTACTCTTCTCGCAGCTGAACTGGAGTCATCTTCCGCCTTGGAAAGTCCCCGATTCAACGCGAAAATAAACTTCTTTTGTGAGGAGCGATCTGCCCAATAATAACGTGCATAGCCTCTTAGGGTAATAATATATGTGTCATCGGACCTATGCCGGGGTTCCTGACCTCCCCATACATACGGTAATAGATATTATCA"))
+(assert (= z "ucacucaugacgucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2
new file mode 100644
index 000000000..2a32aad3b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0347.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCTGGTCTGTCTTCTAGGAACCGGCTTTACGGAATGATAGTATTGGAGCGGTTACGGTTCTGAGATTGCTGCGTGCGAGAAACAAGTCATTTATAGCTAGTCCGACTGTGTAGTTTCCTGGGGATTAGCCTGTAGCTTTGGCGCTTTCATCGTCCTATCGGAGACGTACGGGTTCATCAATTGCAAAAAGTATATCAGC"))
+(assert (= z "auagcaaacauguac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2
new file mode 100644
index 000000000..0a6c59eca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0348.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGGCCAGTGAAGACGACCTAAAACGTATGCTCACAGCTTGAATACTAAGCCGTTGAGTTTTCGTCATACTAGGCCTCTGTTGTCTGTGTTGGGACATCCGCCGGTTAAGATTTGCGTTAGGTGTAACCCGCATACCGGTTAGACCTCATTCCGTATATGGAGCTGCCCTCGCGATATAAGACGGTAGAGTATCTAAAAGT"))
+(assert (= z "ugagcgccauuguca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2
new file mode 100644
index 000000000..577e72bac
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0349.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAGCGAAACTTCCGTCAAAATGTACCCTATCAGTTATGTTTACTAAGAACACCCTGAAGGCAAATACCGCGTTCGGGCCTGAAGGGATAAAAGGACGGAACTTGCACTTTCTACGTGTACGTTCCTTGCTCACAAGTGCCGACATAATGAGTTTTAACGCGGCAAGCGCGGCCACATGGCTGAAGGGATCGGCTACATTT"))
+(assert (= z "uccccuugucgggag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2
new file mode 100644
index 000000000..cf9a3a480
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0350.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGCCAGTTTTCGTGGACAGTTCCCACAACAGATAAGTGTGTCCTGGTACCCGAGATTTAACTGATTGAGAGCTCGAAGTCCATCGGTACGTGAGATTGTATGCTAGTCCTAGCAAAGCGGACCTACATCTTCTCACTGATTCGTACCTGCGTGTAGCCTCTTCTTCGCCATCATTATTTTAAGGAGGGCGTGGGACAGTC"))
+(assert (= z "aaaggaccuagucgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2
new file mode 100644
index 000000000..fd1513375
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0351.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGTTGGGACGCGCGTTCCTGCACATCAGGCGTCTGATACAGATTACTTCCGGAGAGGCTGAATGACTCTAGGCAAATGTCCATCGATAATCGAGAAGGAACCAGCCGGAAGGGCGGTAATGACCAGAATCTCGTCTTTGAGCCCCAATAGCATTAGATGAAGGGTTCGGAGTGTGACTTTTCCTGAACTACCTAGGACGC"))
+(assert (= z "gagcgacacaguguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2
new file mode 100644
index 000000000..3357e8e3c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0352.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTATCCGTGTTCGCAGCGGAATTTTAGTGCATACCCGTGCATGTCGGAACAGAATCGATTTGTCGTAGAAGTCGCTTCGGTGCAAGCGCCGTTATGGTTTAGGGTTGGAATGTCTAAAGCATGTCATATTCCACACACACCGTCTCTAATTCGTTCAGCGGACCCTAGGTCATCAATGCCTCGTTGGCTTAGACCGGGC"))
+(assert (= z "uggcccauucacacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2
new file mode 100644
index 000000000..89d553163
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0353.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACCAAGGTGAGCGTATATACAAGCTCTTAGTTATGTTCTTTTACGCTGGGACTTAATGCCAAAATAACTCGTGGCACTAAGTATAAGACCGCGATTTCAGCATCCTCACCCCGTGTTGCCCCTGCTTTCAGAAGATGGATGCTCGGCAGGACCTGGCGCGTTTATCCCGTTGCCCTGGCAAGTGATGGGTAACGGTGGG"))
+(assert (= z "cguggagcggauccg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2
new file mode 100644
index 000000000..d76f3a8e0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0354.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGATGCAGATCTGCTCAATTCCTGGCGACCTTTGCAAACGGTATTCCTTACAGTTCAAAAATAGACCGAAATCATTAGGACAGCCCTGTTGGGGATTGGCTTTCCTAACACACGCGTAATAGGAATCCTTCATACGGCCTCAAGCGAATGCTCGGTTTAGATGCGTGTAGTTACATTTTGCCTGTAACAATCTTAGCCGT"))
+(assert (= z "accacaacgagcgau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2
new file mode 100644
index 000000000..9110039b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0355.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGCTCGAGGTTACGAATGCTCGCGAACGTGTTGGGGCTGCTCCATAGCCCTCTCCCCGTGTCCATTCGCCAGCGGTACTCACTTTGTGAACAATCATGATCACAAGCCTCGCACAGATGTTCGGATCGGGTCGCGCCGCCATGAAAGCCTAGGGAGTCGAAGAGCACCTGAATCCCTCACCCTCATAGCCATACGTTTT"))
+(assert (= z "ggaguggacgaguga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2
new file mode 100644
index 000000000..1b2a2c4dc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0356.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTATGAAGTAAATTGGTGTCGCAAGGCTCAGCTAACATCATGGATTGGACGTCCGGCGTGGTCGGTAATAAGCTTACAATCTATGAGATTGTGGACCACGTCAAGTTAGCTGTGATCCTGCATAAAAAGCTTCCCTTCAGGATATGGCCCTTCAGCCCTAGTTATGCCACAACCCGGGTGTAACCATCGCTGAAATTCG"))
+(assert (= z "ucacguagcuuccuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2
new file mode 100644
index 000000000..cb65dabe2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0357.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACGCGGTTACTAGTTGATCAAAGCGGTTAAACATCCTCATCACGTGCCCGTGCCTCGAGTAGAACGAAATTCTCTGCCGAGCAGCTGATCTCTTCTCAGTCCATCAATGAGCGACAAGCAAACTCCACCTGCGAAATTTAAGCACGTAGTCATATATTCAAAGCACATGTGACTTGACTATCTTTGGCTGGAATACGCGA"))
+(assert (= z "uuggcaugcuuuuga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2
new file mode 100644
index 000000000..4a821fcb0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0358.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATCGAAGTGGCTACAAAACTGTGCACTGCAGACCCAACCAATTTAAGCAGCGACGTCCCGTCGCTATTGGGCCCTATACCACAAACGGACCGCACATTGCTTGAAGTGCCGTCCTGCGAGGTTCTGAACACTGTCAGATTGGGTATGGCCAGGTGAATATAATGGACTAGCTCGAACGTCTGGTGTCCTTAGGGCTCCAC"))
+(assert (= z "aucgcgagaggacug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2
new file mode 100644
index 000000000..d6d993321
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0359.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGATGTCAGTGGGAGTTTCGGCCTTAAACCCTTTTTGGACTACACATTCTTACTGCGTACAGATTGGATTCTAGGGCAATAAATACCGGGAAATATAGTGTTGGAAAGGGAGTTACGCGATCGTTTAATCTTGAACGCGCACTGAAGCTCACTCATGTCGTCTCGCCATAGTGGGTTGTCTGCCTCCGGTTGGACACGT"))
+(assert (= z "auggccaucaucuag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2
new file mode 100644
index 000000000..333cadaeb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0360.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTAACGACAATATCCTAAAGTGGGACTGACCAGCTTAGGACCACCTTGTTCGCGGCAAAAATCATATGTGAATCAATGTCGCGACGATCAGTACTAGCGTATTCGTGATTACTACAACGGATTAAATTGACCGTATGCATTTCAGACTTCTCTCTCGCTAGTGGCCTCATCAGCGTAAGATAATCAAAGCATCATTCCCT"))
+(assert (= z "gaaauaugccgucug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2
new file mode 100644
index 000000000..ea7e90cd8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0361.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCGGATCGACCTGCTGTCGGTACTCTCACGAGTGTACAACGTTTCGCCAGCGTCTCCCCATACTCATCGAGATAATCTCCGAACAGGACACATCGCTTTCAATCCGCAAGAAATTCTCTTAGTGTGGTGGTCACCTACAGGGATGTGCTAAGGGGGGGGGACGAGGTATTCCTTGCTTGGCCTAGTACATAGAGTACTC"))
+(assert (= z "cgugucacucguagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2
new file mode 100644
index 000000000..c2c130747
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0362.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCAAAAGGATGATGATGGCGAGAGAGAGTTTACGTCTGAGCCGAAGAGCATATGAGGATGGTTTGCGGGTGGGTTGGGAAAGCTCCAGTAGAATGCAATTACCGGCTATCCACGCGCATAGACACCAGTGAACGGACGCTATATTGTGGAGCATCAAGAATTTTTGGTCGCGCCTTAAACAGTTGAACCTCCGAGCGG"))
+(assert (= z "gcauugauccucgug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2
new file mode 100644
index 000000000..15a430bfe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0363.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGTCCACGATATTGCAAGACGAGGGATACTTTACGCATAGCTTCTTACACACGGGAGAAACCGGACTAATTACACTTGTAACAGTAAAGTAGTACATTCCGCTTGTAGGCTGGAAAGGGTATACCACCTCCGAGTAGCGTTGGGCTATGCACGGATCGTAGTTGTATTCTTTCATCGTCCCAAGAACAAAGATAGGAGA"))
+(assert (= z "auguggauagagacg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2
new file mode 100644
index 000000000..cf08d15ef
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0364.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCTTATTACTTATACACACGGACCCAGGTATGGCGAGTTAATCTACGTCATTGCTTTTGCCCATACTAACATGAGTGTTAGAAGCCATCTCCCCTTCAAGTTTACACTATCCGCAGTGAATCATTTATCACCAGACGCCAGCCATCGCCGGCAAAACTAAAAAGACATGCGATCGTACCGGGAGGGTTTTCGACCGCGCT"))
+(assert (= z "uaaccgcguugucgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2
new file mode 100644
index 000000000..370f4f1e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0365.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGAGTACTGGGGAATGGTGATTATTTTACATCTCTGAAATTTAGCACGGCTCCAGCGCGATGCGTTGATCAAACGCCCAGATCCGGGGTGCGTGCGTGAGCGGCTTATAACGATCAAGTTAGGTGTTTGGTTCTTATCGATATGCTACGCGACCTTTCCTGATGCCACAAGCTAGACTGGCCGTGGTCCTATAAGTAGGT"))
+(assert (= z "agaugcggucuaucu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2
new file mode 100644
index 000000000..16ba14d23
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0366.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGGTAGGACAAAACCTCTGTCGAACACTCGAGGTTGGTTCGCCGATCGGTGCCGTCTACAACGTGAGAGGCCTGATCTTAATTTTCGGCTGTGGACTATGTGAGGTCAGAACTCCCTTTAATCTGCGATATAGGCGTCTGTATAGGCCTTTATACATCTACCCAACCAGGTTGCAGCGTGGCAAACCCAAGTAGAGCAA"))
+(assert (= z "ccaacagcaaucgug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2
new file mode 100644
index 000000000..cfa2e62e4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0367.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCAATGCCCATGTCACCCTCGTAGAACCACATGTTTAAGGGGAGTTTCTCCTTATCGGGCGCGAATGACTGGACGTTTAGGTCTAACAGCAGTCTCTGATAAAGCCAAACTGCTAACAGTACCGTTGTACTCCTCAGACATCGACGCAAGATATTTCCACAGGACATGGCTGGCGTATTCTCACCGATACTAGTATATT"))
+(assert (= z "acgggcaugguguau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2
new file mode 100644
index 000000000..a3e9077d9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0368.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACACCTTGGGATCGGGCAGCCGGCTAGATTGACAGCATAAGCATGCTAGGCTCGCCTCGAAGCATATGGGTAAGTAGCCCTTGCACTCCCTGACGCTTAACAATGATTTAACTGCACAGCCTGTCATCCGACGTGAGGATGAACATTGAGTTCGTAAGTCAAGTAGGTGGGCAGTCCTCGGACAGCGGCGGTCGAGGCTA"))
+(assert (= z "cgcgugauguuuugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2
new file mode 100644
index 000000000..0680fd58e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0369.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAATACTAGTTGAGGACCAGCTTAATCAGAAGCAGGCTGTCGCTGTTCGGGTATAAACTGTCTTCCAGCTCCCAGTAAGATCTATCTCGCTATACAGAAGTCTACAACCAATCATTACGGCGTGTCAAACCTTAGAAGCTCTACAGAGGAGTCATCGTAGGCAAAATGAACTTACAAGGTCCGACCACTGGATAGCGGG"))
+(assert (= z "ugacuccaaccaacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2
new file mode 100644
index 000000000..84f8eb0bd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0370.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGAGGCTTGATATAGACTTATCAATGGGACAACGTTAATCGTTTTGAGCGACGTTAGACCTGTTTTGTCCGGCTTCATTCTAAATTAACGAAATGCTGAACATACAAGCCTTCCAGCAAGCGATTTAGATTCTAACCCACGAAAGTCCTGTGCGATGACTTGCGCGTGAAGTTGTATGTAGTATTCGTCGTGCACTTCA"))
+(assert (= z "cgauuaucauccauu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2
new file mode 100644
index 000000000..20ef269b0
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0371.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAAGCATCGTAGTCAAAACACTGTTACGGTGCTTCGGAAATCCGATGCTCTCCGTCGAACAACATAATGTGGCAGTCAAAGCCCGGTTGAACTAGCCGCCATTGCTCTGTCCACCGGTCCGTGCCACGGCTAATGTCGCGAGTGGGCGCGCTTGGTGACAATAACGTCGTACCGGCAAGCCCCACGAGCTCGCTAGATGT"))
+(assert (= z "cgggauucuuaagga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2
new file mode 100644
index 000000000..eb9ab66cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0372.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGTGGCCATTAGCGAGAGATTTTACGGGTCGTATAGTACTCGCCTGGTAAGTGTAGTGCTCTAGGTTGTCACTGAAGACGTGTACACGACTCTTCATGTCCTCCACCAAAGGTAGTTCCTCGTGATACAAATCTAACAACCAGAAGCCGCTATGCATCAAGAGGCTAAGGTGCCGAGCGTATTAGACTTTAGCACTGCG"))
+(assert (= z "agccgauuuguaaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2
new file mode 100644
index 000000000..17f83a4c6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0373.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAACGGGCATCTGCTATTTGTTCGAGTTTAGGCCAACCCTGGACCAAGGCCACTCCTCCATCCGATGGGCGGTCCCGAACGCAACCGAGCGGATCACGCTGGCGTCTGTTATGACTGGATAAGGCGTAAGACGGCGTGCGCAGCCGTGGGAAAGTTTTACACACCCGTCATGCGGATTAGCAAACCGGACGCTAAGACT"))
+(assert (= z "caacccugcacccug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2
new file mode 100644
index 000000000..d80ae4dd2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0374.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATTATACACATCAGTACTCCACTATGCACGGAAGGCGGCAGGACATGGCTGGGACAACAGGCAAATCGAGGTTACGCTTTTTGTATAAGGTACATCTACGATGGCAGCTAAATGCTGCTGACGTCCGTCGAATTTTACGGGACAAGGCCACCAATTCACCTTAGCGGCCTCTGTGAGTACAAAACCAATACCATTATTC"))
+(assert (= z "gaguugguaccggau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2
new file mode 100644
index 000000000..aa6d5efad
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0375.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGAATGCGCAAAAGCCCTAATCGAGTACGCTTCCCGGCCCTGTGTATACAGGCTGTAGTACGCTCTAAAACTCGATCCTAACAGGTTGCCGCCTTGACGTCGTATAGATATTCGACGCGATGGGCAAAAAGGCTCGAGCGCTCTTCTCCTGGAATAGTTTGGCGAGAGTAAGTAGCAAGCCAGTTACTCCGGGGACGGCG"))
+(assert (= z "cuucguccgguggaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2
new file mode 100644
index 000000000..ba4cf3242
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0376.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACAGCAATAGCAATAGCCCCGCGTGTCATAGTCCGTTGGATCACCGGCGGGGAAGCGCCTTCATTCTACAATGAGGACTCGGAAGTCCGATCAACGATCAGGGGCACCTTCGGGACATGCCTGGTTGGACTACAGAGGTAAATACGGGGGAAGGCAGCCTCTGCCATCACTCGTCCGAGTACGACTGATTTCTTCATAAG"))
+(assert (= z "uacaaccguuuauca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2
new file mode 100644
index 000000000..3a21b21ae
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0377.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCCTATGATACGAAGCCTACGGATAGTGCATCATCCACTAGTACGAGCGAACGCATGTCGTCTCCCTTCCTGTACGGCCTATAGTTCTCCTCATGTTTCACGTAGTAAGTACATTAAGTCCCACCGTCGCTTGACATATTCTCCGGCTAGTATACCAATCGGCGGACACCTGATCCTCCGAATAAGTTATCTCAACTTG"))
+(assert (= z "cuaccaaggcuaggu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2
new file mode 100644
index 000000000..1b6796549
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0378.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCGGATATAAGATGGCGCCGTGTGTCGGTCTCCCTGAACTGGGGTCATAGATCCCTGGGCGATCCCCCCCAAAACAATTACTTTCGCATGTCCTTATTAGCTATGACCGCGATGCAATATGAGGCACGAAACTGTCGTACATGACCATGGTGTATTCAACGGAGCTATAATCTTGGTGTCCGATGAGGAAGAGTGCTCA"))
+(assert (= z "cugccgauauguaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2
new file mode 100644
index 000000000..ea0020175
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0379.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGATATATACAAACTTCGTGAGAAGGTTGCCCCGATGACGCATCTCCCGTTACAAACTGCATGGAGAAAAATAAATAGGAATTATTGATTTCTCATGCTTCCCAACTTCTTCAAAGCGCACATTATACTGCACTAGAGAACTTTCTACTAACTGTAGAGTTACAACATGGTAGCGGGTCATGGTCGGACCAGTGCGGCG"))
+(assert (= z "ccugucgguacugua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2
new file mode 100644
index 000000000..b7497b000
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0380.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTAGGTACATCTAAGTCAACACCTGTCCGATCACCTATTACGCCACCGGAGCAGTTTGGCTCCCTGTTCTTATGACTATGGAAGACGGCTCCCGCGCAAGTGGCCAAGAACCCTATTGTCCACATAACTCCAAACCCAACTGTACGTGGGAAAAATTGGAAGAGCGGACAAGGACTAGTTTTGTTCGTCCCCCGTAGCA"))
+(assert (= z "gugcgaaaagaauga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2
new file mode 100644
index 000000000..3126861c8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0381.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTCAAAATCCTAATTCGGCCTACACTACGGGAACAACCCCTTGTAACTTGATTACCCAATGTTGTATACCTATGTTGACCCAATCACGCGTTCGTATCCTACCCTCCGGCTCGAAAAATTACACTGGCCTCACAAGAGTTTGCGTGAGGATCGGGTATAATATCTGCCTTTGTGAAGCTATCTTATGGGTAGACGTTGG"))
+(assert (= z "aaggguuugaauugg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2
new file mode 100644
index 000000000..dfd7bc553
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0382.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGGGAACACTGGACCTGTTTAGTTACACGTGGGAGGAGTCGAGTGGGAACCTCTCTAGACACGGTCTTACAATATTTCGTCTCGCTATATAACGTTTCTCAAGGCTTCTGCTTGTGCTGAAAAGACGGTAAAACTAGCGTAAGATGGTAATAATACGATCTCCAACGGAGTGTCCTCGTAATACGTGAAACTGGCTTATC"))
+(assert (= z "cuuugguacaguuug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2
new file mode 100644
index 000000000..440814b5a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0383.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAGCAAAAAACTCAGCCACTCTTCCATATATAAAATTCTGCGTCGATGCCTTAGTCTCCCCGTGGTACCGTTAACCTTGCCTGCCGTCGTAGGCAGCCTGTTGAGGGTCTTCTAGTGGTACGTAGTCGGAACGGCGCCCTCTTGGTCAATACCCGCGTCGAAGATTATGAAATACAGTTATCTAGTGCCTGAAGACTTT"))
+(assert (= z "cuguggauccagacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2
new file mode 100644
index 000000000..c6552d760
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0384.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAAAGCCCTCATCTCTGGTTGTCTCGCGGATACCTGTCACGCGATAAAGCATATGACTATCACCTGTACTATATTATGGGAGGTTCCGTCTGGAGCATAACCCCCCGATGGCCCGTCGAGTCAAGGGCACGTGGAGAAATGATCCCTATACGCACCTCGGGACTCTGTTTCCTCAACCGAACGCATGTAGGGTGGCTTAC"))
+(assert (= z "uauugaaccuccgaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2
new file mode 100644
index 000000000..0fd29e316
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0385.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACAATCCCGGTGCAATCAATAACGTCATCCAAATAGCTCCTGTCGACAGTAGATTCCCTAATTTGTGGTGGTGCGACCGGTTTCATCGGATACAAAAACATTCGCCGTGAGGCGAGCCAGTGGCTATACCCGTAGTGGTCAGGAAATCATATTAAGCATTGAATCTTCTGCAGCCCCGGAGCAGAACTGTGGTTGCTAC"))
+(assert (= z "accguagaauagcac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2
new file mode 100644
index 000000000..0b9b186d6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0386.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCAATCGAATCATAACCTCTCCGAGATCCGATCTGTGCTGTATGGGAGCATATGACGGGAAGTTGGTCGTATTTAGTGCGTCATTCAGAAATTGGCACGAATTCGAGACGGTTTGCAAAGCTTTCTCTTCAGGCTTAAAAGATTTATGTCGTCGTCCACGAATCTTTCGACACTGACCTCTACTTAAAAACCGAGAGCGT"))
+(assert (= z "gaaacguaggcaacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2
new file mode 100644
index 000000000..e3f4a091c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0387.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCCGAACTTGCATACCGAACCTAGCACGGTGGTAAGCCGACCCTGAGGTCGTACATGACGTTTGTTACTCTCCAGACGCAGTGGCAGCTCCGGAAAACCATCGCGTTTACCTGCGAATTATCTGGAAGAATTCCACATGAGACTCTTATTATCCCGGTATCGCTAATTCTGCTCGTCACTCTGGCCTGATGAATTGCCT"))
+(assert (= z "agaguggaugagccu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2
new file mode 100644
index 000000000..9957e04a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0388.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGCCCTGGGGATCGAATTAAAGTCGTTCCCTAAATACGGAACGTGGACTCTAACCCATTTCATCGCGTCGAAATCGGTGGCCTGCTGATGCCCCCCGGTTGCGTGAGCTAATATGCAAATGTCGTGGGTTCCTGTGAAGGTCAAAGCTGGTTTACGGGGAGACTACCAGAGGCAGGACAGTAGAAGAACGGAAACTAGAT"))
+(assert (= z "gaaagccauguguag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2
new file mode 100644
index 000000000..5894eb1cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0389.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCGAGACACCCCGGACTCCTCATGAAGCTGCATATTAATGAAATGTATCTTCCCAATTCCCTAGGCTGACGAGGACGAATGCGGGGCATCTATGAGCTTGCATTGTCAACCTTAGGTTTACCAAGAGGGGTATGGGCCAACTTACTGCACAGTCTAGTAACTTGAAGGCAGATTGTTAGCTGGGGGCTGGAGTGACTCGC"))
+(assert (= z "auuggucacgacaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2
new file mode 100644
index 000000000..9af2403ea
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0390.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTTAGTCCTATTCGGCCGCGCCGACTGTGACTCGCCCCGATGGTGTGATTATAGGTGGGAGGTCATCACCATAATCGTCCTTGCTTTAACGTGGCAGTGTCACTCATATAGGGGTTTCAAACGTCAATAAGATAGGGAGATGATCCCACGCCACCTATAAATGACTTCCGTAAACAGAGTCCTGCGACCCCCGATGCGG"))
+(assert (= z "ugauaaccagcauuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2
new file mode 100644
index 000000000..205802fcb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0391.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGCGACTTCTCTCGAAGCTCAGTGGAGCCCGCTCACTTAGAATAAAGATTCGTCAGGTCCTAATACATTGGTATCGAGTCTTAAGGTTGGATGTGGGAGCTGGTGGCTGCATGCGTTTGACGTACATTTAGTGCACATTCATGTGGCCAGTATCCCGCTGTCACCCAAAGTGTAGTCTTGTCAAAGTGGTTTCGTTGAGC"))
+(assert (= z "cauaaacaagacaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2
new file mode 100644
index 000000000..f9d1eb3a9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0392.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAGTAGGGCACGGCAGATATCTCGCTCCCGCCCTGAGAGCCAGAGCTAAACGAACAGCGATCTTGTGTTATTGTACGACTAAATTTGGTGAATTTTACGAGTCTGGAGCGCTAGGTTAGTATATGGTACAGAAGAGCAGACTCCCCTAATTACACTCTAATCGCGATGTCGTAGCAAATATGCATGCATCTTCCCCATGC"))
+(assert (= z "aucgauacggcuguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2
new file mode 100644
index 000000000..104693791
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0393.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTTGTGGGGCTGTTGCCCGCACCGTGACACCGTGTACCAGCAATTACACATAGGAGAACGGAGCCTTCCCGCATTATCGACCCCCAAATCCCTGTCGCACCACCGCGAAGTATGTCCGTATGCAAAGGACGGACTCAGTGTTGCGAAGTCGCCACATGAGTCTGATGAGACACTGCAGCGAAAGTCAGCTACTCTACAA"))
+(assert (= z "uccgugggccccauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2
new file mode 100644
index 000000000..a01a11999
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0394.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCATCCACACCGCTAGGCACCATTCCAATAGTTGCCCCAAACTCTGGCAATGACAATCTAGGCCCGTTCTACTAGCACGTCTTGTCACGCGTCGTGTGTGTCTTGGGAGATGATCGTGATAGTATATATGTTCGCGTGTTACGACGTCAGGGCGCTAACGCCCAGTCTCAAGAGACCGTCTCCTGGATGAGCTGAGCCTT"))
+(assert (= z "gagcauucuccuugu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2
new file mode 100644
index 000000000..643804187
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0395.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCACTCGGACGGAACCGTGAATATGCTGTTTCATCCGTAAATCGAGAGCCGGTACTCATCTCAGTTAGCTGTGTTCAGACGTTGGCAGCGGACTCCACCGTCTTCCTACAGTCTTTGACCCATCGCGCAATTGCTAGGCGAACTCTACTCATAAACGAGCGCGCTGATAATGGGACTATCGTTCGCAATCAACGTACAAC"))
+(assert (= z "gccgcuggaaagcag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2
new file mode 100644
index 000000000..0048346e8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0396.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAAGTGTTAATGTATAGCCGAGCCAAGACGCGAGAACCCTTTAGTAGAACATGCGGGTTTCGAAAACGAAATCTCTAAGTTATAAGGCGAGCGAGCAAATATTAGGAGGGAATTCACCGATACAAGACCTTATCCTTCCTACACCAATCACGTTCGAGTCTTATTTATGACTCTAGGGGTGACAAGCATAATGAGACGCA"))
+(assert (= z "aucagguugcggcca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2
new file mode 100644
index 000000000..c1e795b6b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0397.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCCAGTTGATGTTGGTACCTAGACTAGTGTAGTATTCTGAAGACTAACTCATAGATATAATTGTCCCAGAACGTGGGCTCAAGTTACTCGCCAACATGTCGATATGTATGGGTAACTTCCGGATAAACAACCTACCTCGCATTTCCCTCCTCGTTCCGCCTAAGAACTTGAGCTTATGTATCACGCGCTAAATGCTCCAT"))
+(assert (= z "gguggcucgggcuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2
new file mode 100644
index 000000000..03f5c865a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0398.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTACACAACTAGTAACAAGCAATAACCATAACCTACCTTGTGTTCGCTTCATCAACTAGAAACCATACACAACCGATAGACCCGGTCAAAATACCCAGCGACAAGACCGGCCATGATTACAAGACTTCCCACTGTTGCACTTTTAGACGCTCCTCACTTATTAGGCGGACCTTTTCTCGTTTCCAGTCTATAGTTTTTG"))
+(assert (= z "cuacaggcagggacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2
new file mode 100644
index 000000000..2e82d0650
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0399.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCATCCAGGCAGGCTGGGATTACGTCCTCATAGAAAAGCTCACATTTGTACCTAGTGAAGTACAATAGAGGCTTCGCTACGATGGACCCGACTTCGCAAGTGTATTAAGGCTACTGACACCTTTAGTCAACGCCTGCGTGTTGCCTAATTTGAACCCACGACTTTAACCGGTTTTGGCCTCGTCTAGACAGCCGACGGAG"))
+(assert (= z "gaucugaguucugaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2
new file mode 100644
index 000000000..4b4b06d6b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0400.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGAGATGGGCTCTTCTGGCATCTAGCAAATCATCGCGGAGATACAACTAGAATCCGTTCTTCCAGATCCTCTCTAGGCAGCGCGTGGCGTTTTCCTTGCCTGAGATTACATGCGTCCAGTGATATACCCATGTGGTCTCCAATGTTCCTATAAATTGATTTCAACCCTCATGCCACACCGTGAGCACCCCTTCGCACTAT"))
+(assert (= z "ucagguugcgaucac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2
new file mode 100644
index 000000000..c37eca36a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0401.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATGGAGACCGTCAGGACTAGCAGCGACTCGCCGGAATTCTGGTTCTTTTCGTCATTCTCAAGAGCAATTGCTTACGTCATCAACGGAATTCCGAGTGCGGCTCTTTAGGGGCTATGCCCTAGCTAATAAGGCAATGTCAGCCTAATGTGAAGACGTACCCTGCAATCGTCGACCCTTCTGTTTCGTTTCAACTGTAGAGA"))
+(assert (= z "auccaagaauaacuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2
new file mode 100644
index 000000000..10b494b26
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0402.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCATTCGTTCTCGTAGACCTGGGTACTGAACATCTCATGCCTCCCGATCGTAACCCGATCGTCCTCTAACTTTGATGAGTTGAATATTAGTTGAATGCCAGTAACTAATCGGATTAGCAGCAGGGGTTTTCACACCTAACGGCTACACTTTATACGAGCGTGACAATGCAACCGAAATTTGCTAATGATTACCAGTCACA"))
+(assert (= z "accuuucaccugaag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2
new file mode 100644
index 000000000..5b7e131a5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0403.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCATCAGTTCTATGTGTGTCCGACTATCCGCTGATTAACTCACGGCGCTGCGAGCTTGTACGGGCCAGCACTTCCCTTAAGGTCGGTCCTACCGCACGTAAGTCCTTTGAAATAACGAACGTTGAGCGGGCACATTGAAGGCCGGAGTTATTTTATTCATCAGATGTAGTCGCAGAGCATCCCTTCTTAAACGATAGAC"))
+(assert (= z "auauucaugugagcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2
new file mode 100644
index 000000000..3a388b8dc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0404.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGCCGTCAATTGCAGACCTGCATGAGTCTTCAAGCGAGCTCAGTTGCGTATTTCCACTGAACGTCGAGATCCGATTGGCAGGAGTTAAGGAGGGTCCGTATAGTTCGGTGGAACTGGAGTCGGCTTTAATAGTTGAATCAGTGGCGTTATAAATGCCATGGGAATCGTCTTAACCTATCTTAATGCGTAAGCCCGTTCGA"))
+(assert (= z "uuucuucuaugggau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2
new file mode 100644
index 000000000..3f062abd1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0405.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTATTCAGCCTCTGAGTAGGTTTCGATGTTTCGCCGCCTAAAGAACACCCGCCATCGGGGATAGGCCTTGCCAATATAAGTTGCTGGGGCGTTCGGCTGCGTCCATCCAACCCTCCTCCTTTCCTGAATGTGTCGTGATCCCCAGACTAGATTAGTACCAGAGATTTCAGTAGGGAACACCGGACAATATAGTTTAAAAA"))
+(assert (= z "gcaauguaagaagag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2
new file mode 100644
index 000000000..013feb397
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0406.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATCATAATTATTGATCAAAGGTCGCATGTTGATCAATATTTAGCGCTGCGCAATTCCGAACCGCCGACCTGTCGAGACCCCCCGCGCCAGACACTCATCAGAATCGTATTTGCACACAGAAGCAATCTCTCATGAAATCCGTACACGTTGAAGTTTCTCAGCTCCGATCTTTCGGCCAAAATGTCCTTTGGGCAACACA"))
+(assert (= z "cucuaggaucaagcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2
new file mode 100644
index 000000000..f49ed4caa
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0407.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCAGATGTCCGAGGAATTGAAATATGATTGGGCGGTCGTGAGTTCTCCTGCTAACTTGGGGCAACTACGTATCGTACTAAGCCGAGTTCAATACATTCTGACCTTCCGCATCGGCCGAATACAAGCTGGCTTGTAATAAAGTGTTCGCTTTAGGTTATGTTCACGTCCGAAACTGAGAGATCTATGCGGTGGAAACTTAG"))
+(assert (= z "ccgaauaguucgcgc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2
new file mode 100644
index 000000000..2b6a8cf24
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0408.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGCCTCTGGTCACCCGGAAAGCTAAAGGGCGGCGTGCCGAGTCGATCGGGCCATACATACGTTCTGTCCACGAAGTCCGTAAGCGGATCACCGAACCATGCATAGGCTTCTATCTTTAGTCCGGAACGTAGTGATAGGGCTCCTCAGGGCCGGTGACTGGGTACTTACTTTATAAACGCTTATCACGAGTCACTGTCAT"))
+(assert (= z "agucgcgagcauccc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2
new file mode 100644
index 000000000..fb8c115cd
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0409.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGATCCCCTGAACGGGCCGGAAAGGCCAGGTTTGCTGAGAGTAGTATTATCCGCCAATCCGCCTCTAGCGGTATGGTCCAGTAAAAGAGAACCTGTCGACTGGAACGTACGTCGCGTCCACGACTCTCTGGCTAGCCGGCTAGACTCATAAGTGGCGGTCTCCCCAGAATAATCTGTGAGTACGGTTTGCGTCTCCAAAC"))
+(assert (= z "ucacgugugcccuua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2
new file mode 100644
index 000000000..8d822009a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0410.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACCCAACAACGCCAGCGGGGTCCTAGGCCGGGTCGTCTAGAGAAAGCAAGGAGTCAACATGACCGGCGGTTAAATTCAGGACTGAATTCAATCGAATCTGATTTGTTTTTGTTTCACGGTTATCAGTTTCATATCAGCCGGTACATGAGGGATGATGGTAGCTCGTTCTATTCGGACCTTCCATGACTGAGCTTGGAAG"))
+(assert (= z "gggcguuuucccaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2
new file mode 100644
index 000000000..d7b648667
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0411.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CAACAGACCGCAGGCCAAGTGACTATACTGTGGCCCGCGAGGATAACTAGGTCCTGCGGAATGGGAAACCTAATCGACAGAAAGAGTTCGGTAGGCAGGGACATTTCGCCTCGATGCGTTGCAGACACGTGCCCGTTCCAGGCCAACGCAGTGCAATAGCGTAGCCAGTACAAAATATCTTTCGTGTCGAAGTTTTCTTG"))
+(assert (= z "aacucaacucuuauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2
new file mode 100644
index 000000000..441941574
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0412.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCCATACATATCGCGGGTCAGATAGGATACTCACATTTATGACCAATCTAACGTATAGCGAATTGGAGGAAAGGGTGCGGGGTTAGTCCATCAAATGAAGAGTGCAATCCTGTAGTGGGCCTATTTGCTTAGTGGTGTATTAATATCCCCCATTGGCCACGGTTATGTAAACCTAAGCTCGTCTATCAGGTGTGGAGTA"))
+(assert (= z "ggcuuggcagcaggg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2
new file mode 100644
index 000000000..d04b3be16
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0413.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGTCTAGACAACATGTGGCACCCGTGAACTTCTACCTCTAGCTATACGATAGCTGAGCAGGATCCCTGTGACGACTAAATTTATCCGTTTTAAAATACCGTTAGAACGAAGCTGATTCATGGACGGCTACCCGCCTTGAAGCAGCCATTCGACATTCTTTCGCTCTCCACGTGCTGCTTTAGGTTTCCCTGGAGAATGT"))
+(assert (= z "cugccagaaggcucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2
new file mode 100644
index 000000000..694d228b2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0414.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTATGTCGTGATGGATCCGAAGTCACTCTGCCGTCTAGTTGGTAACATCGGTGTAGACTTCACAGCTACACTCCGAGGGCTTAGTTGCGTCGTTATCGTTAGACGATTGGAGGTAAGGTGCAGAGGAAGGAGTGCATCTAATTGCGGATCTGCGGTACCAGGAGGCAAATACTAATTAGGGATATCTATTCGAGTTGGCA"))
+(assert (= z "gacaagucaacuugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2
new file mode 100644
index 000000000..4afb5dfb8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0415.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCTGGATAACCTAGTTTTAGGAACTCCGGGTCAGACTCCAGTCCACGAGGTGGTATTGACAAGCCGTGTAACTGTCTTCCCCGCCCGAATCTTACTTTAGTATAACACATTAACGGAGATGGCAGTCCCAGTCGTTACTTAGGCATGAAGGTAGACACTCACACAGCTACATTACCCGATTTAAGACCACAAAAAACCAC"))
+(assert (= z "uaguggcuacugagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2
new file mode 100644
index 000000000..4f0816aca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0416.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCCAGGGGGTAACCAACACAGTGCCTCTGATGGTCCCCGGTTTACGATGCCCTCAGTTCCGTGACATGGGCTTCGGGACGCTGTCGCCACAAGCCCTAAGGATACAACTATCGATGTTAACTAACGAGTTTGCTAGCGTGCTCAATTTCGCCTTACTGGACCGATCCAATGGCCGACCTAAGCGTGAACAAGGCCAGTT"))
+(assert (= z "cggagcauuguaacu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2
new file mode 100644
index 000000000..37b77c93c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0417.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCACAACGGCGTAAGAATCGGAACCAATGCCTGTTTGTGCACTTGCGTACCGCGAGATTTGCGCCGGTAGCGACACTTGACGGACTGATACTAATATATCTCGTTCCGCTGTGCCCTCTGCAACCGCCCCTCACGAAGTCCCTGATACGGTTGGCTATAGACAACTCTCATACTAGTATGAGCTGCATACAGAGAAAGC"))
+(assert (= z "uaugacguucguuau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2
new file mode 100644
index 000000000..df2a92966
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0418.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGACACAGAGATGGCACCCCTATGATAAGAACTCCCACAGAGACTGCCAGGCATCCTTGCCTACACAGCCCCAGATGTTGGACTCACTCCAGATAAAGAATCATAATTGCTGTTTAAACACAATATGGCGGCGTTAAGTAAGCAGGAAAGAGTATAAAGCGAACCGCCGGCTGTTTAAAAGGTCTAGCTACAAACTCGT"))
+(assert (= z "augcgucccacguga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2
new file mode 100644
index 000000000..113f6cb84
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0419.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGATTCAGTGCACGAGGGAACTTTGATACATTAGAGCGTTCTACCAGTACGCACATGTTCCTAATTCCCTCATTCGGATTGACATCATACCAGGAGTGATGTGTTATCGCCGAGATGGAGGCTAGAACAGGTCGGTTGTGACAAATATTGATAGGCAACTATCCCTTCCCGATGAACACAATGGGGATGATCCATCCTA"))
+(assert (= z "ucaaggaaacgaagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2
new file mode 100644
index 000000000..b60251f5e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0420.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGTTATTCCAAAGTCTGCCGCCAGGAAGCCGGAGCTTGCACTGTTAAGTTTGGTCCGGCAGAGGACCACTCCCGGTAATGATCAGTCTGCGCCGGGCTAGCACATATGGGCAATATCTCACCGAGTGAGTTGACCTTGCTTTGACCTCGCTGGAGGTACACGACCACTTGCAAGTATGAGCCACTAAGGTCAAGGGAATT"))
+(assert (= z "ucuaaccucaugucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2
new file mode 100644
index 000000000..afb65fe0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0421.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGGAACTAGACGGCCTGAAAACTCGTATAGCGACAACTCCCTTTCTTGGTAAATCGCTCCTTACTTGCCACTGGGATTGCCTCGATGTAATCGCGACCTACTGCTATCTTGTCGTGTTAAAACATTCAATTGTTGCCACGAAAGGCGTTCCCCGATATGCCCATCTCACTCCACAATGATGGGCCTGATCGTGAGCTCC"))
+(assert (= z "cguggagugaucuag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2
new file mode 100644
index 000000000..37834e099
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0422.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCCAGCCGAACCTCTCCTTGGATGTGTATCGCTAGATATTTTGTTTATTGCCCTAGTGCCTTAACCTGTACTAAAGGCGCCTAGCAGAAAAGTTACGACACATACATACTCGCATTTTGTCTATGGCCAGTTCGGTAGTTGACCTCGGTCCGATTGGCTTTGTTCAATTAAATGTTTGACTGATCCGTGAGGAACTCG"))
+(assert (= z "cauuugccgggaaug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2
new file mode 100644
index 000000000..becb35698
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0423.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATAACTGTTGAGTTCTCGGGGTCAGTGTGTAGTCCGTTAGCATTAAGGTCCAATACCGGATCTTTATTCCTCGGCTATGTCCTGCGGAGGGTTCGGATACAGGGCTTATGTCGCTCTCGAACTTGCTCGGCAGTCACGGCATAGTGATAAGTGTGGGGACCTCTTAATGCTGGAGTCGCCTGGTTCTGCTGGTTTTACT"))
+(assert (= z "auguacgucaauaua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2
new file mode 100644
index 000000000..b91016369
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0424.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTTTTCCACCGAGACTCGCCCATTCCACTTGAGGTTCTAGCCTTTTTTATCTTGAGGTGGTGACCTGTAACTATTAAGATGTCGAATGGCATCTCGATTGGTAAAGCTGCTTCCATCATCCTGTCCAATGTAGAGCACGGTGAGAGCTCATGCAAAAGCTCAGCTATTGGTGAGGGTACGTCGGGCTAGGCATTAGTAA"))
+(assert (= z "gcucguucugccuaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2
new file mode 100644
index 000000000..74f85dfe2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0425.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATAAGATCTCCCGCCTAGGTGACCCAAGACTTGTCAATCCGTCCTTAGGAGTGTCATAACTATCGGTTGGACCCCTATAGCTCGAAAGTAGATCGGTCGGCGTCGGGCCCATTGAGGGTAGAGGGTCCCTCAGTGTCTCAACCCTGGCTACGGAGGCAACCACATGCATCCCTAATACATTGCGGATATGTTTACACCC"))
+(assert (= z "uagacccgaacucac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2
new file mode 100644
index 000000000..b6293cd9a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0426.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTCCCGCAACACAACACATTTTGGCGCGGGAAGAGCGGGTAAGCTTACCTTGTGATCGCGACTATTCGTAGATGCGGCCGATCTCGGGATAGATCGGTGAGTTCTGATTATATGCGTGGTTCAGTAGGACCACGTGTCACCTTTGTGTTGCCTGACTCGCGGAAAAAGTGGGGCTACTGTGCAACACCGGTGTGGCGGA"))
+(assert (= z "gucuucagcuccaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2
new file mode 100644
index 000000000..4b5399a1e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0427.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTTCGTGCCTGATGTAAGGCACGCCGATTGACACTGCGAGTTGGCTACACTGAGTTGCTCGCGGACGAGTTATATGGCGGGCCAGCCGCATCTTATACATGAGCTTTAACGGGAGTGTCCGAAGTCAATTCCTACCAACCGCACTCCTATTGCCACGATGACATTAACCAACTAGAGCGGCGATAGTCGACCCGCCAGAC"))
+(assert (= z "gcucucugaucauac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2
new file mode 100644
index 000000000..9e3cd0c4c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0428.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGGTGCTCACTGCTCAGAGCTTATTTCATTCTGAATTTGACAGCCTCGCCATAGCGTGCCAATTGGATAGGCCTTCGGACAGTCGCAGGCAAGATGGAAGTACTCCATCATAGTCCTTACTAGTGAGCCAGTGAAGTAATGGCGGTCCGTGGTGGATCGGGCCAATGATCCAAAAACAGGACAATGGCATTAAGCTCTA"))
+(assert (= z "gcccucccaggacca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2
new file mode 100644
index 000000000..b34540cc7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0429.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGCTCTATAGATTTCGATCGCGGGGGAGCCTTTAATCCTGAACTACGGAGGTGATGACATTGAGCGGTAATGAGAACCATGCGGTGACGGGCTCCCTATTACACCGAGTGGCTTAAGTTCGTGACCCTAGGGCGAGGCGAAGTCGACATTGGAAAAACTTGGACTGGTGGAACGACAGCATAAAAGAAATATACGTGTCC"))
+(assert (= z "aaagguugagcucag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2
new file mode 100644
index 000000000..c5943df2b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0430.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCACAGCTCGAGCCTCCGAGACTCGTTCCCGTGTGTGATACAGAGGTATTTAGGTTTCCAACGGTTAATCAATTATGTCCGCTATATACTAGTCACACGGACAGGAGGCACCACTTACGCAGATTTGGCCTGTGCCATCTCTTTCGAGTAGTGTACGCGTGTTGGCCCGCTGGGATCGTCGTACATGTCACCGCAAGATC"))
+(assert (= z "agacugguaguucgg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2
new file mode 100644
index 000000000..fc9957470
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0431.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCAAACGAATGGTCGAAGAACAGAATTATCACGAGAGAACTCTTACATTTTGCACTTACGGCTCCAAAAACAGTTCCACGGGGCCGAACGGAGGCAAGAAACGTCCGCCTCATCTCGTGCCTAACTTGGGCTGCGTACCTGAAGGACGAAAATTATGTTTCGCGGTACGTACGGACACTGTTGTGTGATGTCCTAATGGC"))
+(assert (= z "uacuugguccggaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2
new file mode 100644
index 000000000..184dc8502
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0432.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGGTGTTTCAGGCTTATTGGTTAAGCGATTTGAGGGACATTCGTATTCGTCCTCCTATAACTTTCGATCTCGAACTTTCGGAGGCACGGATTCGATGATGAACCGGCCACGCTTGTGCCCATGCTTGTGTAGCTACTGAGCTCATCGTACAACGCCCGGGACTTGACTTCATGACACTTGCTTAAATACTCAGCCCAGT"))
+(assert (= z "ugguugggccaacag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2
new file mode 100644
index 000000000..942cfced9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0433.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTGTACCCAACAGCGTGGTCTCACTCTCCGCTTCGAAAGGCAAGGTTGTGGATCCGGTGTCCATCAGGTGTATACTCCGCATCATATGCCGACGGATGGGAATGGGGGCCCAGTCCCACAGTGAGGGAGAGTTACTAAGGGACAGTGTGTTGATACGGCAACCTATATCGCAGATAAAGCGATAATTTTCAAGCCTAAGC"))
+(assert (= z "uuaccgaucugcucg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2
new file mode 100644
index 000000000..cf0458e8d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0434.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGCATAGCACCCGCGCACCACTGTTCAGTTCTCGATACACGCCCTGCCTATGTCCGCAGACGTGCTCTATGTACGGGGCGGTCTAAAAACCGTCTCCCACAAAGCTCTCGTACAATGGCGCACGTAACGACCAACACTACATATGAAACGTGACCGTGTCACATTTTGAGCTGCTTCGTACAGCATGCTTCCGATGTTA"))
+(assert (= z "gaagcauagucgacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2
new file mode 100644
index 000000000..72605a4a6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0435.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATGTGGACCGCGTAATACAAGGAATGCTACCGCGGGAAGTGACTGGTCGTATTATTACTGGTACTATAACGGAACCAAAGCCAAATAGCTACTACTTCTACCTTCGCCGCCTGTGGTTCTTTATGGTCGTCAGGCGTGATGGATCTACGCACCTTACGCTGGTTTCTGAAGCACAATGCTTGGCGGCGCGACTGGTGGT"))
+(assert (= z "uaccuuuacuccgau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2
new file mode 100644
index 000000000..5d8e6d6bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0436.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GATCCATGGTGTCTAGGGGCCGACGTAAATACTCGACGCTTCTGCGCACTCAGGCGAGTATGAGCCCGCTGCTTCAAAATGATCGCCATGAGCCTACTCGAGTCTCACAAGGAGAGGTGATGGGCGATTCTACAGGGTGCGGGCTGGGCGAATCCCTCAGCCATGCCGTGGGCGTGCTAATGGAACACATCTGTCAAAAC"))
+(assert (= z "gauguuccgcauauc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2
new file mode 100644
index 000000000..0fa4a81c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0437.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGGCAAATCAGGGGTATCGAGTGCGGGGGGGCGGAGCCAGCGATGCGCTAGACTGACACGCTAAGGAAAGTTGCTAGGTAGTATCAGGAGTCTCCGAGCACAGTAGCGCCCGCGGGAGTTTGGGAGAGAGAATTTCCATCCAGCGAAGGGGGAAGTCAGCACGGTTCAACTACGAAATGGTCGGTGTTAAATTAGAGCT"))
+(assert (= z "ccucauggccgaguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2
new file mode 100644
index 000000000..d0480e27a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0438.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTTCCGGGCCGCTTAACCGCACTGACCCCTATTCACAGCGGCTCCTCCCTCTCGCCATGCGGTGAGGTCCGTCCAAGATCATGTTTTACGATGTTATTTCTGTACGGGCCTTGCCATCACGGGAAGCAATAAACATCCGCTCGCTATCTTGCTTACTACCGCTGCGAGGACATGTTACGCAGCTCTAGCTAGTGATCTCT"))
+(assert (= z "aacgaccuccugaaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2
new file mode 100644
index 000000000..f882a6ab1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0439.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTTTCTGTACACGTTTCATGATAGGGTTCGTTTATAAGGTTGCTATCTGTACACTCGTGGATTTTGAAGTGTGGCCAAGGCGATAACCCAGTTCGGTCTGTAATGCACCTGAAGCGTAACCACATCAGGCATCAACAATTAGCCCGTCGTTGGAAAAGGATTGTGAATAAGGCAAGCAAAAAGTTATAAGCAACACATTG"))
+(assert (= z "uugggaaaccugcgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2
new file mode 100644
index 000000000..548eac804
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0440.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TACGCAGTCCACGTATGAATGACGGCTCCAAGGATACCCTAGGACCGCATACGTACTGGTCACGTTTTGAAACGGTAACGCTAACGGGTCATAACCTAAAGCGCAATGGAGATGCATCGAAAGAGTCCATCTTTCAAGTCACTCTACGTATGGCCCCGAACCCCATGTATTGATGTTTCCTTATCTGGACAGAACAAGCA"))
+(assert (= z "ugguaaguucggaga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2
new file mode 100644
index 000000000..65b0d597c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0441.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATGCGCTAAGCTGGACGGCACAGTCAATTGTAGTAATTGAGGGATATAGCGAAGTGTAAGGTTGGTGTTGCACCGATCGTGGTCGAGTGACCGTGCCACGGTATGCTAATGCAAAGACCAGTGGTAGGTCAGAGCTGTTCAAGCCGACATTAATCGACCGGTCAGTGTCATAGCCCGGCTCTATCTCAGTGGTTCCCGC"))
+(assert (= z "gccuaaacuuaugcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2
new file mode 100644
index 000000000..47e7f23d8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0442.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGAGGTGAACCAATAGGGCTTGCCTAAGTCTGTCCATCGCAGGCCGTAGAACGGCAAAGGGCACAAATGAACTCCTTAGACTCTCCGTCCCTATGGTTTACCGCGACATGCCAAGCTAGCCCCCGAAGTGAAGGGGTCCAAGTCTTGGCTCGACGGAACATGGCCGAGAGGAGACTTTTCCACTCGCGGATAACTGCTC"))
+(assert (= z "cagguggcgaaccaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2
new file mode 100644
index 000000000..b215fe9f2
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0443.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAATCGCCAGGGGCTCGTGGGACCACTTCTGTTTGGCAATCACAATAAATTACTTAGACCTTTAGATTCTCCGATGGCTGAAGCAGTGTCCGCAGATGGATTCCCACGGGCGCCGGGTAATAGATTTTTAACTTCACCACACGGTATCTTGAGGCGTACAAGACATCCACGACTCGTACGTCCCGGAATCCAATTGCGTG"))
+(assert (= z "cguaauuaccaggca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2
new file mode 100644
index 000000000..1ce1d2081
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0444.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGATATTACAGGAGGTTGTGACTTAGGAAGCCTCCGGTTAGGTCCGGGGTTGCTTTCTGCATAAATGTGAAAAGGTCCATAAGGTACAATAGTGATAGGAGTGGGTTTCCCGACCAAATAGTTTCTCACAGAGCCTCGGCTTTATTCAAACCCACACACTCTGACCGGTAACCCCGACATTTTAAAAACCCCGCAGTGC"))
+(assert (= z "ucaguacagucaaca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2
new file mode 100644
index 000000000..869ea572d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0445.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAATCCGTTTCATATTCTCTCAGTAAGCTAATTTTGGGCTCCTACCTGTCACGTCGTCTAGGTTGGCTATCGGCCTGCATCCTCTGCGTGAGAGTTAGCGGAGGCTATCTGGCTAGATAATCGAGGACTGACACCACGAGGGTCATCCCAGTTGCCAAGCTTACTCGCTGTGCGATGAATGTTTGTAGCAGAAAAAGAAT"))
+(assert (= z "acgcauuuuaucacc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2
new file mode 100644
index 000000000..b33d7debe
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0446.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACGGCAATGAGGTATGACATTATGCCCATTGTGACTGTGCTATCCGATAGATCTCGCTGGCAGGGTCAGCTAGACGATCTGTGAGAATTACAATTCTTTCGAAGATCGATCCAGTCATTCCATGGGGGCATTCACAGTATCCTCCATGAGCTTCCAGTAGGGCCATGTGCATGTCCTCTCTAACTTTATCGGAGACTAG"))
+(assert (= z "cacacccgguuacgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2
new file mode 100644
index 000000000..38ebbf52d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0447.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATCTAACGGCGGCCTACCCATCCCGAAACGACTTAGACAACCAGGGTCAAGTAATGTCGACGACGCATAGACTAAATGAGCGCCGTGTAGTCTTAGTCGATACTGGACTGGGTAACCGGACCCGCCAGCCATATCATCTGATTCTGTGAGGTACCTCCCTTGAATCTGCCCTCGTCTCTACAGTGCAATGTGATGAGGTA"))
+(assert (= z "cgguacagaucguac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2
new file mode 100644
index 000000000..e5a32bdf6
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0448.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGTCAGTTGATTGTGTAGCCTCGCCCTCTTTATCCCCATTCGAACGTGTACGGAAGGCCAGCCGACCCTCAGTGGCTTAAGTATTGTCTAGACGTGCAAGGCGGTTTTATCTTTCATGTATTCCTGTGACTCTCAGAAATCTTAACCGGGACAATTGATTGTGCACCATTACTTTGAAGGTTCCTAATTCGAAAGAGTTA"))
+(assert (= z "cauaaauuccguaau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2
new file mode 100644
index 000000000..578745e94
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0449.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTAAATGTATTCCGCGCGAACCAGAGCATTACCGTAACTTAAGTGTGGTTTAGTGGCACTACACGTCAGTCGGCAGGACTAGTTCCTATTTACCCTTTGGGCTAGGCACAGCGGTAATTTAATTAGTGGAGGACTCGTACGCATGACGCATGGCTGAGGCGTAACGTGCCTCAAACCGACTGATCAAAATACTTTCGCCG"))
+(assert (= z "gcuuuuuacaauucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2
new file mode 100644
index 000000000..4e35913cc
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0450.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GAAATGGGTCCGGCCATAGATTTAAGGCGTTCGCAAGCTGCCTCAGATCGGCTAGCATTTTCTCGAAATCCCGCGCCAGTAAGGATACCATTAGTAATGGCGGAACGAACAAGGTGCGTACCAGCGTTGACGCGAAGTAATACCCCTCCAATGCATACCAGTTTTACTTTACTGCTGGATTCACGGGCTCCTTGCCTTTC"))
+(assert (= z "agcuuggccgccuuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2
new file mode 100644
index 000000000..a0113583a
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0451.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGATACCAAACTACAGACATCTATTCCTAAGCAATCCTGGGTCAAACTCTTATCCTTGACCTTGACGGACTAGGATGCTCGGTAGACTCGGGGCCGTCCTCGTATCAACATACTTCGGTTGTCCGACATCGGGCATTAAGCAGCTCAGTGTATGGCCGATACGGGGCTATAAACAAGGCTCAATAAAAAATCACAATTAA"))
+(assert (= z "ggacucugcaauguc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2
new file mode 100644
index 000000000..87faff253
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0452.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGAGGGAGACGTGCCTAATGTAAGTATCCATGTAGAACCGATGCTACCTTGTCGTCTACGAATACGTTCCCCTGCCCTGGAACTAATCAGGGCAGCGTCACGTCCCATCAATATGTTCGACAGGCGACTAGGGGTCGACCCCTTTGTTCTATCTGGCTTGGGCCGTTAGTATGTCGGCGGGACGCTTAAGGTTGGAATG"))
+(assert (= z "gguucugcauggcac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2
new file mode 100644
index 000000000..ac7c5a7f8
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0453.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCGTAGCCATCTGAGCGAATAAGAAGTTCAATCGTACAGTTGGCGCCGTACCACATGTTTCGGAGCAGGTAACGACAGGGCACTCCTCTTGCCAGGGGAAATAAGCGATGAAGGAGGACGTAAGCTCCACCGTGTATCTAGAGGCACGTGGCCGTGCAGCGCGCCGTCGTGCCGGCCCATCCTAGTAAGGCGTATAGTA"))
+(assert (= z "ugcgcgccgaaccgu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2
new file mode 100644
index 000000000..34af7418b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0454.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTAAGCAATGGGGTCTCTAGACTCCGGAGGCCGTCTTCATCGCCCTTAATCGTACCTCCAACTTAGGTCTTTGCAGGGCGGGTCGGTAGTGACCACTATGTCCCCGGTCAATCATTGCGGTCAGCAAGTCCAAGGGGTTTGCCCGCCAGTAGTAGTAAAGGTATACAGTCGTGGACCGCATCGCTTTCTTGCTGCCCGCC"))
+(assert (= z "uccgcaguuuuggug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2
new file mode 100644
index 000000000..42d1b5854
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0455.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CCGTTAGCATTCGCGGTTAACACACACGGCTACCACCTTCCATCAATAGACTCGGGGACAATGGAGAGGCCCCACCATCGGAGGGTTAACTTAACTTCCTGAAGGGGTCCTATCGAGCACGCAAGAGCAATCAACCGTGTTCTGCCGCGACGGAGTGAATGGTCACTGAGGTGAAGGAACCGCATGATTGTTAGATTCAT"))
+(assert (= z "cucgcugccccauga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2
new file mode 100644
index 000000000..7b39f0234
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0456.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTGGGTATGAGTACGGGGCCAGTGTACCAATACGTTGTAAAGACACCAGCATACATGCGAGCTTGTTTGGGAGCTAGTGCGGAGGTAGAATGCCCTAACGCTATTTGCACTCTTGATCTACGGCAAACAGCAAATCGGTGCTGTATGAAAAAGTTTCTAAGGCACGTATCTTGGATTAAGAACCCACAAACTAATTCTG"))
+(assert (= z "auagguagggcacga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2
new file mode 100644
index 000000000..54eb2e693
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0457.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATGTCCATAAATATGACATACTCAGGAGTCAGAGCCAACCGGGAAACCTGAGCCCTTAGCTAATTAGGTGGTTCACTGGGTGTATGCCGTGACGAGTCGTGACGCGTACAGGCGTTGCGAGTGACGAGGTCACAGCAAATCGGGTGTTGAGACTGCACGGTCTTTGGTTGATGGCCAGGCCTTCAGCCAAGATGAGGGAG"))
+(assert (= z "agccucgugguucag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2
new file mode 100644
index 000000000..6288e54db
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0458.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCACTTACCAGCGCTTTAAGTCCACGAAGTTCGTACAACCCTCAGGCTCCGCGACCAACTAGACGCCAAGTCAATCGAATGGTGGCCACCTTGTGATGGAAGCGTACCCCTTGCAGGAACGGTTTCAGCCCGATAGACCGGCCAGCCTCGTATGTTGACTCTCACATGGATTGATCTTCATATACGGCGACCCATTGTC"))
+(assert (= z "cuaugguaguaagga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2
new file mode 100644
index 000000000..141dd1b7d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0459.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGGCGTTGGTTGAGGCCCATCGACATGATCCTTCTCTACCCTGCACCATAACTCACCACGCAAGAATTTTATGCCTGCCCAGAGAGCCTCTGAACGTGCTTAGTAGGATCCTTCTCTCGTAGAATGTATATAATCTAAGTGAGAATCGGTGTATACCTACCAGTCTAATGGAGCAGGACTTCACAGAAGACCAAACTCA"))
+(assert (= z "cggccacacuagcaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2
new file mode 100644
index 000000000..9c6b81666
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0460.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCCTCTGGTAACAGATATGATACCCAATCAAGTCGAAGGTCCGCACAGTGTCTCCTGGACGTCTAAGCAAGACCTAAGCACAGACCTTCCGACATACTGGAAATTCTAGGCGAGATGCCAAATCCACGGAATCGGCGAAGCATATAGAAGACACCCGCTAATAGCTATCAGAGATATTGCTATCCCCTTAGTAGCACGTA"))
+(assert (= z "auaauuauaagagcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2
new file mode 100644
index 000000000..f1f390c9e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0461.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGATACCATGGACTAATCACGGCTTCCTGATGCTATCCCTATAAACTGGTGATTCTGCGGTCCCCCAATGGTCTCCTTAATTGTACCCGGCGTTGCCTGTAGATATCCGTTACTGAGCACCGAGGGAGAGCAATGGTACTGGACCCGGTAGACGTAAAGATTTTGATTCGGTCTGTGCGATGTCGGGCGTTGATTACAGC"))
+(assert (= z "auuauuugguuucga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2
new file mode 100644
index 000000000..b85978a83
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0462.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGAATTTGAGCAAACTCCTCCTGCCCCAGCGTCATGCCTAATTCCCCTCTTTGGAGGCTTAAGGGGAGATCAAGCTTAATTTAGGTGCAACCTGGTATGCCATTTTACGGTCCCAGGAGAAGTCGTACTGTAGTTCGGGTTTATGGCACTATAAGTAATAACCCTACCGGGTCGAGGTGGCTGCAGCGCCTTACACATCG"))
+(assert (= z "ccggugggggacucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2
new file mode 100644
index 000000000..978191c67
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0463.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGACGAATGAGCTTCGATGAGATCATGACTGCCGCCTGGGACATTTACATCTCGCTCCACCTTAGAACGCGAGCGCATCTGTATTTGCAGGGAGGAGAACACAGCTTCGTTATTAGGAAGCTTCTTGGCTCGTTAAACGGGACTCGCGCACACAGTATCACAATATTACACTATTGTTATAGTTACCGGCCGGTGCTACG"))
+(assert (= z "auauucggcccucaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2
new file mode 100644
index 000000000..a9ebecc5b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0464.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACCAGTGACAGAGAAGAACGCTTACGCTGATAAGTAAGGTTCCACCATCTTGTAACCACAAATGACTGTCGTCATGACTACTATTTGCATGCTTGAGCGCTCAATAGACTCACAAGGACACACGGTTAATGATAAGGCGGCCGCCCGCGCCTGCATTAAGGCGTAAGACCCCCAGTCAGCTCCATGGTCTAACCGTAATG"))
+(assert (= z "ccaugucgaaucucu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2
new file mode 100644
index 000000000..16574f2c7
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0465.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTACATTCCCTCAACCGCGGGAGGTATCCTCTTGTAGAAGAAGACAGCAAACCGGCACACCCAAGTTTTGGCCCGCGGTGCAGCTGATCGCATGGCTTACTTCTTAGGGCATCCTCTGTCTAATACCATAACTTGCTGGCGACGCCCGCCCAAATCATCTAAGGCACCTCACGTTCCGCGGCGCTATAGGTTATCGGGAC"))
+(assert (= z "cuggacauauccagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2
new file mode 100644
index 000000000..78e20dc1e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0466.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTGTCTCTCTTACCGTCATCGTCGCCTGTTGCCCGGCCAGGCTCACCGGTAGCAGCGACAACGAATCAGAAGCACTTAAAGACTATATGATATAGGTGTCATAAACCCTATTCCACGGTTCGACAGGGCAGCTGCGGAGCGGTGTCTGACGTGTGATTTCGAGAAAAACATAACTACAGTGTGACCCCGGAATGATGAT"))
+(assert (= z "cggguagcuugcugc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2
new file mode 100644
index 000000000..fe1b0f9b1
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0467.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATGTCGTCCTTTAGTAATGCCCTATCTATCCGGCCCCTATCTTAATGGATTCGATTTGAAAGCATGAGCGCTCAGCTTCTTACCTTGCACAGGACTCGTCTGTATTGTAGCAACCCAGAATTTGCATCCCGACGGTAGAACAACTTCGAATATGTCCATGCTCTTTATTGTGGGGGCTGCGTATGTGCTTATTAGGAACG"))
+(assert (= z "gagucaaauggugca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2
new file mode 100644
index 000000000..ddcbd8543
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0468.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACGATACTTATCCGGGCAGTACTCTACCACGTTTCCCTTGCATAGGAATATATCGAAGTCCGTATGACCGACGTTCCGTATACAGAGCCGTAGATTCCACGATCCGTCCTTGAGTCTTCCCTGATTGGCCGTCTAGTTTTTGCCTGGTGAAGCCGCGGTGCTGACGCCGAGGGACCAAATTACTTCGAGCTCTGTGCTC"))
+(assert (= z "gcaguaguuccggcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2
new file mode 100644
index 000000000..484a70573
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0469.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGGTCTACACCTCCCCGATGTATAATAGCGCTGAAAATCTCCATATCGGTTCGCTTGGGAAGCAACATTCGCCGCCCAAAAACAATTAGACTCCAGCCGTAGGAGCTAGTCCCATTCTCATTTCCTGCACTACAATGTCTGCATTACGCATTGGAGCAACTACGGAGGCACTTGTAGTGTTGTCTTTGACTCCTCGCTGG"))
+(assert (= z "gaguggcuucccgca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2
new file mode 100644
index 000000000..529484747
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0470.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CACTCCCAACGTACGGTGGGAAGGTCAAGCTGCCACTACACTCACGGTGTAAGCGTATCTAGGGAGTTCAAAGGGCATTCCGAGCTCGAAAAGGCAATCGATTGTAGTGTTCGCAGATATACCATAGGACTCCACGGAAGAGATAATGTTGGTTTCGACGTATTCCCGAAAAGATGCGCTTTCACGTGATGCAGGCATTA"))
+(assert (= z "ugccggagcggaagg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2
new file mode 100644
index 000000000..d26232d0c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0471.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATATACGTAAGCCACAAGTGAAGCGGGCCCAAGCTCGCCTTCCGTAAGGTATCTGATGGCGTCTCTAAATCCCCTATACCGCCACTTTCTTGGGGTCCTTCCTACTTCCCCCCAAATTACACCATTTAGTAGGCTCTTACCAAGCTATGACCGTCTGCCGCGGGCTGCCTCATTTTCTCCATACTGAGGACGCACACTA"))
+(assert (= z "gcucgcuugaauuac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2
new file mode 100644
index 000000000..da1387b74
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0472.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AATCAACAACATCCATGTTGTAGGGGCAAAGGTTACGTGGATCTAACAACCAAAAACAATCTGCAAGCCTCTCCAGGCGTCTAAATTTAGATTCCGATTACGTGAACGGGTGGGCTTCAGACTTTGCTATCACTCATAGCACAGACGTTATATGGTTAAGATGCTACATATGAGCGGGTCGTTTGCTCCTGGGACCCCTT"))
+(assert (= z "guaccuugacgauuu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2
new file mode 100644
index 000000000..bf49f889b
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0473.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAGAACCTGATCCTAATTTTTGCTGGGTCTATGAACACTGCCCGACCAACCCTTCAAAACGCCATCTAACCAGAGGTATCGGGTTATAAAAGAGTTCCGCTCGTTACGAGGCAATGTGGTCCGGACACCTCATGAGGACCGAACCGCATGCCTAACTCTAAAAGGAGGCGGAACCCGCAAAGTAGACTACCCCAAGTGC"))
+(assert (= z "aagaaacuguaugag"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2
new file mode 100644
index 000000000..6ed809b71
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0474.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCACTCGAAGTAGCATTCTCGTGATGAGGGATCTGTTACGAGGCTGTCATGATCTCCGAATCCTGTCCGCTAGGCACGTAAGCCATGACCAGGGACCAGCACTAAGGTTGACCCGCGGTATCTACTGATCCTAAACAGAATCTCTGGAATGCGCGGTCCCCATGCCCACCCCCATACGTACCGAGTGTACCTAGAGCAG"))
+(assert (= z "aguccgauuguugcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2
new file mode 100644
index 000000000..b223846e9
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0475.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TGTGACAGAGTTATGTGGTCTCTCGCAACGCCGCGACTGAGCCATGGTTCGTTTCTTACAGGTGCCCTGTGAATTGTGCGGAGATTCGTCTATCGCCACACTACATGGGTAAAGTATGCACCGTTTTTCACAAGTCATCCCTTTTCTTTTCCATAGCGTGAAAGAGGGAGCGACCCGACTATATATGCTTATCCGTACTC"))
+(assert (= z "auccucacacaauaa"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2
new file mode 100644
index 000000000..0f04bd342
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0476.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GGTCGATCGAAGCACCAAAAGGTTTCCCGCGCTAAATCCTTAAATACCGGTCTTAGCAAAGGCACGCCCCGCGCTGATATCTCTATCGCATAACCTCTTGCGCCAAGTGATACCACGGCACCATCGCAGGTTGAAGGATACTCATAAGGACAATTCTTCCATATGCCGGCATTCATACATCACGGGCCCCGTCAGATATA"))
+(assert (= z "uugcaauauucagua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2
new file mode 100644
index 000000000..38a5d2a6e
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0477.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TAAGCCATTACTCCCAAACATGGCGTCGAGGGTCACCAAGCCGTCGACCAGAGTACGATACCAGCCGTCACCACCGCGCCGCTGAGTGCTTATACGCTTCTAATGGCACCACCCTGCGCTTGGAGGCGGATTTCTTGTCGTTCATGACACCGAGAAGGGGGTTCAGGCTCTAAGTCAGAACGGAGGAAATCATAAAGCCA"))
+(assert (= z "aaauccucugacccg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2
new file mode 100644
index 000000000..a6faf0258
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0478.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GACGGACTAATCAAAGCCACCCAGCACTTTTGAACAGCGCCAAGGTAGGAGGGCCGCCAATGTTATTGTATAAGAATATGTAACGGGCTCTACGGGGTACCGCCTTAGGCCGATTATAGGACACATATCTGGGTTCGTTTCCTGCGGTGGATTATATTCACGCTCAACGGAGGTTTCGGATTTACACTTGGCTGCTAAAT"))
+(assert (= z "ccguugugucaggac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2
new file mode 100644
index 000000000..b455b231d
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0479.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACATTCCCCGCAGAGAACCATATTCCTGCACCCGCCGCCCAGTCAGTGAAAGCATAAACTCAGTTCTGTACCAACCCAAAAGGCCGAGGTGTGGCTTAATCATCACGATGTTCCGATTGATCCCGAAGGGCAACTTCTTTTTATGGCTGAAAATCGCTCTCTTTCATACACACCACAAACATACCACGGCTCCAAAGATA"))
+(assert (= z "ccacccgaaguuuga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2
new file mode 100644
index 000000000..e0f0d58ca
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0480.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTGCCTCCTTTACCTTGTTGACGCAGTTCTGGTAATAGACGATAAGCGTGAGCCACGGGGGCGTAGGCCGGCAATCACTAGAGTCTCACATAGATTTTTGTCCGACAACGTACAAGCTCGATGCCGCTATAGACACTGAGTAGCAAATGAATACGTGCTATACGGTTTGCTCATGTCATGAACTACGGGGCATACTATCT"))
+(assert (= z "cucuaagcuaugucc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2
new file mode 100644
index 000000000..d4993132c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0481.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCGGAGTTGACCCTACAGCCCTGATACAGTGTGGTACCAAGGTTTTTTGCAGATCTCAACATCCACACCACATCCGCATATGTTGACATCATGGTAGCCCAGACTGATATCGCTATACGCCCTGGACAAAAGGGACGATTCTGGCATTTCGTGAAATTCGCATAGCGGATTCTGGGGGGCAAGCATGCGATGTGGCAAC"))
+(assert (= z "acgcuggacuuggac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2
new file mode 100644
index 000000000..7cb3d5c98
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0482.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTAGTTCATGGGGTGAGGCTTAGAAGTAATGACCATGGCCTCTTAAATGTTCATGCGGCGCAGAGGGCATCACACCAGGATGAGCCGCTCGACTCTCCTGCGCGGTACCCACAGCCGACGGAGGAATAGAATGACACGCCCATGACGCCTCACCGGTCCACGTACGGAGTAGTAATGGCAACTTGGCTCGACCCTTCGT"))
+(assert (= z "cgucugaauccgaac"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2
new file mode 100644
index 000000000..32b3fbeb3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0483.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGGACAGCACCGAAAAGTTCCTACGAGAGACATGACCTCATTCTATGTCCGCGACGAACGCGTGTCATAGAGTAGTTGAAGCAGGTGCGGAAACTTCGCACGTGCCTTCCAAGCTGTGGAGGTTTCAGATATGACAATATGTTTTAGGCAGGGTATGAGAATTGGAACACCAACATCTCCGTCCCACTCCCGGGTCGGCG"))
+(assert (= z "uuuuaugucaaagcg"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2
new file mode 100644
index 000000000..0f13325fb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0484.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTCCCCCTAACTGTAGATTGTATTGAAACTATACTCGCTGATACAGCCTGGGTCTAGGAATCAAAATGACCTCATTCACGTTTGAGCGGATCTAAGGTATTCCACTGACCCCAACGTTGTCCCCGCTATTTAGTCCCGCCAAGACTGATGTTGGGTCGATACCTACTTCAGCGGGATTGGCCGACATTTCAGAACCAGCA"))
+(assert (= z "auagcgcaugauguu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2
new file mode 100644
index 000000000..201e4e3a3
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0485.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ACTGAGTCACCAACACTCCACTTGACTAAAACCCCCATCGCGACATCAACTAAACAGGGACTCACTCGATAGCGGCTGCAGCTACTTACTTATACACCTTACCTTAGATCATCTCGGTTGTGAGAAGTAATCTGTTTTGACCTATAGCACATGTACCATCTTGTGGCGCACGGTAGCGAGATAATTTTCTGATACCCGAG"))
+(assert (= z "cguccucccaagggc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2
new file mode 100644
index 000000000..ba06f1863
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0486.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCGCATTGCCGTTGATAGTATTCTCATCGTCACCAATCCAAAAAGGGTAGCTTCATCAGGCATAAAAATCGTAAGCTCTAGGTAAACGTCATTCAACCGTCGAAGAGCCCATCGAAATCAATTGGTACAAAACTTAAGCTTGGCAACATTAGGTGCACACAGTTCTTAAGCAACTGTGCTGCACGTGCCAGAGAGAACT"))
+(assert (= z "cuuccacuugccucu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2
new file mode 100644
index 000000000..c140e2671
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0487.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AGTATGCTTGTGCATATCGGTTCTAATTTTCCCCATCGAGGGGGTAGAGGGCGTAAATAGGGCTTCCAGCATGCACATGATAGAACCTTGGAACCTTCACAACTTTCCACATGGTTGCGGGGTCAAGGAGGCCTGCATGACGCGCTCCAACCTCCTGTTCCCAGAGCCTCTGCGGATATCCGGCTTTCTAGCGATTCCGA"))
+(assert (= z "aucagaugggagcug"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2
new file mode 100644
index 000000000..baf7a6c58
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0488.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TATTATCTTTTCTGATCCATAGGCAATTATATACCACATGCAAGCCCGTTCGGGAAGGCGGAGAACCGAAAGTCAATTCGACCGCAACTATAAGTTACGTAGTTGTATGGCGATGTAGGGGAGATAACCTCCCGTGCGAGGTTTCGCTATCTGACGCACTGAAAGGAGAAAGAAAGGATTGATGCCGACAACAGTTGACC"))
+(assert (= z "gaugcgccaguacua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2
new file mode 100644
index 000000000..fd3248eab
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0489.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "ATTATCATGTGACAGTGGATTCCAGTACGCAAGAATTTCGGGTCCTAGCGCAATAGCCCCATTGCCATGCACCGGTTGGAATTTATTTCGGCAAGCAGTATACGACTTGGGATCTGCAATGTCGTTTATCCTTACTGGCGTAGAGGTTCTTAGAAGAATCACTATGGACCTTATGCGTGGTTAATGGATCACGTTAGAGT"))
+(assert (= z "ccaccccgaacucca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2
new file mode 100644
index 000000000..06da552bb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0490.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTTTTGCACAGTGCCTGGCGCGTGATTCAGTACTAGCCAGACGGGAATCCGAGGGACCGTGTCGACAAGAGGTCACTTTTTATGTCCTTGTGGGCCGGGGCCGTACGGGCTTGTGGTAGAACTCGAGGAGTTGCTTTGTGGAAATCTAGCTGCTTCACCACATTCTAGATGCGGTGGGACTTGACGGTATGATAGAGTTG"))
+(assert (= z "uauguucccaucgua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2
new file mode 100644
index 000000000..9fbe6bae4
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0491.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAGTCTCATACTAGAGGAAGAGATATGTTCGATTTTCCCGTTCTCCATATCCCCGGACGCTGAGCTTGAGGGGATGTAAACGACAACATTCCGCATCAATATGGATCCCGACTCGCAAAGACAAGGTGCCAACCGGCCACTGCCTTACACGTTCCTTTAAGCCACAGTTCATACGAGCCAATAACTCTTGTGGATAGGG"))
+(assert (= z "aaucagacuugggca"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2
new file mode 100644
index 000000000..b1f832725
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0492.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCAAGCGCCGTGTTACGGAATTACTTTCTGTGCCAGATGTACAGGAAAACCGAGTACGCTTGGCCTTAATTCGCGTATGTATCCTTCGTGCTACAAACCCGATCCTCAAGGACAGTACGGCGGAGCTCGCGGCAGATTCTCATCAATGTTCTTAATGTTACATTCCAACATGGAGGAGCCACGGACTTATTACATACTG"))
+(assert (= z "uaaauccuaccucau"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2
new file mode 100644
index 000000000..c7e0e7f05
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0493.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGAAGCACTTGTCCGGCTAGCATGGGATCTATATCGCAATCACCTGTTCATTTGTTAAGGTCGCGCTTAGGGTACACGTAACATGCGGGGCTCGTATGAGGGGGCACGAGGGTGACATAATGCGAGTTGCAGCACTAAGATATGACGTAACGTTTTTAAGGTTGATGTATACATGCTTGCGGCCCCAATGACCGATCCTA"))
+(assert (= z "gaaccgauuuuugcc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2
new file mode 100644
index 000000000..1a26406e5
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0494.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GCCAACAGTGTAGGGGTCGTAGGGACATGACATGTCCCGATAATTCACATCCACAAGGTCAAGTTCCCGCGAGACGTATGATGTAGCCGTCGCCACTATGGCCCTAAGCCGAAACATGATGACAAGGACCACGAGCCAGGATGCGTGGCCCAGAAGGTAGAACGATAATGGCGTACGCTACAAACTCTTGGGATCCGCGA"))
+(assert (= z "ugucaucacuccgcu"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2
new file mode 100644
index 000000000..830bfbd91
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0495.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "AAGTCATCCCGTGCGAGATAACGTATTAACCCCCCTCAGAAAAGACGCTGCATCTGATTTCCGGGCTCTTTTTATGTCCGACAAAAGGGGAATATGGTCAGCCCAGATATCCGATGCAGGGATTCAATTCCTGCAAGAAGTTCTCCGTAGCCCCTTGCATTGATCGCGTAACACAAGTAACTTAGTGGGGTTGAGACGGC"))
+(assert (= z "gauuauucauguagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2
new file mode 100644
index 000000000..f177432cb
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0496.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CTCTGACAAGTCTGCATTAGTCTAAGGAGTGATAACATAACCAAGACGCGGAGGACACTAGTGTGATCAATTATCAAGCGCGTTGGGCCGTGGGTAGGGGAGATGGAGATCCTGAGTCGGACTTGTATCTGCGGTGCGGCCCCCCCGTGTGCCGGATCATTATGTAGCGAGTGTACCGGGTGCGGAGGAGCTGACTTCCT"))
+(assert (= z "gccagagccgaucuc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2
new file mode 100644
index 000000000..e053ca375
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0497.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "CGGCTCTCACGGACATCTGACCTCGGGAACCGATTTGTTCGACCATGTGGTTAGAAGTTGAGTAGCAGGCCGTTAGAGCTGTATTATGGCAAATCAAGGTTTTATAGTGGTCAAATCACCATATGAACACTGGTGCAAGGTATGAGCATTGATAGATAGGCCGACAGGGATGCCCGGTCCGGCCTATAATTCATACAAGG"))
+(assert (= z "uuaccaccguccagc"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2
new file mode 100644
index 000000000..de3de7c20
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0498.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TCCCCATACCCCGTCGGAGATGCGTTATGAGTTCTGTTCTAAACCAGCGGCGAAGCGCCCTTTTCGGTGATACACTTGCGCCATCGAATTGCCTCGCCCTGTCATAATATGTAATAGCCAGGCCCTTATCCTACGTATCGGTTTCCCATACGATTCCCAAGCAGGAGGGCTCCACAGCAAGTCACTGATTCGACCCAAAC"))
+(assert (= z "cagcuuuugucguua"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2
new file mode 100644
index 000000000..41fbf8f7c
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0499.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "GTAACCAGCATATACCTTGTCAAGATGAGCCTAGTGCGACATCACTGGGCAGGACGATCGCTCTTGAGTCTCCGGGCTTGATGTAGCCGAGAATGATAGTCCTAAGGAATAAATTGTGTTATGTCTCTAGAGATTGTCGACGGTAGCCAGCTAAGTCAGCGTGATCCAAGAAGGAGCCTGTACAAACCTGCTTATTCGCT"))
+(assert (= z "caaugaggaugugga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)
diff --git a/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2 b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2
new file mode 100644
index 000000000..da985e974
--- /dev/null
+++ b/non-incremental/QF_S/20250403-rna/rna-unsat/benchmark_0500.smt2
@@ -0,0 +1,39 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_S)
+(set-info :source |
+Generated by: Oliver Markgraf
+Generated on: 2025-04-03
+Application: Evaluation of Regular Constraint Propagation Techniques
+Target solver: OSTRICH, cvc5, Z3-Noodler, Z3, Z3alpha
+Time limit: 60.0
+This example models a reverse transcription process inspired by bioinformatics. 
+Here, an unknown RNA string y is converted into a DNA string by applying a series of str.replace_all operations that simulate nucleotide base pairing. 
+In addition, the RNA string is required to contain a specific pattern.
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status unsat)
+
+(declare-const y String)
+(declare-const y1 String)
+(declare-const y2 String)
+(declare-const y3 String)
+(declare-const x String)
+(declare-const z String)
+
+; Reverse translation: RNA to DNA
+(assert (= y1 (str.replace_all y "u" "A")))
+(assert (= y2 (str.replace_all y1 "a" "T")))
+(assert (= y3 (str.replace_all y2 "g" "C")))
+(assert (= x  (str.replace_all y3 "c" "G")))
+
+; Concrete DNA and RNA strings
+(assert (= x "TTCGTGGCTCCAATCGATACACGACGCACTTATGATCAAACATTTACATATGAAGTGAGTGGATGGAAAGTCGGCAGAGGCCCAGTTGCGCTACACCATCGGCGTTGAAGACCGACGTAGAAGGTAGCGGCGCGGTGAAGCAACTATAGACTGTCAGTTATAGGAAAAGCGGTGGCGAAGAAACGCCATACCGTTATGCC"))
+(assert (= z "gagugcuuaagugga"))
+
+; Pattern must be contained in y
+(assert (str.contains y z))
+
+(check-sat)
+(get-value (y))
+(exit)