; @author Jonas Schöpf
; Ctrl example from examples/student/fib11.ctrs
(format LCTRS :smtlib 2.6)
(theory Ints)
(sort Unit)
(fun v (-> Int Int Int Int Int Unit))
(fun return (-> Int Unit))
(fun u (-> Int Int Int Int Int Unit))
(fun fastfib (-> Int Unit))

(rule (v n pre1 pre2 val i) (return val) :guard (and (not (<= i n)) (not (< val 0))) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (v n pre1 pre2 val i) (return -1) :guard (and (not (<= i n)) (< val 0)) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (v n pre1 pre2 val i) (v n (+ pre1 pre2) pre1 (+ pre1 pre2) (+ i 1)) :guard (<= i n) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (u n pre1 pre2 val i) (v n pre1 pre2 val 2) :guard (and (not (<= n 0)) (not (= n 1))) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (u n pre1 pre2 val i) (return 1) :guard (and (not (<= n 0)) (= n 1)) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (u n pre1 pre2 val i) (return 0) :guard (<= n 0) :var ((n Int) (pre1 Int) (pre2 Int) (val Int) (i Int)))
(rule (fastfib n) (u n 1 0 0 rnd) :var ((n Int) (rnd Int)))