| 1 |
; COMMAND-LINE: --full-saturate-quant |
| 2 |
; EXPECT: unsat |
| 3 |
(set-option :print-success false) |
| 4 |
(set-logic AUFLIAFS) |
| 5 |
(set-info :status unsat) |
| 6 |
(declare-sort Loc 0) |
| 7 |
(define-sort SetLoc () (Set Loc)) |
| 8 |
(define-sort SetInt () (Set Int)) |
| 9 |
(declare-sort FldLoc 0) |
| 10 |
(declare-sort FldInt 0) |
| 11 |
(declare-fun null$0 () Loc) |
| 12 |
(declare-fun read$0 (FldInt Loc) Int) |
| 13 |
(declare-fun read$1 (FldLoc Loc) Loc) |
| 14 |
(declare-fun Btwn$0 (FldLoc Loc Loc Loc) Bool) |
| 15 |
(declare-fun Alloc$0 () SetLoc) |
| 16 |
(declare-fun Alloc_1$0 () SetLoc) |
| 17 |
(declare-fun Axiom_1$0 () Bool) |
| 18 |
(declare-fun FP$0 () SetLoc) |
| 19 |
(declare-fun FP_1$0 () SetLoc) |
| 20 |
(declare-fun FP_Caller$0 () SetLoc) |
| 21 |
(declare-fun FP_Caller_1$0 () SetLoc) |
| 22 |
(declare-fun cp_2$0 () Loc) |
| 23 |
(declare-fun curr_2$0 () Loc) |
| 24 |
(declare-fun data$0 () FldInt) |
| 25 |
(declare-fun lst$0 () Loc) |
| 26 |
(declare-fun next$0 () FldLoc) |
| 27 |
(declare-fun res_1$0 () Loc) |
| 28 |
(declare-fun sk_?X_4$0 () SetLoc) |
| 29 |
(declare-fun slseg_domain$0 (FldInt FldLoc Loc Loc) SetLoc) |
| 30 |
(declare-fun slseg_struct$0 (SetLoc FldInt FldLoc Loc Loc) Bool) |
| 31 |
(declare-fun tmp_2$0 () Loc) |
| 32 |
|
| 33 |
(assert (! (forall ((?y Loc)) |
| 34 |
(or (not (Btwn$0 next$0 null$0 ?y ?y)) (= null$0 ?y) |
| 35 |
(Btwn$0 next$0 null$0 (read$1 next$0 null$0) ?y))) |
| 36 |
:named btwn_reach_1)) |
| 37 |
|
| 38 |
(assert (! (forall ((?y Loc)) |
| 39 |
(or (not (= (read$1 next$0 null$0) null$0)) |
| 40 |
(not (Btwn$0 next$0 null$0 ?y ?y)) (= null$0 ?y))) |
| 41 |
:named btwn_cycl_1)) |
| 42 |
|
| 43 |
(assert (! (Btwn$0 next$0 null$0 (read$1 next$0 null$0) (read$1 next$0 null$0)) |
| 44 |
:named btwn_step_1)) |
| 45 |
|
| 46 |
(assert (! (forall ((l1 Loc) (l2 Loc)) |
| 47 |
(or (not Axiom_1$0) |
| 48 |
(or (<= (read$0 data$0 l1) (read$0 data$0 l2)) |
| 49 |
(not (Btwn$0 next$0 l1 l2 null$0)) (not (set.member l1 sk_?X_4$0)) |
| 50 |
(not (set.member l2 sk_?X_4$0))))) |
| 51 |
:named sortedness_3)) |
| 52 |
|
| 53 |
(assert (! (= (read$1 next$0 null$0) null$0) :named read_null_1)) |
| 54 |
|
| 55 |
(assert (! (not (set.member tmp_2$0 Alloc$0)) :named new_31_11)) |
| 56 |
|
| 57 |
(assert (! (not (set.member null$0 Alloc$0)) :named initial_footprint_of_copy_23_11_2)) |
| 58 |
|
| 59 |
(assert (! (not (= lst$0 null$0)) :named if_else_26_6)) |
| 60 |
|
| 61 |
(assert (! (= FP_Caller$0 (set.union FP$0 FP_Caller$0)) |
| 62 |
:named precondition_of_copy_23_11_4)) |
| 63 |
|
| 64 |
(assert (! (= sk_?X_4$0 FP$0) :named precondition_of_copy_23_11_5)) |
| 65 |
|
| 66 |
(assert (! (= res_1$0 tmp_2$0) :named assign_31_4)) |
| 67 |
|
| 68 |
(assert (! (= cp_2$0 res_1$0) :named assign_32_4)) |
| 69 |
|
| 70 |
(assert (! (= FP_1$0 (set.union FP$0 (set.singleton tmp_2$0))) :named assign_31_11)) |
| 71 |
|
| 72 |
(assert (! (or (and (Btwn$0 next$0 lst$0 null$0 null$0) Axiom_1$0) |
| 73 |
(not (slseg_struct$0 sk_?X_4$0 data$0 next$0 lst$0 null$0))) |
| 74 |
:named unnamed_3)) |
| 75 |
|
| 76 |
(assert (! (forall ((l1 Loc)) |
| 77 |
(or |
| 78 |
(and (Btwn$0 next$0 lst$0 l1 null$0) |
| 79 |
(set.member l1 (slseg_domain$0 data$0 next$0 lst$0 null$0)) |
| 80 |
(not (= l1 null$0))) |
| 81 |
(and (or (= l1 null$0) (not (Btwn$0 next$0 lst$0 l1 null$0))) |
| 82 |
(not (set.member l1 (slseg_domain$0 data$0 next$0 lst$0 null$0)))))) |
| 83 |
:named slseg_footprint_2)) |
| 84 |
|
| 85 |
(assert (! (not (set.member curr_2$0 FP_1$0)) :named check_heap_access_33_4)) |
| 86 |
|
| 87 |
(assert (! (not (= tmp_2$0 null$0)) :named new_31_11_1)) |
| 88 |
|
| 89 |
(assert (! (slseg_struct$0 sk_?X_4$0 data$0 next$0 lst$0 null$0) |
| 90 |
:named precondition_of_copy_23_11_6)) |
| 91 |
|
| 92 |
(assert (! (= sk_?X_4$0 (slseg_domain$0 data$0 next$0 lst$0 null$0)) |
| 93 |
:named precondition_of_copy_23_11_7)) |
| 94 |
|
| 95 |
(assert (! (= Alloc$0 (set.union FP_Caller$0 Alloc$0)) |
| 96 |
:named initial_footprint_of_copy_23_11_3)) |
| 97 |
|
| 98 |
(assert (! (= curr_2$0 lst$0) :named assign_30_4)) |
| 99 |
|
| 100 |
(assert (! (= FP_Caller_1$0 (set.minus FP_Caller$0 FP$0)) :named assign_26_2_1)) |
| 101 |
|
| 102 |
(assert (! (= Alloc_1$0 (set.union Alloc$0 (set.singleton tmp_2$0))) :named assign_31_11_1)) |
| 103 |
|
| 104 |
(assert (! (forall ((?x Loc)) (Btwn$0 next$0 ?x ?x ?x)) :named btwn_refl_1)) |
| 105 |
|
| 106 |
(assert (! (forall ((?x Loc) (?y Loc)) (or (not (Btwn$0 next$0 ?x ?y ?x)) (= ?x ?y))) |
| 107 |
:named btwn_sndw_1)) |
| 108 |
|
| 109 |
(assert (! (forall ((?x Loc) (?y Loc) (?z Loc)) |
| 110 |
(or (not (Btwn$0 next$0 ?x ?y ?y)) (not (Btwn$0 next$0 ?x ?z ?z)) |
| 111 |
(Btwn$0 next$0 ?x ?y ?z) (Btwn$0 next$0 ?x ?z ?y))) |
| 112 |
:named btwn_ord1_1)) |
| 113 |
|
| 114 |
(assert (! (forall ((?x Loc) (?y Loc) (?z Loc)) |
| 115 |
(or (not (Btwn$0 next$0 ?x ?y ?z)) |
| 116 |
(and (Btwn$0 next$0 ?x ?y ?y) (Btwn$0 next$0 ?y ?z ?z)))) |
| 117 |
:named btwn_ord2_1)) |
| 118 |
|
| 119 |
(assert (! (forall ((?x Loc) (?y Loc) (?z Loc)) |
| 120 |
(or (not (Btwn$0 next$0 ?x ?y ?y)) (not (Btwn$0 next$0 ?y ?z ?z)) |
| 121 |
(Btwn$0 next$0 ?x ?z ?z))) |
| 122 |
:named btwn_trn1_1)) |
| 123 |
|
| 124 |
(assert (! (forall ((?u Loc) (?x Loc) (?y Loc) (?z Loc)) |
| 125 |
(or (not (Btwn$0 next$0 ?x ?y ?z)) (not (Btwn$0 next$0 ?y ?u ?z)) |
| 126 |
(and (Btwn$0 next$0 ?x ?y ?u) (Btwn$0 next$0 ?x ?u ?z)))) |
| 127 |
:named btwn_trn2_1)) |
| 128 |
|
| 129 |
(assert (! (forall ((?u Loc) (?x Loc) (?y Loc) (?z Loc)) |
| 130 |
(or (not (Btwn$0 next$0 ?x ?y ?z)) (not (Btwn$0 next$0 ?x ?u ?y)) |
| 131 |
(and (Btwn$0 next$0 ?x ?u ?z) (Btwn$0 next$0 ?u ?y ?z)))) |
| 132 |
:named btwn_trn3_1)) |
| 133 |
|
| 134 |
(check-sat) |
| 135 |
(exit) |