Recently, Carpi and D’Alessandro [3] have formulated a conjecture whose validity would imply an O(n 2) upper bound for the minimum length of reset words for synchronizing automata with n states. We refute this conjecture as well as a related conjecture by Rystsov [13] and suggest a weaker version that still suffices to achieve a quadratic upper bound.