What is the maximum amount of steps a Turing machine needs to take before you know it won't accept the input?

Question

So for example, we take a Turing machine $M$ with alphabet $\{0,1\}$ and 10 states, where $q_0$ is the initial state and $q_F$ is the accepting state. For a certain algorithm or calculation $M$ is allowed to take $x$ amount of steps, for example $x = 15$. How many steps does $M$ need to take before you reach a point at which you already know it won't accept the given input?