| 1 |
; DISABLE-TESTER: lfsc |
| 2 |
|
| 3 |
; COMMAND-LINE: --inst-max-level=0 --simplification=none |
| 4 |
; EXPECT: unsat |
| 5 |
(set-logic UF) |
| 6 |
(set-info :status unsat) |
| 7 |
(declare-sort Node 0) |
| 8 |
(declare-sort GrassPat 0) |
| 9 |
(declare-sort GrassArray 1) |
| 10 |
(declare-sort ArrayCell 1) |
| 11 |
(declare-sort Loc 1) |
| 12 |
(declare-sort Set 1) |
| 13 |
(declare-sort Map 2) |
| 14 |
(declare-sort GrassByte 0) |
| 15 |
(declare-fun grass_null$0 () (Loc Node)) |
| 16 |
(declare-fun grass_read$0 ((Map (Loc Node) (Loc Node)) (Loc Node)) |
| 17 |
(Loc Node)) |
| 18 |
(declare-fun grass_set.empty$0 () (Set (Loc Node))) |
| 19 |
(declare-fun grass_singleton$0 ((Loc Node)) (Set (Loc Node))) |
| 20 |
(declare-fun grass_union$0 ((Set (Loc Node)) (Set (Loc Node))) |
| 21 |
(Set (Loc Node))) |
| 22 |
(declare-fun grass_intersection$0 ((Set (Loc Node)) (Set (Loc Node))) |
| 23 |
(Set (Loc Node))) |
| 24 |
(declare-fun grass_setminus$0 ((Set (Loc Node)) (Set (Loc Node))) |
| 25 |
(Set (Loc Node))) |
| 26 |
(declare-fun grass_Btwn$0 ((Map (Loc Node) (Loc Node)) (Loc Node) (Loc Node) |
| 27 |
(Loc Node)) Bool) |
| 28 |
(declare-fun grass_member$0 ((Loc Node) (Set (Loc Node))) Bool) |
| 29 |
(declare-fun grass_known$0 ((Map (Loc Node) (Loc Node))) GrassPat) |
| 30 |
(declare-fun grass_known$1 (Bool) GrassPat) |
| 31 |
(declare-fun Alloc_Node$0 () (Set (Loc Node))) |
| 32 |
(declare-fun FP_Caller_Node$0 () (Set (Loc Node))) |
| 33 |
(declare-fun FP_Caller_Node_1$0 () (Set (Loc Node))) |
| 34 |
(declare-fun FP_Caller_final_Node_2$0 () (Set (Loc Node))) |
| 35 |
(declare-fun FP_Node$0 () (Set (Loc Node))) |
| 36 |
(declare-fun Label$0 () Bool) |
| 37 |
(declare-fun Label_1$0 () Bool) |
| 38 |
(declare-fun Label_2$0 () Bool) |
| 39 |
(declare-fun Label_3$0 () Bool) |
| 40 |
(declare-fun elt$0 () (Loc Node)) |
| 41 |
(declare-fun lseg$0 ((Map (Loc Node) (Loc Node)) (Loc Node) (Loc Node) |
| 42 |
(Set (Loc Node))) Bool) |
| 43 |
(declare-fun lst$0 () (Loc Node)) |
| 44 |
(declare-fun next$0 () (Map (Loc Node) (Loc Node))) |
| 45 |
(declare-fun res_2$0 () (Loc Node)) |
| 46 |
(declare-fun set_compr$0 ((Map (Loc Node) (Loc Node)) (Loc Node) (Loc Node)) |
| 47 |
(Set (Loc Node))) |
| 48 |
(declare-fun sk_?X$0 () (Set (Loc Node))) |
| 49 |
(declare-fun sk_?X_1$0 () (Set (Loc Node))) |
| 50 |
(declare-fun sk_?X_2$0 () (Set (Loc Node))) |
| 51 |
(declare-fun sk_?X_3$0 () (Set (Loc Node))) |
| 52 |
(declare-fun sk_?X_4$0 () (Set (Loc Node))) |
| 53 |
(declare-fun sk_?e$0 () (Loc Node)) |
| 54 |
|
| 55 |
(assert (not (grass_member$0 grass_null$0 Alloc_Node$0))) |
| 56 |
(assert |
| 57 |
(and |
| 58 |
(or |
| 59 |
(or |
| 60 |
(and (and (grass_member$0 sk_?e$0 sk_?X_4$0) Label_1$0) |
| 61 |
(and |
| 62 |
(not |
| 63 |
(grass_member$0 sk_?e$0 |
| 64 |
(set_compr$0 next$0 res_2$0 grass_null$0))) |
| 65 |
Label_1$0)) |
| 66 |
(and |
| 67 |
(and |
| 68 |
(grass_member$0 sk_?e$0 |
| 69 |
(set_compr$0 next$0 res_2$0 grass_null$0)) |
| 70 |
Label_1$0) |
| 71 |
(and (not (grass_member$0 sk_?e$0 sk_?X_4$0)) Label_1$0))) |
| 72 |
(and |
| 73 |
(not (grass_Btwn$0 next$0 res_2$0 grass_null$0 grass_null$0)) |
| 74 |
Label$0)) |
| 75 |
Label_2$0)) |
| 76 |
(assert (forall ((x (Loc Node))) (not (grass_member$0 x grass_set.empty$0)))) |
| 77 |
(assert |
| 78 |
(forall ((y (Loc Node)) (x (Loc Node))) |
| 79 |
(or (and (= x y) (grass_member$0 x (grass_singleton$0 y))) |
| 80 |
(and (not (= x y)) |
| 81 |
(not (grass_member$0 x (grass_singleton$0 y))))))) |
| 82 |
(assert |
| 83 |
(forall ((x (Loc Node))) |
| 84 |
(or |
| 85 |
(and (grass_member$0 x FP_Caller_Node$0) |
| 86 |
(grass_member$0 x |
| 87 |
(grass_setminus$0 FP_Caller_Node$0 FP_Node$0)) |
| 88 |
(not (grass_member$0 x FP_Node$0))) |
| 89 |
(and |
| 90 |
(or (grass_member$0 x FP_Node$0) |
| 91 |
(not (grass_member$0 x FP_Caller_Node$0))) |
| 92 |
(not |
| 93 |
(grass_member$0 x |
| 94 |
(grass_setminus$0 FP_Caller_Node$0 FP_Node$0))))))) |
| 95 |
(assert |
| 96 |
(forall ((x (Loc Node))) |
| 97 |
(or |
| 98 |
(and (grass_member$0 x Alloc_Node$0) |
| 99 |
(grass_member$0 x |
| 100 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0)) |
| 101 |
(not (grass_member$0 x Alloc_Node$0))) |
| 102 |
(and |
| 103 |
(or (grass_member$0 x Alloc_Node$0) |
| 104 |
(not (grass_member$0 x Alloc_Node$0))) |
| 105 |
(not |
| 106 |
(grass_member$0 x |
| 107 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0))))))) |
| 108 |
(assert |
| 109 |
(forall ((x (Loc Node))) |
| 110 |
(or |
| 111 |
(and (grass_member$0 x Alloc_Node$0) |
| 112 |
(grass_member$0 x FP_Node$0) |
| 113 |
(grass_member$0 x |
| 114 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0))) |
| 115 |
(and |
| 116 |
(or (not (grass_member$0 x Alloc_Node$0)) |
| 117 |
(not (grass_member$0 x FP_Node$0))) |
| 118 |
(not |
| 119 |
(grass_member$0 x |
| 120 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0))))))) |
| 121 |
(assert |
| 122 |
(forall ((x (Loc Node))) |
| 123 |
(or |
| 124 |
(and (grass_member$0 x sk_?X$0) |
| 125 |
(grass_member$0 x sk_?X_1$0) |
| 126 |
(grass_member$0 x |
| 127 |
(grass_intersection$0 sk_?X$0 sk_?X_1$0))) |
| 128 |
(and |
| 129 |
(or (not (grass_member$0 x sk_?X$0)) |
| 130 |
(not (grass_member$0 x sk_?X_1$0))) |
| 131 |
(not |
| 132 |
(grass_member$0 x |
| 133 |
(grass_intersection$0 sk_?X$0 sk_?X_1$0))))))) |
| 134 |
(assert |
| 135 |
(forall ((x (Loc Node))) |
| 136 |
(or |
| 137 |
(and |
| 138 |
(grass_member$0 x |
| 139 |
(grass_union$0 |
| 140 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0) |
| 141 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0))) |
| 142 |
(or |
| 143 |
(grass_member$0 x |
| 144 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0)) |
| 145 |
(grass_member$0 x |
| 146 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0)))) |
| 147 |
(and |
| 148 |
(not |
| 149 |
(grass_member$0 x |
| 150 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0))) |
| 151 |
(not |
| 152 |
(grass_member$0 x |
| 153 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0))) |
| 154 |
(not |
| 155 |
(grass_member$0 x |
| 156 |
(grass_union$0 |
| 157 |
(grass_intersection$0 Alloc_Node$0 FP_Node$0) |
| 158 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0)))))))) |
| 159 |
(assert |
| 160 |
(forall ((x (Loc Node))) |
| 161 |
(or |
| 162 |
(and (grass_member$0 x (grass_union$0 sk_?X$0 sk_?X_1$0)) |
| 163 |
(or (grass_member$0 x sk_?X$0) |
| 164 |
(grass_member$0 x sk_?X_1$0))) |
| 165 |
(and (not (grass_member$0 x sk_?X$0)) |
| 166 |
(not (grass_member$0 x sk_?X_1$0)) |
| 167 |
(not |
| 168 |
(grass_member$0 x (grass_union$0 sk_?X$0 sk_?X_1$0))))))) |
| 169 |
(assert |
| 170 |
(forall ((x (Loc Node))) |
| 171 |
(or |
| 172 |
(and |
| 173 |
(grass_member$0 x |
| 174 |
(grass_union$0 FP_Caller_Node_1$0 FP_Node$0)) |
| 175 |
(or (grass_member$0 x FP_Caller_Node_1$0) |
| 176 |
(grass_member$0 x FP_Node$0))) |
| 177 |
(and (not (grass_member$0 x FP_Caller_Node_1$0)) |
| 178 |
(not (grass_member$0 x FP_Node$0)) |
| 179 |
(not |
| 180 |
(grass_member$0 x |
| 181 |
(grass_union$0 FP_Caller_Node_1$0 FP_Node$0))))))) |
| 182 |
(assert |
| 183 |
(forall ((x (Loc Node))) |
| 184 |
(or |
| 185 |
(and |
| 186 |
(grass_member$0 x |
| 187 |
(grass_union$0 FP_Node$0 FP_Caller_Node$0)) |
| 188 |
(or (grass_member$0 x FP_Node$0) |
| 189 |
(grass_member$0 x FP_Caller_Node$0))) |
| 190 |
(and (not (grass_member$0 x FP_Node$0)) |
| 191 |
(not (grass_member$0 x FP_Caller_Node$0)) |
| 192 |
(not |
| 193 |
(grass_member$0 x |
| 194 |
(grass_union$0 FP_Node$0 FP_Caller_Node$0))))))) |
| 195 |
(assert |
| 196 |
(forall ((x (Loc Node))) |
| 197 |
(or |
| 198 |
(and |
| 199 |
(grass_member$0 x |
| 200 |
(grass_union$0 FP_Caller_Node$0 Alloc_Node$0)) |
| 201 |
(or (grass_member$0 x FP_Caller_Node$0) |
| 202 |
(grass_member$0 x Alloc_Node$0))) |
| 203 |
(and (not (grass_member$0 x FP_Caller_Node$0)) |
| 204 |
(not (grass_member$0 x Alloc_Node$0)) |
| 205 |
(not |
| 206 |
(grass_member$0 x |
| 207 |
(grass_union$0 FP_Caller_Node$0 Alloc_Node$0))))))) |
| 208 |
(assert |
| 209 |
(or (grass_Btwn$0 next$0 lst$0 lst$0 lst$0) |
| 210 |
(not (lseg$0 next$0 lst$0 lst$0 sk_?X$0)))) |
| 211 |
(assert |
| 212 |
(forall |
| 213 |
((next (Map (Loc Node) (Loc Node))) (x (Loc Node)) |
| 214 |
(y (Loc Node)) (z (Loc Node))) |
| 215 |
(or |
| 216 |
(and (grass_Btwn$0 next x z y) |
| 217 |
(grass_member$0 z (set_compr$0 next x y)) (not (= z y))) |
| 218 |
(and (or (= z y) (not (grass_Btwn$0 next x z y))) |
| 219 |
(not (grass_member$0 z (set_compr$0 next x y))))))) |
| 220 |
(assert |
| 221 |
(forall |
| 222 |
((?u (Loc Node)) (?x (Loc Node)) (?y (Loc Node)) |
| 223 |
(?z (Loc Node))) |
| 224 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?z)) |
| 225 |
(not (grass_Btwn$0 next$0 ?x ?u ?y)) |
| 226 |
(and (grass_Btwn$0 next$0 ?x ?u ?z) |
| 227 |
(grass_Btwn$0 next$0 ?u ?y ?z))))) |
| 228 |
(assert |
| 229 |
(forall |
| 230 |
((?u (Loc Node)) (?x (Loc Node)) (?y (Loc Node)) |
| 231 |
(?z (Loc Node))) |
| 232 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?z)) |
| 233 |
(not (grass_Btwn$0 next$0 ?y ?u ?z)) |
| 234 |
(and (grass_Btwn$0 next$0 ?x ?y ?u) |
| 235 |
(grass_Btwn$0 next$0 ?x ?u ?z))))) |
| 236 |
(assert |
| 237 |
(forall ((?x (Loc Node)) (?y (Loc Node)) (?z (Loc Node))) |
| 238 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?y)) |
| 239 |
(not (grass_Btwn$0 next$0 ?y ?z ?z)) |
| 240 |
(grass_Btwn$0 next$0 ?x ?z ?z)))) |
| 241 |
(assert |
| 242 |
(forall ((?x (Loc Node)) (?y (Loc Node)) (?z (Loc Node))) |
| 243 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?z)) |
| 244 |
(and (grass_Btwn$0 next$0 ?x ?y ?y) |
| 245 |
(grass_Btwn$0 next$0 ?y ?z ?z))))) |
| 246 |
(assert |
| 247 |
(forall ((?x (Loc Node)) (?y (Loc Node)) (?z (Loc Node))) |
| 248 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?y)) |
| 249 |
(not (grass_Btwn$0 next$0 ?x ?z ?z)) |
| 250 |
(grass_Btwn$0 next$0 ?x ?y ?z) |
| 251 |
(grass_Btwn$0 next$0 ?x ?z ?y)))) |
| 252 |
(assert |
| 253 |
(forall ((?x (Loc Node)) (?y (Loc Node))) |
| 254 |
(or (not (grass_Btwn$0 next$0 ?x ?y ?x)) (= ?x ?y)))) |
| 255 |
(assert |
| 256 |
(forall ((?y (Loc Node))) |
| 257 |
(or (not (grass_Btwn$0 next$0 res_2$0 ?y ?y)) (= res_2$0 ?y) |
| 258 |
(grass_Btwn$0 next$0 res_2$0 (grass_read$0 next$0 res_2$0) |
| 259 |
?y)))) |
| 260 |
(assert |
| 261 |
(forall ((?y (Loc Node))) |
| 262 |
(or (not (grass_Btwn$0 next$0 lst$0 ?y ?y)) (= lst$0 ?y) |
| 263 |
(grass_Btwn$0 next$0 lst$0 (grass_read$0 next$0 lst$0) ?y)))) |
| 264 |
(assert |
| 265 |
(forall ((?y (Loc Node))) |
| 266 |
(or (not (= (grass_read$0 next$0 res_2$0) res_2$0)) |
| 267 |
(not (grass_Btwn$0 next$0 res_2$0 ?y ?y)) (= res_2$0 ?y)))) |
| 268 |
(assert |
| 269 |
(forall ((?y (Loc Node))) |
| 270 |
(or (not (= (grass_read$0 next$0 lst$0) lst$0)) |
| 271 |
(not (grass_Btwn$0 next$0 lst$0 ?y ?y)) (= lst$0 ?y)))) |
| 272 |
(assert |
| 273 |
(grass_Btwn$0 next$0 res_2$0 (grass_read$0 next$0 res_2$0) |
| 274 |
(grass_read$0 next$0 res_2$0))) |
| 275 |
(assert |
| 276 |
(grass_Btwn$0 next$0 lst$0 (grass_read$0 next$0 lst$0) |
| 277 |
(grass_read$0 next$0 lst$0))) |
| 278 |
(assert (forall ((?x (Loc Node))) (grass_Btwn$0 next$0 ?x ?x ?x))) |
| 279 |
(assert |
| 280 |
(or (= sk_?X$0 (set_compr$0 next$0 lst$0 lst$0)) |
| 281 |
(not (lseg$0 next$0 lst$0 lst$0 sk_?X$0)))) |
| 282 |
(assert (= (grass_read$0 next$0 grass_null$0) grass_null$0)) |
| 283 |
(assert (= FP_Caller_Node_1$0 (grass_setminus$0 FP_Caller_Node$0 FP_Node$0))) |
| 284 |
(assert (and (= lst$0 grass_null$0) Label_3$0)) |
| 285 |
(assert (= Alloc_Node$0 (grass_union$0 FP_Caller_Node$0 Alloc_Node$0))) |
| 286 |
(assert |
| 287 |
(= sk_?X_4$0 |
| 288 |
(grass_union$0 (grass_intersection$0 Alloc_Node$0 FP_Node$0) |
| 289 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0)))) |
| 290 |
(assert (= sk_?X_3$0 (grass_union$0 sk_?X$0 sk_?X_2$0))) |
| 291 |
(assert (= sk_?X_2$0 sk_?X_1$0)) |
| 292 |
(assert (= sk_?X_1$0 (grass_singleton$0 elt$0))) |
| 293 |
(assert (= (grass_read$0 next$0 elt$0) grass_null$0)) |
| 294 |
(assert (= FP_Node$0 sk_?X_3$0)) |
| 295 |
(assert (= FP_Caller_Node$0 (grass_union$0 FP_Node$0 FP_Caller_Node$0))) |
| 296 |
(assert (= grass_set.empty$0 (grass_intersection$0 sk_?X$0 sk_?X_2$0))) |
| 297 |
(assert (= grass_set.empty$0 grass_set.empty$0)) |
| 298 |
(assert (lseg$0 next$0 lst$0 grass_null$0 sk_?X$0)) |
| 299 |
(assert |
| 300 |
(= FP_Caller_final_Node_2$0 |
| 301 |
(grass_union$0 FP_Caller_Node_1$0 FP_Node$0))) |
| 302 |
(assert (= res_2$0 elt$0)) |
| 303 |
(assert (= (grass_union$0 FP_Caller_Node$0 Alloc_Node$0) Alloc_Node$0)) |
| 304 |
(assert (= (grass_read$0 next$0 grass_null$0) grass_null$0)) |
| 305 |
(assert (= (grass_read$0 next$0 grass_null$0) lst$0)) |
| 306 |
(assert (= (grass_read$0 next$0 grass_null$0) (grass_read$0 next$0 elt$0))) |
| 307 |
(assert |
| 308 |
(= (grass_known$1 (lseg$0 next$0 lst$0 grass_null$0 sk_?X$0)) |
| 309 |
(grass_known$1 (lseg$0 next$0 lst$0 lst$0 sk_?X$0)))) |
| 310 |
(assert (= (grass_intersection$0 sk_?X$0 sk_?X_2$0) grass_set.empty$0)) |
| 311 |
(assert |
| 312 |
(= |
| 313 |
(grass_union$0 (grass_intersection$0 Alloc_Node$0 FP_Node$0) |
| 314 |
(grass_setminus$0 Alloc_Node$0 Alloc_Node$0)) |
| 315 |
sk_?X_4$0)) |
| 316 |
(assert (= res_2$0 elt$0)) |
| 317 |
(assert (= (grass_union$0 FP_Node$0 FP_Caller_Node$0) FP_Caller_Node$0)) |
| 318 |
(assert (= sk_?X_1$0 (grass_singleton$0 elt$0))) |
| 319 |
(assert (= sk_?X_1$0 sk_?X_2$0)) |
| 320 |
(assert |
| 321 |
(= FP_Caller_final_Node_2$0 |
| 322 |
(grass_union$0 FP_Caller_Node_1$0 FP_Node$0))) |
| 323 |
(assert (= FP_Node$0 sk_?X_3$0)) |
| 324 |
(assert (= FP_Node$0 (grass_union$0 sk_?X$0 sk_?X_2$0))) |
| 325 |
(assert (= FP_Caller_Node_1$0 (grass_setminus$0 FP_Caller_Node$0 FP_Node$0))) |
| 326 |
(assert (= sk_?X$0 (set_compr$0 next$0 lst$0 lst$0))) |
| 327 |
(assert (= sk_?X$0 (set_compr$0 next$0 lst$0 grass_null$0))) |
| 328 |
(check-sat) |