Non-realizability of $K_{3k+4}$ as a semi-arc $k$-visibility graph

Let $K_{3k+4}$ denote the complete graph on $3k+4$ vertices, and let a semi-arc $k$-visibility graph be a graph represented by semi-arcs with visibility determined by at most $k$ blockers. Complete-graph non-realizability conjecture. The complete graph $K_{3k+4}$ is not a semi-arc $k$-visibility graph.

This conjecture is presented as a consequence of the preceding maximum-edge conjecture: applying that bound at $n=3k+4$ would give fewer than the $\binom{3k+4}{2}$ edges of the complete graph. It remains open in the supplied source.