Is my proof of Asmuth-Bloom scheme's perfection correct?
Okay, so i was finally able to figure out a solution for this.
The scheme does indeed yield 138 valid results to guess the secret from. However, since they already know the secret lies in $\mathbb{Z}_{m_0}$ there are only (in the example above) 42 possible secrets anyways. Since $a$ is uniformly distributed, the scheme does indeed leak some probabilistic information about the secret when you apply $\bmod 43$ to all 138 possible values, as seen in:

So for example, an attacker could determine that 2,3 or 4 are more likely than for example 0 or 1.
However, there is no information leaked about the secret itself.