Consistency problems arise in many fundamental database applications as data exchange, data integration, data warehouse and many others. The chase algorithm is a fundamental and useful tool fixing inconsistencies of database instances with respect to a set of data dependencies. It is well known that the chase algorithm may be non-terminating and several techniques and criteria for checking chase termination have been recently proposed. This paper presents ChaseT, a tool that allows users to design data dependencies and combine different criteria and rewriting algorithms for checking chase termination.