Baumgart's conjecture that every graphic matroid is SIBO

A rank-$r$ matroid is subsequence-interchangeably base orderable (SIBO) if every pair of bases $A$ and $B$ admits orderings $a_1,\ldots,a_r$ of $A$ and $b_1,\ldots,b_r$ of $B$ such that

$$(B\setminus\{b_i,\ldots,b_j\})\cup\{a_i,\ldots,a_j\}$$

is a basis for every $1\le i\le j\le r$. Baumgart's conjecture. Every graphic matroid is SIBO. If true, this would imply the proximity conjecture for graphic matroids; the conjecture is presented as open in the paper.