Experiments on Infinite Model Finding in SMT Solving
Julian Parsert, Chad E. Brown, Mikoláš Janota, Cezary Kaliszyk · EPiC series in computing · 2023
We propose infinite model finding as a new task for SMT-Solving. Model finding has a long-standing tradition in SMT and automated reasoning in general. Yet, most of the current tools are limited to finite models despite the fact that many theories only admit infinite models. This paper shows a variety of such problems and evaluates synthesis approaches on them. Interestingly, state-of-the-art SMT solvers fail even on very small and simple problems. We target such problems by SyGuS tools as well as heuristic approaches.