Connectivity conjecture for the triangle flip-graph of pseudocircle arrangements

Let $n\in\mathbb{N}$. Consider the triangle flip-graph whose vertices are all intersecting digon-free arrangements of $n$ pseudocircles, with edges corresponding to single triangle flips.

Triangle flip-graph connectivity conjecture. The triangle flip-graph on the set of all intersecting digon-free arrangements of $n$ pseudocircles is connected for every $n\in\mathbb{N}$.

The analogous statement for arrangements of circles is proved in the source, while computational evidence supports the pseudocircle version for $n\leq 7$. The conjecture remains unresolved in the supplied text.