The Riemann Hypothesis is also equivalent to $|\pi(x) - Li(x)| = O(x^{1/2 + \epsilon})$, so let's look at that instead. In other words, $\log$ of the error should be about $(1/2) \log x$.

The sequence of points plotted below is $( \log x,\ \log |\pi(x) - Li(x)|)$ for $x=10^k$, with $1 \leq k \leq 23$. The straight line has slope $1/2$, with constant term chosen by a least squares fit (specifically, the line is $x/2 -1.24878$). Interpreted in this way, you can definitely see the promised asymptotic behavior.

    ![alt text][1][(source)][3]

(Data set courtesy of [Wikipedia][2])

Note: My $\log$'s are base $10$, since my data set was binned by powers of $10$ already. Of course, that doesn't effect the slope.


  [1]: https://i.sstatic.net/O5kZ8.png
  [2]: http://en.wikipedia.org/wiki/Prime_number_theorem#Table_of_.CF.80.28x.29.2C_x_.2F_ln_x.2C_and_li.28x.29
  [3]: http://www.math.lsa.umich.edu/~speyer/PrimeError.png