diff --git a/deploy/README.md b/deploy/README.md
index 23c405157..74883384b 100644
--- a/deploy/README.md
+++ b/deploy/README.md
@@ -1,5 +1,7 @@
 # Run with Docker
 
+**Note: As of April 2023, the `fuzzingbook` images are no longer available from DockerHub. These instructions are still available for documentation purposes only.***
+
 The first step is to download and install [Docker](https://www.docker.com/). Follow the installation procedure recommended at docker.com, or, if you are using Linux, refer to your distribution for information on the installation process.
 
 Once installed, make sure Docker works by typing `docker info` in a shell.
diff --git a/notebooks/Fuzzer.ipynb b/notebooks/Fuzzer.ipynb
index 2d0f8f2e5..3bfb9a1a1 100644
--- a/notebooks/Fuzzer.ipynb
+++ b/notebooks/Fuzzer.ipynb
@@ -863,12 +863,43 @@
     "     ], \"9 ** 0.5\")"
    ]
   },
+  {
+   "attachments": {},
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": []
+  },
+  {
+   "attachments": {},
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "The chance is actually higher than you may think. If you remove `/` (the root of all files), for instance, your entire file system will be gone. If you remove `.` (the current folder), all the files in the current directory will be gone. \n",
+    "\n",
+    "The probability of generating a string that is exactly 1 character long is 1/101, this is because the length of the string is determined by calling random.randrange(0, max_length + 1), where the default value of max_length is 100. Per the description given of random.randrange, that should return a random number in [0, 99 + 1). So, we end up with the inclusive range [0, 100] where there are 101 values in the interval.\n",
+    "\n",
+    "For `/` or `.` to be produced, you need a string length of 1 (chance: 1 out of 101) and one of these two characters (chance: 2 out of 32)."
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "1/101 * 2/32"
+   ]
+  },
   {
    "attachments": {},
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "The chance is actually higher than you may think. If you remove `/` (the root of all files), for instance, your entire file system will be gone. If you remove `~` (your home directory), all your files will be gone. If you remove `.` (the current folder), all the files in the current directory will be gone. For any of these to be produced, you need a string length of 1 (chance: 1 out of 100) and one of these three characters (chance: 3 out of 32), which indeed is a chance of about one in a thousand."
+    "The above code block precludes the possiblity of removing `~` (your home directory), this is because the probability of generating the character '~' is not 1/32; it is 0/32. The characters are created by calling chr(random.randrange(char_start, char_start + char_range)), where the default value of char_start is 32 and the default value of char_range is 32. The documentation for chr reads, \"[r]eturn the string representing a character whose Unicode code point is the integer i.\" The Unicode code point for '~' is 126 and therefore, not in the interval [32, 64). \n",
+    "\n",
+    "If the code were to be changed so that char_range = 95 then the probability of obtaining the character '~' would be 1/94 , thus resulting in the probability of the event of deleting all files being equal to 0.000332\n",
+    "\n",
+    "And all your files in the home directory will be gone"
    ]
   },
   {
@@ -877,14 +908,27 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "1/100 * 3/32"
+    "3/94 * 1/94 * 99/101"
    ]
   },
   {
+   "attachments": {},
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "However, we can actually deal with any string as long as the _second_ character is a space – after all, `rm -fr / WHATEVER` will first deal with `/`, and only then with whatever follows. The chances for the first character are 3 out of 32, for the space 1 out of 32, so we're more at 1 out of 300:"
+    "However, we can actually deal with any string as long as the _second_ character is a space – after all, `rm -fr / WHATEVER` will first deal with `/`, and only then with whatever follows. The chances for the first character are 2 out of 32 as the code block above only allows for the probability of obtaining a `/` or a `.` but not a `~`.\n",
+    "\n",
+    "For the space the probability is 1 out of 32.\n",
+    "\n",
+    "We have to include the term for the probability of obtaining at least 2 characters which is required for the scenario of obtaining a space as the second character. This probability is 99/101 because it is calculated as (1 - probabilty of obtaining a single character or no character at all), so it is equal to 1-(2/101).\n",
+    "\n",
+    "Therefore, the probability calculation for the event of deleting all files in the case of having a space for the second character is:\n",
+    "\n",
+    "[probability of obtaining '/' or '. ' followed by a space] = [the probability of obtaining either the '/' character or the '. ' character] * [the probability of obtaining space] * [Probability of getting at least 2 characters] = 0.001914\n",
+    "\n",
+    "\n",
+    "\n",
+    "Diagram of probability of obtaining at least 2 characters."
    ]
   },
   {
@@ -893,7 +937,7 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "3/32 * 1/32"
+    "2/32 * 1/32 * 99/101"
    ]
   },
   {
diff --git a/notebooks/PICS/FuzzingWithConstraints-synopsis-1.svg b/notebooks/PICS/FuzzingWithConstraints-synopsis-1.svg
index 88b4dbe4b..2d2ca181c 100644
--- a/notebooks/PICS/FuzzingWithConstraints-synopsis-1.svg
+++ b/notebooks/PICS/FuzzingWithConstraints-synopsis-1.svg
@@ -19,7 +19,7 @@
 <text text-anchor="start" x="8" y="-61.3" font-family="Patua One, Helvetica, sans-serif" font-weight="bold" font-size="14.00" fill="#b03a2e">ISLaSolver</text>
 <polyline fill="none" stroke="black" points="0,-52.5 82,-52.5"/>
 <g id="a_node1_0"><a xlink:href="#" xlink:title="ISLaSolver">
-<g id="a_node1_1"><a xlink:href="isla.solver.ipynb" xlink:title="__init__(self, grammar: Union[Dict[str, List[str]], str], formula: isla.language.Formula | str = &#39;true&#39;, structural_predicates: Set[isla.language.StructuralPredicate] = {StructuralPredicate(name=&#39;after&#39;, arity=2, eval_fun=&lt;function is_after&gt;), StructuralPredicate(name=&#39;inside&#39;, arity=2, eval_fun=&lt;function in_tree&gt;), StructuralPredicate(name=&#39;nth&#39;, arity=3, eval_fun=&lt;function is_nth&gt;), StructuralPredicate(name=&#39;before&#39;, arity=2, eval_fun=&lt;function is_before&gt;), StructuralPredicate(name=&#39;direct_child&#39;, arity=2, eval_fun=&lt;function is_direct_child&gt;), StructuralPredicate(name=&#39;different_position&#39;, arity=2, eval_fun=&lt;function is_different_position&gt;), StructuralPredicate(name=&#39;same_position&#39;, arity=2, eval_fun=&lt;function is_same_position&gt;), StructuralPredicate(name=&#39;level&#39;, arity=4, eval_fun=&lt;function level_check&gt;), StructuralPredicate(name=&#39;consecutive&#39;, arity=2, eval_fun=&lt;function consecutive&gt;)}, semantic_predicates: Set[isla.language.SemanticPredicate] = {SemanticPredicate(count, 3)}, max_number_free_instantiations: int = 10, max_number_smt_instantiations: int = 10, max_number_tree_insertion_results: int = 5, enforce_unique_trees_in_queue: bool = True, debug: bool = False, cost_computer: Optional[ForwardRef(&#39;CostComputer&#39;)] = None, timeout_seconds: Optional[int] = None, global_fuzzer: bool = False, predicates_unique_in_int_arg: Tuple[isla.language.SemanticPredicate, ...] = (SemanticPredicate(count, 3),), fuzzer_factory: Callable[[Dict[str, List[str]]], isla.fuzzer.GrammarFuzzer] = &lt;function ISLaSolver.&lt;lambda&gt;&gt;, tree_insertion_methods: Optional[int] = None, activate_unsat_support: bool = False, grammar_unwinding_threshold: int = 4, initial_tree: isla.helpers.Maybe[isla.derivation_tree.DerivationTree] = Maybe(a=None), enable_optimized_z3_queries: bool = True):&#10;Constructs a new ISLaSolver object. Passing a grammar and a formula is mandatory.&#10;&#10;:param grammar: The underlying grammar; either, as a &quot;Fuzzing Book&quot; dictionary or in BNF syntax.&#10;:param formula: The formula to solve; either a string or a readily parsed formula.&#10;:param structural_predicates: Structural predicates to use when parsing a formula.&#10;:param semantic_predicates: Semantic predicates to use when parsing a formula.&#10;:param max_number_free_instantiations: Number of times that nonterminals that are not bound by any formula&#10;should be expanded by a coverage&#45;based fuzzer.&#10;:param max_number_smt_instantiations: Number of solutions of SMT formulas that should be produced.&#10;:param max_number_tree_insertion_results: The maximum number of results when solving existential quantifiers&#10;by tree insertion.&#10;:param enforce_unique_trees_in_queue: If true, states with the same tree as an already existing tree in the&#10;queue are discarded, irrespectively of the constraint.&#10;:param debug: If true, debug information about the evolution of states is collected, notably in the&#10;field state_tree. The root of the tree is in the field state_tree_root. The field costs stores the computed&#10;cost values for all new nodes.&#10;:param cost_computer: The `CostComputer` class for computing the cost relevant to placing states&#10;in ISLa&#39;s queue.&#10;:param timeout_seconds: Number of seconds after which the solver will terminate.&#10;:param global_fuzzer: If set to True, only one coverage&#45;guided grammar fuzzer object is used to finish&#10;off unconstrained open derivation trees throughout the whole generation time. This may be beneficial for&#10;some targets; e.g., we experienced that CSV works significantly faster. However, the achieved k&#45;path coverage&#10;can be lower with that setting.&#10;:param predicates_unique_in_int_arg: This is needed in certain cases for instantiating universal&#10;integer quantifiers. The supplied predicates should have exactly one integer argument, and hold&#10;for exactly one integer value once all other parameters are fixed.&#10;:param fuzzer_factory: Constructor of the fuzzer to use for instantiating &quot;free&quot; nonterminals.&#10;:param tree_insertion_methods: Combination of methods to use for existential quantifier elimination by&#10;tree insertion. Full selection: `DIRECT_EMBEDDING &amp; SELF_EMBEDDING &amp; CONTEXT_ADDITION`.&#10;:param activate_unsat_support: Set to True if you assume that a formula might be unsatisfiable. This&#10;triggers additional tests for unsatisfiability that reduce input generation performance, but might&#10;ensure termination (with a negative solver result) for unsatisfiable problems for which the solver&#10;could otherwise diverge.&#10;:param grammar_unwinding_threshold: When querying the SMT solver, ISLa passes a regular expression for&#10;the syntax of the involved nonterminals. If this syntax is not regular, we unwind the respective part&#10;in the reference grammar up to a depth of `grammar_unwinding_threshold`. If this is too shallow, it can&#10;happen that an equation etc. cannot be solved; if it is too deep, it can negatively impact performance&#10;(and quite tremendously so).&#10;:param initial_tree: An initial input tree for the queue, if the solver shall&#10;not start from the tree `(&lt;start&gt;, None)`.&#10;:param enable_optimized_z3_queries: Enables preprocessing of Z3 queries (mainly&#10;numeric problems concerning things like length). This can improve performance&#10;significantly; however, it might happen that certain problems cannot be solved&#10;anymore. In that case, this option can/should be deactivated.">
+<g id="a_node1_1"><a xlink:href="isla.solver.ipynb" xlink:title="__init__(self, grammar: Union[Dict[str, List[str]], str], formula: Union[isla.language.Formula, str, NoneType] = None, structural_predicates: Set[isla.language.StructuralPredicate] = {StructuralPredicate(name=&#39;inside&#39;, arity=2, eval_fun=&lt;function in_tree&gt;), StructuralPredicate(name=&#39;after&#39;, arity=2, eval_fun=&lt;function is_after&gt;), StructuralPredicate(name=&#39;same_position&#39;, arity=2, eval_fun=&lt;function is_same_position&gt;), StructuralPredicate(name=&#39;direct_child&#39;, arity=2, eval_fun=&lt;function is_direct_child&gt;), StructuralPredicate(name=&#39;before&#39;, arity=2, eval_fun=&lt;function is_before&gt;), StructuralPredicate(name=&#39;nth&#39;, arity=3, eval_fun=&lt;function is_nth&gt;), StructuralPredicate(name=&#39;different_position&#39;, arity=2, eval_fun=&lt;function is_different_position&gt;), StructuralPredicate(name=&#39;consecutive&#39;, arity=2, eval_fun=&lt;function consecutive&gt;), StructuralPredicate(name=&#39;level&#39;, arity=4, eval_fun=&lt;function level_check&gt;)}, semantic_predicates: Set[isla.language.SemanticPredicate] = {SemanticPredicate(count, 3)}, max_number_free_instantiations: int = 10, max_number_smt_instantiations: int = 10, max_number_tree_insertion_results: int = 5, enforce_unique_trees_in_queue: bool = True, debug: bool = False, cost_computer: Optional[ForwardRef(&#39;CostComputer&#39;)] = None, timeout_seconds: Optional[int] = None, global_fuzzer: bool = False, predicates_unique_in_int_arg: Tuple[isla.language.SemanticPredicate, ...] = (SemanticPredicate(count, 3),), fuzzer_factory: Callable[[Dict[str, List[str]]], isla.fuzzer.GrammarFuzzer] = &lt;function ISLaSolver.&lt;lambda&gt;&gt;, tree_insertion_methods: Optional[int] = None, activate_unsat_support: bool = False, grammar_unwinding_threshold: int = 4, initial_tree: isla.helpers.Maybe[isla.derivation_tree.DerivationTree] = Maybe(a=None), enable_optimized_z3_queries: bool = True, start_symbol: Optional[str] = None):&#10;Constructs a new ISLaSolver object. Passing a grammar and a formula is mandatory.&#10;&#10;:param grammar: The underlying grammar; either, as a &quot;Fuzzing Book&quot; dictionary or in BNF syntax.&#10;:param formula: The formula to solve; either a string or a readily parsed&#10;formula. If no formula is given, a default `true` constraint is assumed, and&#10;the solver falls back to a grammar fuzzer. The number of produced solutions will&#10;then be bound by `max_number_free_instantiations`.&#10;:param structural_predicates: Structural predicates to use when parsing a formula.&#10;:param semantic_predicates: Semantic predicates to use when parsing a formula.&#10;:param max_number_free_instantiations: Number of times that nonterminals that are not bound by any formula&#10;should be expanded by a coverage&#45;based fuzzer.&#10;:param max_number_smt_instantiations: Number of solutions of SMT formulas that should be produced.&#10;:param max_number_tree_insertion_results: The maximum number of results when solving existential quantifiers&#10;by tree insertion.&#10;:param enforce_unique_trees_in_queue: If true, states with the same tree as an already existing tree in the&#10;queue are discarded, irrespectively of the constraint.&#10;:param debug: If true, debug information about the evolution of states is collected, notably in the&#10;field state_tree. The root of the tree is in the field state_tree_root. The field costs stores the computed&#10;cost values for all new nodes.&#10;:param cost_computer: The `CostComputer` class for computing the cost relevant to placing states&#10;in ISLa&#39;s queue.&#10;:param timeout_seconds: Number of seconds after which the solver will terminate.&#10;:param global_fuzzer: If set to True, only one coverage&#45;guided grammar fuzzer object is used to finish&#10;off unconstrained open derivation trees throughout the whole generation time. This may be beneficial for&#10;some targets; e.g., we experienced that CSV works significantly faster. However, the achieved k&#45;path coverage&#10;can be lower with that setting.&#10;:param predicates_unique_in_int_arg: This is needed in certain cases for instantiating universal&#10;integer quantifiers. The supplied predicates should have exactly one integer argument, and hold&#10;for exactly one integer value once all other parameters are fixed.&#10;:param fuzzer_factory: Constructor of the fuzzer to use for instantiating &quot;free&quot; nonterminals.&#10;:param tree_insertion_methods: Combination of methods to use for existential quantifier elimination by&#10;tree insertion. Full selection: `DIRECT_EMBEDDING &amp; SELF_EMBEDDING &amp; CONTEXT_ADDITION`.&#10;:param activate_unsat_support: Set to True if you assume that a formula might be unsatisfiable. This&#10;triggers additional tests for unsatisfiability that reduce input generation performance, but might&#10;ensure termination (with a negative solver result) for unsatisfiable problems for which the solver&#10;could otherwise diverge.&#10;:param grammar_unwinding_threshold: When querying the SMT solver, ISLa passes a regular expression for&#10;the syntax of the involved nonterminals. If this syntax is not regular, we unwind the respective part&#10;in the reference grammar up to a depth of `grammar_unwinding_threshold`. If this is too shallow, it can&#10;happen that an equation etc. cannot be solved; if it is too deep, it can negatively impact performance&#10;(and quite tremendously so).&#10;:param initial_tree: An initial input tree for the queue, if the solver shall&#10;not start from the tree `(&lt;start&gt;, None)`.&#10;:param enable_optimized_z3_queries: Enables preprocessing of Z3 queries (mainly&#10;numeric problems concerning things like length). This can improve performance&#10;significantly; however, it might happen that certain problems cannot be solved&#10;anymore. In that case, this option can/should be deactivated.&#10;:param start_symbol: This is an alternative to `initial_tree` for starting with&#10;a start symbol different form `&lt;start&gt;`. If `start_symbol` is provided, a tree&#10;consisting of a single root node with the value of `start_symbol` is chosen as&#10;initial tree.">
 <text text-anchor="start" x="11" y="-41.5" font-family="'Fira Mono', 'Source Code Pro', 'Courier', monospace" font-weight="bold" font-size="10.00">__init__()</text>
 </a>
 </g>
diff --git a/notebooks/PICS/GUIFuzzer-synopsis-2.png b/notebooks/PICS/GUIFuzzer-synopsis-2.png
index 9dd2838e6..609e798ad 100644
Binary files a/notebooks/PICS/GUIFuzzer-synopsis-2.png and b/notebooks/PICS/GUIFuzzer-synopsis-2.png differ
diff --git a/notebooks/PICS/GUIFuzzer-synopsis-2.svg b/notebooks/PICS/GUIFuzzer-synopsis-2.svg
index 0dada6ced..ebb3e4a67 100644
--- a/notebooks/PICS/GUIFuzzer-synopsis-2.svg
+++ b/notebooks/PICS/GUIFuzzer-synopsis-2.svg
@@ -52,8 +52,8 @@
 <polygon fill="black" stroke="black" points="352.01,-106.46 360.19,-99.73 349.6,-99.89 352.01,-106.46"/>
 <text text-anchor="start" x="319.56" y="-205.8" font-family="Times,serif" font-size="14.00">fill(&#39;zip&#39;, &#39;&lt;number&gt;&#39;)</text>
 <text text-anchor="start" x="319.56" y="-190.8" font-family="Times,serif" font-size="14.00">check(&#39;terms&#39;, &lt;boolean&gt;)</text>
-<text text-anchor="start" x="319.56" y="-175.8" font-family="Times,serif" font-size="14.00">fill(&#39;name&#39;, &#39;&lt;text&gt;&#39;)</text>
-<text text-anchor="start" x="319.56" y="-160.8" font-family="Times,serif" font-size="14.00">fill(&#39;email&#39;, &#39;&lt;email&gt;&#39;)</text>
+<text text-anchor="start" x="319.56" y="-175.8" font-family="Times,serif" font-size="14.00">fill(&#39;email&#39;, &#39;&lt;email&gt;&#39;)</text>
+<text text-anchor="start" x="319.56" y="-160.8" font-family="Times,serif" font-size="14.00">fill(&#39;name&#39;, &#39;&lt;text&gt;&#39;)</text>
 <text text-anchor="start" x="319.56" y="-145.8" font-family="Times,serif" font-size="14.00">fill(&#39;city&#39;, &#39;&lt;text&gt;&#39;)</text>
 <text text-anchor="start" x="319.56" y="-130.8" font-family="Times,serif" font-size="14.00">submit(&#39;submit&#39;)</text>
 </g>
diff --git a/notebooks/PICS/GUIFuzzer-synopsis-3.png b/notebooks/PICS/GUIFuzzer-synopsis-3.png
index 169bb65b5..690810e98 100644
Binary files a/notebooks/PICS/GUIFuzzer-synopsis-3.png and b/notebooks/PICS/GUIFuzzer-synopsis-3.png differ
diff --git a/notebooks/PICS/GrammarFuzzer-synopsis-2.png b/notebooks/PICS/GrammarFuzzer-synopsis-2.png
index cc4d96e86..ea7edb318 100644
Binary files a/notebooks/PICS/GrammarFuzzer-synopsis-2.png and b/notebooks/PICS/GrammarFuzzer-synopsis-2.png differ
diff --git a/notebooks/PICS/GrammarFuzzer-synopsis-2.svg b/notebooks/PICS/GrammarFuzzer-synopsis-2.svg
index 1db1f3a0b..9eacc0bbb 100644
--- a/notebooks/PICS/GrammarFuzzer-synopsis-2.svg
+++ b/notebooks/PICS/GrammarFuzzer-synopsis-2.svg
@@ -137,7 +137,7 @@
 <!-- 7 -->
 <g id="node8" class="node">
 <title>7</title>
-<text text-anchor="middle" x="108.5" y="-3.8" font-family="Times,serif" font-size="14.00">4 (52)</text>
+<text text-anchor="middle" x="108.5" y="-3.8" font-family="Times,serif" font-size="14.00">7 (55)</text>
 </g>
 <!-- 6&#45;&gt;7 -->
 <g id="edge7" class="edge">
@@ -148,7 +148,7 @@
 <!-- 9 -->
 <g id="node10" class="node">
 <title>9</title>
-<text text-anchor="middle" x="168.5" y="-3.8" font-family="Times,serif" font-size="14.00">4 (52)</text>
+<text text-anchor="middle" x="168.5" y="-3.8" font-family="Times,serif" font-size="14.00">6 (54)</text>
 </g>
 <!-- 8&#45;&gt;9 -->
 <g id="edge9" class="edge">
@@ -192,7 +192,7 @@
 <!-- 13 -->
 <g id="node14" class="node">
 <title>13</title>
-<text text-anchor="middle" x="242.5" y="-3.8" font-family="Times,serif" font-size="14.00">6 (54)</text>
+<text text-anchor="middle" x="242.5" y="-3.8" font-family="Times,serif" font-size="14.00">4 (52)</text>
 </g>
 <!-- 12&#45;&gt;13 -->
 <g id="edge13" class="edge">
@@ -203,7 +203,7 @@
 <!-- 15 -->
 <g id="node16" class="node">
 <title>15</title>
-<text text-anchor="middle" x="316.5" y="-3.8" font-family="Times,serif" font-size="14.00">4 (52)</text>
+<text text-anchor="middle" x="316.5" y="-3.8" font-family="Times,serif" font-size="14.00">1 (49)</text>
 </g>
 <!-- 14&#45;&gt;15 -->
 <g id="edge15" class="edge">
@@ -214,7 +214,7 @@
 <!-- 17 -->
 <g id="node18" class="node">
 <title>17</title>
-<text text-anchor="middle" x="376.5" y="-3.8" font-family="Times,serif" font-size="14.00">4 (52)</text>
+<text text-anchor="middle" x="376.5" y="-3.8" font-family="Times,serif" font-size="14.00">0 (48)</text>
 </g>
 <!-- 16&#45;&gt;17 -->
 <g id="edge17" class="edge">
@@ -269,7 +269,7 @@
 <!-- 21 -->
 <g id="node22" class="node">
 <title>21</title>
-<text text-anchor="middle" x="436.5" y="-3.8" font-family="Times,serif" font-size="14.00">6 (54)</text>
+<text text-anchor="middle" x="436.5" y="-3.8" font-family="Times,serif" font-size="14.00">1 (49)</text>
 </g>
 <!-- 20&#45;&gt;21 -->
 <g id="edge21" class="edge">
@@ -280,7 +280,7 @@
 <!-- 23 -->
 <g id="node24" class="node">
 <title>23</title>
-<text text-anchor="middle" x="496.5" y="-3.8" font-family="Times,serif" font-size="14.00">1 (49)</text>
+<text text-anchor="middle" x="496.5" y="-3.8" font-family="Times,serif" font-size="14.00">8 (56)</text>
 </g>
 <!-- 22&#45;&gt;23 -->
 <g id="edge23" class="edge">
@@ -291,7 +291,7 @@
 <!-- 25 -->
 <g id="node26" class="node">
 <title>25</title>
-<text text-anchor="middle" x="556.5" y="-3.8" font-family="Times,serif" font-size="14.00">6 (54)</text>
+<text text-anchor="middle" x="556.5" y="-3.8" font-family="Times,serif" font-size="14.00">9 (57)</text>
 </g>
 <!-- 24&#45;&gt;25 -->
 <g id="edge25" class="edge">
@@ -302,7 +302,7 @@
 <!-- 27 -->
 <g id="node28" class="node">
 <title>27</title>
-<text text-anchor="middle" x="616.5" y="-3.8" font-family="Times,serif" font-size="14.00">3 (51)</text>
+<text text-anchor="middle" x="616.5" y="-3.8" font-family="Times,serif" font-size="14.00">5 (53)</text>
 </g>
 <!-- 26&#45;&gt;27 -->
 <g id="edge27" class="edge">
diff --git a/notebooks/PICS/GrammarMiner-synopsis-3.png b/notebooks/PICS/GrammarMiner-synopsis-3.png
index b2a534f1a..085e51f68 100644
Binary files a/notebooks/PICS/GrammarMiner-synopsis-3.png and b/notebooks/PICS/GrammarMiner-synopsis-3.png differ
diff --git a/notebooks/PICS/GrammarMiner-synopsis-3.svg b/notebooks/PICS/GrammarMiner-synopsis-3.svg
index 9af18083f..d9f7d6527 100644
--- a/notebooks/PICS/GrammarMiner-synopsis-3.svg
+++ b/notebooks/PICS/GrammarMiner-synopsis-3.svg
@@ -28,7 +28,7 @@
 </style><g>
 <path d="M20 51v20m10 -20v20m-10 -10h20"/></g><g>
 <path d="M40 61h0.0"/><path d="M142.5 61h0.0"/><path d="M40.0 61a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/><g>
-<path d="M60.0 31h0.0"/><path d="M122.5 31h0.0"/><g class="terminal">
-<path d="M60.0 31h0.0"/><path d="M122.5 31h0.0"/><rect height="22" rx="10" ry="10" width="62.5" x="60.0" y="20"/><text x="91.25" y="35">https</text></g></g><path d="M122.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
-<path d="M60.0 61h4.25"/><path d="M118.25 61h4.25"/><g class="terminal">
-<path d="M64.25 61h0.0"/><path d="M118.25 61h0.0"/><rect height="22" rx="10" ry="10" width="54.0" x="64.25" y="50"/><text x="91.25" y="65">http</text></g></g><path d="M122.5 61h20"/></g><path d="M 142.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
+<path d="M60.0 31h4.25"/><path d="M118.25 31h4.25"/><g class="terminal">
+<path d="M64.25 31h0.0"/><path d="M118.25 31h0.0"/><rect height="22" rx="10" ry="10" width="54.0" x="64.25" y="20"/><text x="91.25" y="35">http</text></g></g><path d="M122.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
+<path d="M60.0 61h0.0"/><path d="M122.5 61h0.0"/><g class="terminal">
+<path d="M60.0 61h0.0"/><path d="M122.5 61h0.0"/><rect height="22" rx="10" ry="10" width="62.5" x="60.0" y="50"/><text x="91.25" y="65">https</text></g></g><path d="M122.5 61h20"/></g><path d="M 142.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
diff --git a/notebooks/PICS/GrammarMiner-synopsis-4.png b/notebooks/PICS/GrammarMiner-synopsis-4.png
index 5d6d21dd7..4d5c7eb42 100644
Binary files a/notebooks/PICS/GrammarMiner-synopsis-4.png and b/notebooks/PICS/GrammarMiner-synopsis-4.png differ
diff --git a/notebooks/PICS/GrammarMiner-synopsis-4.svg b/notebooks/PICS/GrammarMiner-synopsis-4.svg
index e9b7d51ad..059f1fff3 100644
--- a/notebooks/PICS/GrammarMiner-synopsis-4.svg
+++ b/notebooks/PICS/GrammarMiner-synopsis-4.svg
@@ -28,11 +28,11 @@
 </style><g>
 <path d="M20 51v20m10 -20v20m-10 -10h20"/></g><g>
 <path d="M40 61h0.0"/><path d="M494.5 61h0.0"/><path d="M40.0 61a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/><g>
-<path d="M60.0 31h0.0"/><path d="M474.5 31h0.0"/><g class="terminal">
-<path d="M60.0 31h0.0"/><path d="M97.0 31h0.0"/><rect height="22" rx="10" ry="10" width="37.0" x="60.0" y="20"/><text x="78.5" y="35">//</text></g><path d="M97.0 31h10"/><path d="M107.0 31h10"/><g class="non-terminal">
-<path d="M117.0 31h0.0"/><path d="M298.5 31h0.0"/><rect height="22" width="181.5" x="117.0" y="20"/><text x="207.75" y="35">urlparse@394:netloc</text></g><path d="M298.5 31h10"/><path d="M308.5 31h10"/><g class="non-terminal">
-<path d="M318.5 31h0.0"/><path d="M474.5 31h0.0"/><rect height="22" width="156.0" x="318.5" y="20"/><text x="396.5" y="35">urlsplit@481:url</text></g></g><path d="M474.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
-<path d="M60.0 61h63.75"/><path d="M410.75 61h63.75"/><g class="terminal">
-<path d="M123.75 61h0.0"/><path d="M160.75 61h0.0"/><rect height="22" rx="10" ry="10" width="37.0" x="123.75" y="50"/><text x="142.25" y="65">//</text></g><path d="M160.75 61h10"/><path d="M170.75 61h10"/><g class="non-terminal">
-<path d="M180.75 61h0.0"/><path d="M362.25 61h0.0"/><rect height="22" width="181.5" x="180.75" y="50"/><text x="271.5" y="65">urlparse@394:netloc</text></g><path d="M362.25 61h10"/><path d="M372.25 61h10"/><g class="terminal">
-<path d="M382.25 61h0.0"/><path d="M410.75 61h0.0"/><rect height="22" rx="10" ry="10" width="28.5" x="382.25" y="50"/><text x="396.5" y="65">/</text></g></g><path d="M474.5 61h20"/></g><path d="M 494.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
+<path d="M60.0 31h63.75"/><path d="M410.75 31h63.75"/><g class="terminal">
+<path d="M123.75 31h0.0"/><path d="M160.75 31h0.0"/><rect height="22" rx="10" ry="10" width="37.0" x="123.75" y="20"/><text x="142.25" y="35">//</text></g><path d="M160.75 31h10"/><path d="M170.75 31h10"/><g class="non-terminal">
+<path d="M180.75 31h0.0"/><path d="M362.25 31h0.0"/><rect height="22" width="181.5" x="180.75" y="20"/><text x="271.5" y="35">urlparse@394:netloc</text></g><path d="M362.25 31h10"/><path d="M372.25 31h10"/><g class="terminal">
+<path d="M382.25 31h0.0"/><path d="M410.75 31h0.0"/><rect height="22" rx="10" ry="10" width="28.5" x="382.25" y="20"/><text x="396.5" y="35">/</text></g></g><path d="M474.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
+<path d="M60.0 61h0.0"/><path d="M474.5 61h0.0"/><g class="terminal">
+<path d="M60.0 61h0.0"/><path d="M97.0 61h0.0"/><rect height="22" rx="10" ry="10" width="37.0" x="60.0" y="50"/><text x="78.5" y="65">//</text></g><path d="M97.0 61h10"/><path d="M107.0 61h10"/><g class="non-terminal">
+<path d="M117.0 61h0.0"/><path d="M298.5 61h0.0"/><rect height="22" width="181.5" x="117.0" y="50"/><text x="207.75" y="65">urlparse@394:netloc</text></g><path d="M298.5 61h10"/><path d="M308.5 61h10"/><g class="non-terminal">
+<path d="M318.5 61h0.0"/><path d="M474.5 61h0.0"/><rect height="22" width="156.0" x="318.5" y="50"/><text x="396.5" y="65">urlsplit@481:url</text></g></g><path d="M474.5 61h20"/></g><path d="M 494.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
diff --git a/notebooks/PICS/GrammarMiner-synopsis-5.png b/notebooks/PICS/GrammarMiner-synopsis-5.png
index 5382b4a53..87e8731cb 100644
Binary files a/notebooks/PICS/GrammarMiner-synopsis-5.png and b/notebooks/PICS/GrammarMiner-synopsis-5.png differ
diff --git a/notebooks/PICS/GrammarMiner-synopsis-5.svg b/notebooks/PICS/GrammarMiner-synopsis-5.svg
index b74b194a2..8a6f771a5 100644
--- a/notebooks/PICS/GrammarMiner-synopsis-5.svg
+++ b/notebooks/PICS/GrammarMiner-synopsis-5.svg
@@ -28,9 +28,9 @@
 </style><g>
 <path d="M20 51v20m10 -20v20m-10 -10h20"/></g><g>
 <path d="M40 61h0.0"/><path d="M329.5 61h0.0"/><path d="M40.0 61a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/><g>
-<path d="M60.0 31h0.0"/><path d="M309.5 31h0.0"/><g class="terminal">
-<path d="M60.0 31h0.0"/><path d="M309.5 31h0.0"/><rect height="22" rx="10" ry="10" width="249.5" x="60.0" y="20"/><text x="184.75" y="35">user:pass@www.google.com:80</text></g></g><path d="M309.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
-<path d="M60.0 61h34.0"/><path d="M275.5 61h34.0"/><g class="terminal">
-<path d="M94.0 61h0.0"/><path d="M275.5 61h0.0"/><rect height="22" rx="10" ry="10" width="181.5" x="94.0" y="50"/><text x="184.75" y="65">www.fuzzingbook.org</text></g></g><path d="M309.5 61h20"/><path d="M40.0 61a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><g>
-<path d="M60.0 91h25.5"/><path d="M284.0 91h25.5"/><g class="terminal">
-<path d="M85.5 91h0.0"/><path d="M284.0 91h0.0"/><rect height="22" rx="10" ry="10" width="198.5" x="85.5" y="80"/><text x="184.75" y="95">www.cispa.saarland:80</text></g></g><path d="M309.5 91a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/></g><path d="M 329.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
+<path d="M60.0 31h34.0"/><path d="M275.5 31h34.0"/><g class="terminal">
+<path d="M94.0 31h0.0"/><path d="M275.5 31h0.0"/><rect height="22" rx="10" ry="10" width="181.5" x="94.0" y="20"/><text x="184.75" y="35">www.fuzzingbook.org</text></g></g><path d="M309.5 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
+<path d="M60.0 61h25.5"/><path d="M284.0 61h25.5"/><g class="terminal">
+<path d="M85.5 61h0.0"/><path d="M284.0 61h0.0"/><rect height="22" rx="10" ry="10" width="198.5" x="85.5" y="50"/><text x="184.75" y="65">www.cispa.saarland:80</text></g></g><path d="M309.5 61h20"/><path d="M40.0 61a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><g>
+<path d="M60.0 91h0.0"/><path d="M309.5 91h0.0"/><g class="terminal">
+<path d="M60.0 91h0.0"/><path d="M309.5 91h0.0"/><rect height="22" rx="10" ry="10" width="249.5" x="60.0" y="80"/><text x="184.75" y="95">user:pass@www.google.com:80</text></g></g><path d="M309.5 91a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/></g><path d="M 329.5 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
diff --git a/notebooks/PICS/GrammarMiner-synopsis-9.png b/notebooks/PICS/GrammarMiner-synopsis-9.png
index a54a8865a..cf63b8171 100644
Binary files a/notebooks/PICS/GrammarMiner-synopsis-9.png and b/notebooks/PICS/GrammarMiner-synopsis-9.png differ
diff --git a/notebooks/PICS/GrammarMiner-synopsis-9.svg b/notebooks/PICS/GrammarMiner-synopsis-9.svg
index d93a76983..26f258c9f 100644
--- a/notebooks/PICS/GrammarMiner-synopsis-9.svg
+++ b/notebooks/PICS/GrammarMiner-synopsis-9.svg
@@ -28,7 +28,7 @@
 </style><g>
 <path d="M20 51v20m10 -20v20m-10 -10h20"/></g><g>
 <path d="M40 61h0.0"/><path d="M134.0 61h0.0"/><path d="M40.0 61a10 10 0 0 0 10 -10v-10a10 10 0 0 1 10 -10"/><g>
-<path d="M60.0 31h4.25"/><path d="M109.75 31h4.25"/><g class="terminal">
-<path d="M64.25 31h0.0"/><path d="M109.75 31h0.0"/><rect height="22" rx="10" ry="10" width="45.5" x="64.25" y="20"/><text x="87.0" y="35">ref</text></g></g><path d="M114.0 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
-<path d="M60.0 61h0.0"/><path d="M114.0 61h0.0"/><g class="terminal">
-<path d="M60.0 61h0.0"/><path d="M114.0 61h0.0"/><rect height="22" rx="10" ry="10" width="54.0" x="60.0" y="50"/><text x="87.0" y="65">News</text></g></g><path d="M114.0 61h20"/></g><path d="M 134.0 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
+<path d="M60.0 31h0.0"/><path d="M114.0 31h0.0"/><g class="terminal">
+<path d="M60.0 31h0.0"/><path d="M114.0 31h0.0"/><rect height="22" rx="10" ry="10" width="54.0" x="60.0" y="20"/><text x="87.0" y="35">News</text></g></g><path d="M114.0 31a10 10 0 0 1 10 10v10a10 10 0 0 0 10 10"/><path d="M40.0 61h20"/><g>
+<path d="M60.0 61h4.25"/><path d="M109.75 61h4.25"/><g class="terminal">
+<path d="M64.25 61h0.0"/><path d="M109.75 61h0.0"/><rect height="22" rx="10" ry="10" width="45.5" x="64.25" y="50"/><text x="87.0" y="65">ref</text></g></g><path d="M114.0 61h20"/></g><path d="M 134.0 61 h 20 m -10 -10 v 20 m 10 -20 v 20"/></g></svg>
\ No newline at end of file
diff --git a/notebooks/ReleaseNotes.ipynb b/notebooks/ReleaseNotes.ipynb
index 4c4819d15..7d6782097 100644
--- a/notebooks/ReleaseNotes.ipynb
+++ b/notebooks/ReleaseNotes.ipynb
@@ -32,7 +32,8 @@
     "\n",
     "* We now support **Python 3.10**. Using Python 3.9 should still work fine.\n",
     "* We fixed several typos throughout the book, using the awesome [LTeX](https://github.com/valentjn/vscode-ltex) grammar/spell checker\n",
-    "* `ProbabilisticGrammarMiner` now properly handles empty expansions ([Issue #154](https://github.com/uds-se/fuzzingbook/pull/154)) - thanks to [Martin Eberlein](https://github.com/martineberlein)!"
+    "* `ProbabilisticGrammarMiner` now properly handles empty expansions ([Issue #154](https://github.com/uds-se/fuzzingbook/pull/154)) - thanks to [Martin Eberlein](https://github.com/martineberlein)!\n",
+    "* We no longer support `fuzzingbook` DockerHub images."
    ]
   },
   {
@@ -250,7 +251,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.10.2 (main, Apr 22 2022, 17:40:25) [Clang 13.1.6 (clang-1316.0.21.2.3)]"
+   "version": "3.10.2"
   },
   "toc": {
    "base_numbering": 1,
diff --git a/notebooks/index.ipynb b/notebooks/index.ipynb
index 4f82f3bbf..ad30f1677 100644
--- a/notebooks/index.ipynb
+++ b/notebooks/index.ipynb
@@ -109,6 +109,7 @@
    ]
   },
   {
+   "attachments": {},
    "cell_type": "markdown",
    "metadata": {},
    "source": [
@@ -120,9 +121,7 @@
     "\n",
     "2. **Download the Jupyter Notebooks** (using the menu at the top) and open them in Jupyter.  Here's [how to install jupyter notebook on your machine](https://www.dataquest.io/blog/jupyter-notebook-tutorial/).\n",
     "\n",
-    "3. **Run the notebook locally** in a Docker container. For more information, see [How to use the book with Docker](https://github.com/uds-se/fuzzingbook/blob/master/deploy/README.md).  \n",
-    "\n",
-    "4. If you want to use the book in a classroom, and depend on your users having access to the interactive notebooks, consider using or deploying a [JupyterHub](http://jupyter.org/hub) or [BinderHub](https://github.com/jupyterhub/binderhub) instance."
+    "3. If you want to use the book in a classroom, and depend on your users having access to the interactive notebooks, consider using or deploying a [JupyterHub](http://jupyter.org/hub) or [BinderHub](https://github.com/jupyterhub/binderhub) instance."
    ]
   },
   {
@@ -133,10 +132,11 @@
    ]
   },
   {
+   "attachments": {},
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "We try to keep the code as general as possible, but occasionally, when we interact with the operating system, we assume a Unix-like environment (because that is what Binder provides).  To run these examples on your own Windows machine, you can install a Linux VM or a [Docker environment](https://github.com/uds-se/fuzzingbook/blob/master/deploy/README.md)."
+    "We try to keep the code as general as possible, but occasionally, when we interact with the operating system, we assume a Unix-like environment (because that is what Binder provides).  To run these examples on your own Windows machine, you can install a Linux Subsystem or a Linux Virtual Machine."
    ]
   },
   {