  Satisfiability Modulo Theories (SMT) has significant application in various
domains. In this paper, we focus on quantifier-free Satisfiablity Modulo Real
Arithmetic, referred to as SMT(RA), including both linear and non-linear real
arithmetic theories. As for non-linear real arithmetic theory, we focus on one
of its important fragments where the atomic constraints are multi-linear. We
propose the first local search algorithm for SMT(RA), called LocalSMT(RA),
based on two novel ideas. First, an interval-based operator is proposed to
cooperate with the traditional local search operator by considering the
interval information. Moreover, we propose a tie-breaking mechanism to further
evaluate the operations when the operations are indistinguishable according to
the score function. Experiments are conducted to evaluate LocalSMT(RA) on
benchmarks from SMT-LIB. The results show that LocalSMT(RA) is competitive with
the state-of-the-art SMT solvers, and performs particularly well on
multi-linear instances.
