An upper bound for adjacent-vertex-strongly-distinguishing V-total chromatic numbers is obtained by Lovasz local lemma of probability method. We show that adjacent vertex strongly distinguishing V-total chromatic numbers of graph G is not more than 49△for△ ≥ 5, where G is a simple graph with no isolated edge and the order not less than three.