-
Notifications
You must be signed in to change notification settings - Fork 14
/
test_compare.ml
871 lines (813 loc) · 34.9 KB
/
test_compare.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
(***************************************************************************)
(* *)
(* Copyright (C) 2018/2019 The Charles Stark Draper Laboratory, Inc. *)
(* *)
(* This file is provided under the license found in the LICENSE file in *)
(* the top-level directory of this project. *)
(* *)
(* This work is funded in part by ONR/NAWC Contract N6833518C0107. Its *)
(* content does not necessarily reflect the position or policy of the US *)
(* Government and no official endorsement should be inferred. *)
(* *)
(***************************************************************************)
open !Core_kernel
open Bap.Std
open OUnit2
open Bap_wp
open Bil_to_bir
open Test_utils
module Pre = Precondition
module Comp = Compare
module Constr = Constraint
module Env = Environment
module Bool = Z3.Boolean
module BV = Z3.BitVector
(* To run these tests: `make test.unit` in bap_wp directory *)
let assert_z3_compare (test_ctx : test_ctxt) (body1 : string) (body2 : string)
(pre : Constr.t) (expected : Z3.Solver.status) ~orig:(env1 : Env.t)
~modif:(env2 : Env.t) : unit =
let z3_ctx = Env.get_context env1 in
let solver = Z3.Solver.mk_simple_solver z3_ctx in
let result = Pre.check solver z3_ctx pre in
assert_equal ~ctxt:test_ctx
~printer:Z3.Solver.string_of_status
~pp_diff:(fun ff (exp, real) ->
Format.fprintf ff "\n\nComparing:\n%s\nand\n\n%s\nCompare_prop:\n%a\n\n%!"
body1 body2 (Constr.pp ()) pre;
print_z3_model solver exp real pre ~orig:env1 ~modif:env2)
expected result
let test_block_pair_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let z = Var.create "z" reg32_t in
let blk1 = Blk.create () |> mk_def z (Bil.binop Bil.plus (Bil.var x) (Bil.var y)) in
let blk2 = Blk.create ()
|> mk_def x (Bil.binop Bil.plus (Bil.var x) one)
|> mk_def y (Bil.binop Bil.minus (Bil.var y) one)
|> mk_def z (Bil.binop Bil.plus (Bil.var x) (Bil.var y))
in
let pre_regs = Var.Set.union (Var.Set.singleton x) (Var.Set.singleton y) in
let post_regs = Var.Set.singleton z in
let compare_prop, env1, env2 = Comp.compare_blocks
~pre_regs ~post_regs
~original:(blk1,env1) ~modified:(blk2,env2)
~smtlib_post:"" ~smtlib_hyp:"" in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Blk.to_string blk1) (Blk.to_string blk2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_block_pair_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let z = Var.create "z" reg32_t in
let blk1 = Blk.create () |> mk_def z (Bil.var x) in
let blk2 = Blk.create ()
|> mk_def y (Bil.var x)
|> mk_def z (Bil.var y)
in
let pre_regs = Var.Set.singleton x in
let post_regs = Var.Set.singleton z in
let compare_prop, env1, env2 = Comp.compare_blocks
~pre_regs ~post_regs
~original:(blk1,env1) ~modified:(blk2,env2)
~smtlib_post:"" ~smtlib_hyp:"" in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Blk.to_string blk1) (Blk.to_string blk2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let def_y_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let z = Var.create "z" reg32_t in
let lt = Bil.( (var x) < (i32 0) ) in
let blk1 = blk1 |> mk_cond lt blk2 blk3 in
let blk2 = blk2
|> mk_def ~tid:def_y_tid y one
|> mk_jmp blk4
in
let blk3 = blk3
|> mk_def ~tid:def_y_tid y two
|> mk_jmp blk4
in
let blk4 = blk4
|> mk_def y (Bil.var x)
|> mk_def z (Bil.var y)
in
let sub1 = mk_sub [blk1; blk2; blk3; blk4] in
let blk2' = Term.remove def_t blk2 def_y_tid in
let blk3' = Term.remove def_t blk3 def_y_tid in
let sub2 = mk_sub [blk1; blk2'; blk3'; blk4] in
let pre_regs = Var.Set.union (Var.Set.singleton x) (Var.Set.singleton y) in
let post_regs = Var.Set.singleton z in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let def_y_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let z = Var.create "z" reg32_t in
let lt = Bil.( (var x) < (i32 1) ) in
let blk1 = blk1 |> mk_cond lt blk2 blk3 in
let blk2 = blk2
|> mk_def y one
|> mk_jmp blk4
in
let blk3 = blk3
|> mk_def y two
|> mk_jmp blk4
in
let blk4 = blk4
|> mk_def ~tid:def_y_tid y (Bil.var x)
|> mk_def z (Bil.var y)
in
let sub1 = mk_sub [blk1; blk2; blk3; blk4] in
let blk4' = Term.remove def_t blk4 def_y_tid in
let sub2 = mk_sub [blk1; blk2; blk3; blk4'] in
let pre_regs = Var.Set.union (Var.Set.singleton x) (Var.Set.singleton y) in
let post_regs = Var.Set.singleton z in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_sub_pair_3 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk1' = Blk.create () in
let blk2' = Blk.create () in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let z = Var.create "z" reg32_t in
let blk1 = blk1
|> mk_def x Bil.( (var y) + (i32 2) )
|> mk_jmp blk2
in
let blk2 = blk2 |> mk_def z (Bil.var x) in
let blk1' = blk1'
|> mk_def z Bil.( (var y) + (i32 1) )
|> mk_jmp blk2'
in
let blk2' = blk2' |> mk_def z Bil.( (var z) + (i32 1) ) in
let sub1 = mk_sub [blk1; blk2] in
let sub2 = mk_sub [blk1'; blk2'] in
let pre_regs = Var.Set.union (Var.Set.singleton x) (Var.Set.singleton y) in
let post_regs = Var.Set.singleton z in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_4 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let sub1 = Bil.(
[ if_ ( var x < (int @@ Word.of_int 0x40000000 ~width:32) )
[
y := var x;
y := (var y) lsl two;
y := (var y) lsr two
]
[
y := var x
]
]
) |> bil_to_sub
in
let sub2 = Bil.(
[
y := ite ~if_:( var x < (int @@ Word.of_int 0x40000000 ~width:32) )
~then_:( (var x lsl two) lsr two) ~else_:(var x)
]
) |> bil_to_sub
in
let pre_regs = Var.Set.singleton x in
let post_regs = Var.Set.singleton y in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_5 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk1' = Blk.create () in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let lt = Bil.binop Bil.lt (Bil.var x) (Bil.int @@ Word.of_int 0x40000000 ~width:32) in
let lshift = Bil.binop Bil.lshift (Bil.var y) two in
let rshift = Bil.binop Bil.rshift (Bil.var y) two in
let lshift' = Bil.binop Bil.lshift (Bil.var x) two in
let rshift' = Bil.binop Bil.rshift (lshift') two in
let ite = Bil.ite ~if_:lt ~then_:rshift' ~else_:(Bil.var x) in
let blk1 = blk1 |> mk_cond lt blk2 blk3 in
let blk2 = blk2 |> mk_def y (Bil.var x) in
let blk3 = blk3
|> mk_def y (Bil.var x)
|> mk_def y lshift
|> mk_def y rshift
in
let blk1' = blk1' |> mk_def y ite in
let sub1 = mk_sub [blk1; blk2; blk3] in
let sub2 = mk_sub [blk1'] in
let pre_regs = Var.Set.singleton x in
let post_regs = Var.Set.singleton y in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_sub_pair_6 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~exp_conds:[Pre.non_null_load_assert] in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~exp_conds:[Pre.non_null_load_vc] in
let mem = Var.create "mem" (mem32_t `r32) in
let loc = Var.create "loc" reg32_t in
let read = Bil.(load ~mem:(var mem) ~addr:(var loc) LittleEndian `r32) in
let sub1 = Bil.([if_ (read = i32 12)[][]]) |> bil_to_sub in
let sub2 = Bil.([if_ (read = i32 3) [if_ (read = i32 4) [][]] []]) |> bil_to_sub in
let post, hyps = Comp.compare_subs_empty_post in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_7 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~exp_conds:[Pre.non_null_load_assert] in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~exp_conds:[Pre.non_null_load_vc] in
let mem = Var.create "mem" (mem32_t `r32) in
let loc = Var.create "loc" reg32_t in
let read = Bil.(load ~mem:(var mem) ~addr:(var loc) LittleEndian `r32) in
let read' = Bil.(load ~mem:(var mem) ~addr:(var loc + one) LittleEndian `r32) in
let sub1 = Bil.([if_ (read = i32 3)[][]]) |> bil_to_sub in
let sub2 = Bil.([if_ (read = i32 3) [if_ (read' = i32 4) [][]] []]) |> bil_to_sub in
let post, hyps = Comp.compare_subs_empty_post in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_sub_pair_fun_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let call_tid = Tid.create () in
Tid.set_name call_tid "call_tid";
let sub1_tid = Tid.create () in
let sub2_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let call_blk = Blk.create () in
let call_sub = mk_sub ~tid:call_tid ~name:"test_call" [call_blk] in
let blk1 = blk1 |> mk_call (Label.direct (Term.tid blk2)) (Label.direct (Term.tid call_sub)) in
let blk3 = blk3 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call_sub)) in
let main_sub1 = mk_sub ~tid:sub1_tid ~name:"main_sub" [blk1; blk2] in
let main_sub2 = mk_sub ~tid:sub2_tid ~name:"main_sub" [blk3; blk4] in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub1; call_sub]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub2; call_sub]) in
let post, hyps = Comp.compare_subs_fun in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1) (Sub.to_string main_sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_fun_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let call_tid = Tid.create () in
Tid.set_name call_tid "call_tid";
let sub1_tid = Tid.create () in
let sub2_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let call_blk = Blk.create () in
let call_sub = mk_sub ~tid:call_tid ~name:"test_call" [call_blk] in
let blk3 = blk3 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call_sub)) in
let main_sub1 = mk_sub ~tid:sub1_tid ~name:"main_sub" [blk1; blk2] in
let main_sub2 = mk_sub ~tid:sub2_tid ~name:"main_sub" [blk3; blk4] in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub1; call_sub]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub2; call_sub]) in
let post, hyps = Comp.compare_subs_fun in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1) (Sub.to_string main_sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_sub_pair_fun_3 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let call1_tid = Tid.create () in
Tid.set_name call1_tid "call1_tid";
let call2_tid = Tid.create () in
Tid.set_name call2_tid "call2_tid";
let sub1_tid = Tid.create () in
let sub2_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let blk1' = Blk.create () in
let call_blk = Blk.create () in
let call1_sub = mk_sub ~tid:call1_tid ~name:"test_call1" [call_blk] in
let call2_sub = mk_sub ~tid:call2_tid ~name:"test_call2" [call_blk] in
let x = Var.create "x" reg32_t in
let cond = Bil.binop Bil.le (Bil.var x) zero in
let cond' = Bil.binop Bil.le (Bil.var x) one in
let blk1 = blk1 |> mk_cond cond blk2 blk3 in
let blk1' = blk1' |> mk_cond cond' blk2 blk3 in
let blk2 = blk2 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call1_sub)) in
let blk3 = blk3 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call2_sub)) in
let main_sub1 = mk_sub ~tid:sub1_tid ~name:"main_sub" [blk1; blk2; blk3; blk4] in
let main_sub2 = mk_sub ~tid:sub2_tid ~name:"main_sub" [blk1'; blk2; blk3; blk4] in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen
~subs:(Seq.of_list [main_sub1; call1_sub; call2_sub]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen
~subs:(Seq.of_list [main_sub2; call1_sub; call2_sub]) in
let post, hyps = Comp.compare_subs_fun in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1) (Sub.to_string main_sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_sub_pair_fun_4 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let call1_tid = Tid.create () in
Tid.set_name call1_tid "call1_tid";
let call2_tid = Tid.create () in
Tid.set_name call2_tid "call2_tid";
let sub1_tid = Tid.create () in
let sub2_tid = Tid.create () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let blk3 = Blk.create () in
let blk4 = Blk.create () in
let blk1' = Blk.create () in
let blk2' = Blk.create () in
let call_blk = Blk.create () in
let call1_sub = mk_sub ~tid:call1_tid ~name:"test_call1" [call_blk] in
let call2_sub = mk_sub ~tid:call2_tid ~name:"test_call2" [call_blk] in
let x = Var.create "x" reg32_t in
let cond = Bil.binop Bil.le (Bil.var x) zero in
let blk1 = blk1 |> mk_cond cond blk2 blk3 in
let blk2 = blk2 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call1_sub)) in
let blk3 = blk3 |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call2_sub)) in
let blk1' = blk1' |> mk_call (Label.direct (Term.tid blk2')) (Label.direct (Term.tid call1_sub)) in
let blk2' = blk2' |> mk_call (Label.direct (Term.tid blk4)) (Label.direct (Term.tid call2_sub)) in
let main_sub1 = mk_sub ~tid:sub1_tid ~name:"main_sub" [blk1; blk2; blk3; blk4] in
let main_sub2 = mk_sub ~tid:sub2_tid ~name:"main_sub" [blk1'; blk2'; blk4] in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen
~subs:(Seq.of_list [main_sub1; call1_sub; call2_sub]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen
~subs:(Seq.of_list [main_sub2; call1_sub; call2_sub]) in
let post, hyps = Comp.compare_subs_fun in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1) (Sub.to_string main_sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_fun_outputs_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let ret_var = Var.create "RAX" reg64_t in
let rdi = Var.create "RDI" reg64_t in
let rsi = Var.create "RSI" reg64_t in
let sub1 = Bil.([ ret_var := var rdi + var rsi ]) |> bil_to_sub in
let sub2 = Bil.([ ret_var := var rdi + var rsi ]) |> bil_to_sub in
let sub1 = Sub.with_name sub1 "test_call" in
let sub2 = Sub.with_name sub2 "test_call" in
let main_sub1 =
[call sub1 reg64_t]
|> bil_to_sub in
let main_sub2 =
[call sub2 reg64_t]
|> bil_to_sub in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub1; sub1])
~specs:[Pre.spec_chaos_caller_saved] in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub2; sub2])
~specs:[Pre.spec_chaos_caller_saved] in
let pre_regs = Var.Set.of_list (ret_var :: x86_64_input_regs) in
let post_regs = Var.Set.singleton ret_var in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1)
(Sub.to_string main_sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_fun_outputs_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let ret_var = Var.create "RAX" reg64_t in
let rdi = Var.create "RDI" reg64_t in
let rsi = Var.create "RSI" reg64_t in
let sub1 = Bil.([ ret_var := var rdi + var rsi ]) |> bil_to_sub in
let sub2 = Bil.([ ret_var := var rdi + var rsi ]) |> bil_to_sub in
let sub1 = Sub.with_name sub1 "test_call" in
let sub2 = Sub.with_name sub2 "test_call" in
let main_sub1 =
Bil.([ rdi := i64 1 ;
rsi := i64 2 ;
Bil_to_bir.call sub1 reg64_t]) |> bil_to_sub in
let main_sub2 =
Bil.([ rdi := i64 2 ;
rsi := i64 3 ;
Bil_to_bir.call sub2 reg64_t]) |> bil_to_sub in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub1; sub1])
~specs:[Pre.spec_chaos_caller_saved] in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [main_sub2; sub2])
~specs:[Pre.spec_chaos_caller_saved] in
let pre_regs = Var.Set.of_list (ret_var :: x86_64_input_regs) in
let post_regs = Var.Set.singleton ret_var in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1)
(Sub.to_string main_sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_fun_outputs_3 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let rdi = Var.create "RDI" reg64_t in
let rsi = Var.create "RSI" reg64_t in
let rdx = Var.create "RDX" reg64_t in
let rax = Var.create "RAX" reg64_t in
let sub1 = Bil.([ rax := var rdi + var rsi ]) |> bil_to_sub in
let sub2 = Bil.([ rax := var rdi + var rsi ]) |> bil_to_sub in
let sub1 = Sub.with_name sub1 "test_call" in
let sub2 = Sub.with_name sub2 "test_call" in
let main_sub1 =
Bil.([rdi := i64 1 ;
rsi := i64 2 ;
rdx := i64 3 ;
Bil_to_bir.call sub1 reg64_t])
|> bil_to_sub in
let main_sub2 =
Bil.([rdi := i64 1 ;
rsi := i64 2 ;
rdx := i64 4 ;
Bil_to_bir.call sub2 reg64_t])
|> bil_to_sub in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~specs:[Pre.spec_chaos_caller_saved]
~subs:(Seq.of_list [main_sub1; sub1]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~specs:[Pre.spec_chaos_caller_saved]
~subs:(Seq.of_list [main_sub2; sub2]) in
let pre_regs = Var.Set.of_list (rax :: x86_64_input_regs) in
let post_regs = Var.Set.singleton rax in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1)
(Sub.to_string main_sub2)
compare_prop Z3.Solver.SATISFIABLE
let test_fun_outputs_4 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let rdi = Var.create "RDI" reg64_t in
let rsi = Var.create "RSI" reg64_t in
let rdx = Var.create "RDX" reg64_t in
let rax = Var.create "RAX" reg64_t in
let sub1 = Bil.([ rax := var rdi + var rsi ]) |> bil_to_sub in
let sub2 = Bil.([ rax := var rdi + var rsi ]) |> bil_to_sub in
let sub1 = Sub.with_name sub1 "test_call" in
let sub2 = Sub.with_name sub2 "test_call" in
let main_sub1 =
Bil.([rdi := i64 1 ;
rsi := i64 2 ;
rdx := i64 3 ;
Bil_to_bir.call sub1 reg64_t])
|> bil_to_sub in
let main_sub2 =
Bil.([rdi := i64 1 ;
rsi := i64 2 ;
rdx := i64 4 ;
Bil_to_bir.call sub2 reg64_t])
|> bil_to_sub in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~specs:[Pre.spec_chaos_caller_saved]
~subs:(Seq.of_list [main_sub1; sub1]) ~use_fun_input_regs:false in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~specs:[Pre.spec_chaos_caller_saved]
~subs:(Seq.of_list [main_sub2; sub2]) ~use_fun_input_regs:false in
let pre_regs = Var.Set.of_list (rax :: x86_64_input_regs) in
let post_regs = Var.Set.singleton rax in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(main_sub1, env1) ~modified:(main_sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string main_sub1)
(Sub.to_string main_sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_sub_pair_mem_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let blk1 = Blk.create () in
let blk2 = Blk.create () in
let mem = Var.create "new_mem" (mem32_t `r32) in
let loc1 = Var.create "loc" reg32_t in
let bv1 = Word.of_int ~width:32 0xDEADBEEF in
let bv2 = Word.of_int ~width:32 0x0FA1AFE1 in
let store1 = Bil.(store ~mem:(var mem) ~addr:(var loc1) (int bv1) LittleEndian `r32) in
let store2 = Bil.(store ~mem:(var mem) ~addr:(var loc1) (int bv2) LittleEndian `r32) in
let blk1 = blk1 |> mk_def mem store1 in
let blk2 = blk2 |> mk_def mem store2 in
let sub1 = mk_sub ~name:"main_sub" [blk1] in
let sub2 = mk_sub ~name:"main_sub" [blk2] in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [sub1]) in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.of_list [sub2]) in
let pre_regs = Var.Set.of_list [mem; loc1] in
let post_regs = Var.Set.singleton mem in
let post, hyps = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post] ~hyps:[hyps]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.SATISFIABLE
(* RAX := mem[0x600160, el]:u64
vs
RAX := mem[0x600161, el]:u64 *)
let test_memory_model_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let module Target = (val target_of_arch `x86_64) in
let mem = Target.CPU.mem in
let rax = Var.create "RAX" reg64_t in
let addr1 = 0x600160 in
let addr2 = 0x600161 in
let sub1 = Bil.(
[ rax := load ~mem:(var mem) ~addr:(i64 addr1) LittleEndian `r64; ]
) |> bil_to_sub in
let sub2 = Bil.(
[ rax := load ~mem:(var mem) ~addr:(i64 addr2) LittleEndian `r64; ]
) |> bil_to_sub in
let offset = fun addr ->
let width = addr |> Z3.Expr.get_sort |> Z3.BitVector.get_size in
let offset = Z3.BitVector.mk_numeral ctx "1" width in
Z3.BitVector.mk_add ctx addr offset
in
let pre_regs = Var.Set.of_list [rax; mem] in
let post_regs = Var.Set.singleton rax in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub2) ~exp_conds:[] in
let env2 = Env.set_freshen env2 true in
let _, env2 = Pre.init_vars pre_regs env2 in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub1)
~exp_conds:[Pre.mem_read_offsets env2 offset] in
let _, env1 = Pre.init_vars pre_regs env1 in
let post1, hyps1 = Comp.compare_subs_sp in
let post2, hyps2 = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post1; post2] ~hyps:[hyps1; hyps2]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
(* RAX := mem[0x600160, el]:u64
vs
RAX := mem[0x600161, el]:u64 *)
let test_memory_model_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let module Target = (val target_of_arch `x86_64) in
let mem = Target.CPU.mem in
let rax = Var.create "RAX" reg64_t in
let addr1 = 0x600160 in
let addr2 = 0x600161 in
let sub1 = Bil.(
[ rax := load ~mem:(var mem) ~addr:(i64 addr1) LittleEndian `r64; ]
) |> bil_to_sub in
let sub2 = Bil.(
[ rax := load ~mem:(var mem) ~addr:(i64 addr2) LittleEndian `r64; ]
) |> bil_to_sub in
let offset = fun addr ->
let width = addr |> Z3.Expr.get_sort |> Z3.BitVector.get_size in
let offset = Z3.BitVector.mk_numeral ctx "22" width in
Z3.BitVector.mk_add ctx addr offset
in
let pre_regs = Var.Set.of_list [rax; mem] in
let post_regs = Var.Set.singleton rax in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub2) ~exp_conds:[] in
let env2 = Env.set_freshen env2 true in
let _, env2 = Pre.init_vars pre_regs env2 in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub1)
~exp_conds:[Pre.mem_read_offsets env2 offset] in
let _, env1 = Pre.init_vars pre_regs env1 in
let post1, hyps1 = Comp.compare_subs_sp in
let post2, hyps2 = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post1; post2] ~hyps:[hyps1; hyps2]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.SATISFIABLE
(* RAX := 0x600160
RAX := mem[RAX, el]:u64
vs
RAX := 0x600161
RAX := mem[RAX, el]:u64 *)
let test_memory_model_3 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let module Target = (val target_of_arch `x86_64) in
let mem = Target.CPU.mem in
let rax = Var.create "RAX" reg64_t in
let addr1 = 0x600160 in
let addr2 = 0x600161 in
let sub1 = Bil.(
[
rax := i64 addr1;
rax := load ~mem:(var mem) ~addr:(var rax) LittleEndian `r64;
]
) |> bil_to_sub in
let sub2 = Bil.(
[
rax := i64 addr2;
rax := load ~mem:(var mem) ~addr:(var rax) LittleEndian `r64;
]
) |> bil_to_sub in
let offset = fun addr ->
let width = addr |> Z3.Expr.get_sort |> Z3.BitVector.get_size in
let offset = Z3.BitVector.mk_numeral ctx "1" width in
Z3.BitVector.mk_add ctx addr offset
in
let pre_regs = Var.Set.of_list [rax; mem] in
let post_regs = Var.Set.singleton rax in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub2) ~exp_conds:[] in
let env2 = Env.set_freshen env2 true in
let _, env2 = Pre.init_vars pre_regs env2 in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen ~subs:(Seq.singleton sub1)
~exp_conds:[Pre.mem_read_offsets env2 offset] in
let _, env1 = Pre.init_vars pre_regs env1 in
let post1, hyps1 = Comp.compare_subs_sp in
let post2, hyps2 = Comp.compare_subs_eq ~pre_regs ~post_regs in
let compare_prop, env1, env2 = Comp.compare_subs
~postconds:[post1; post2] ~hyps:[hyps1; hyps2]
~original:(sub1, env1) ~modified:(sub2, env2)
in
assert_z3_compare test_ctx ~orig:env1 ~modif:env2
(Sub.to_string sub1) (Sub.to_string sub2)
compare_prop Z3.Solver.UNSATISFIABLE
let test_mk_smtlib2_compare_1 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Env.set_freshen env2 true in
let x = Var.create "x" reg32_t in
let y = Var.create "y" reg32_t in
let x1, env1 = Env.get_var env1 x in
let _, env2 = Env.get_var env2 x in
let _, env1 = Env.get_var env1 y in
let y2, env2 = Env.get_var env2 y in
let init_x1, env1 = Env.mk_init_var env1 x in
let _, env2 = Env.mk_init_var env2 x in
let _, env1 = Env.mk_init_var env1 y in
let init_y2, env2 = Env.mk_init_var env2 y in
let cond = "(assert (and (= x_orig init_x_orig) (= y_mod init_y_mod)))" in
let expected =
let constr =
Bool.mk_and ctx [Bool.mk_eq ctx x1 init_x1; Bool.mk_eq ctx y2 init_y2]
|> Constr.mk_goal "(and (= x0 init_x0) (= y02 init_y02))"
|> Constr.mk_constr
in
Constr.mk_clause [] [constr]
in
let result = Compare.mk_smtlib2_compare env1 env2 cond in
assert_equal ~ctxt:test_ctx
~printer:Constr.to_string
expected result
let test_mk_smtlib2_compare_2 (test_ctx : test_ctxt) : unit =
let ctx = Env.mk_ctx () in
let var_gen = Env.mk_var_gen () in
let env1 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Pre.mk_env ~target:test_tgt ctx var_gen in
let env2 = Env.set_freshen env2 true in
let x = Var.create "x" reg32_t in
let x1, env1 = Env.get_var env1 x in
let x2, env2 = Env.get_var env2 x in
let _, env1 = Env.mk_init_var env1 x in
let init_x2, env2 = Env.mk_init_var env2 x in
let x_orig123 = BV.mk_const_s ctx "x_orig123" 32 in
let cond =
"(declare-const x_orig123 (_ BitVec 32)) \n\
(assert (and (= x_orig x_orig123) (= x_mod init_x_mod)))"
in
let expected =
let constr =
Bool.mk_and ctx [Bool.mk_eq ctx x1 x_orig123; Bool.mk_eq ctx x2 init_x2]
|> Constr.mk_goal "(and (= x0 x_orig123) (= x01 init_x01))"
|> Constr.mk_constr
in
Constr.mk_clause [] [constr]
in
let result = Compare.mk_smtlib2_compare env1 env2 cond in
assert_equal ~ctxt:test_ctx
~printer:Constr.to_string
expected result
let suite = [
"z = x+y; and x = x+1; y = y-1; z = x+y;" >:: test_block_pair_1;
"z = x; and y = x; z = y;" >:: test_block_pair_2;
"Remove dead assignments" >:: test_sub_pair_1;
"Remove needed assignments" >:: test_sub_pair_2;
"Arithmetic across different blocks" >:: test_sub_pair_3;
"Squashing assignments" >:: test_sub_pair_4;
"Jump to opposite block" >:: test_sub_pair_5;
"Assert in original, VC in modified UNSAT" >:: test_sub_pair_6;
"Assert in original, VC in modified SAT" >:: test_sub_pair_7;
"Same subroutines" >:: test_sub_pair_fun_1;
"Fun called in modified sub" >:: test_sub_pair_fun_2;
"Branches with fun calls" >:: test_sub_pair_fun_3;
"Fun called in branch" >:: test_sub_pair_fun_4;
"Function output substitution: UNSAT" >:: test_fun_outputs_1;
"Function output substitution: SAT" >:: test_fun_outputs_2;
"Function output: all input regs SAT" >:: test_fun_outputs_3;
"Function output: no input regss UNSAT" >:: test_fun_outputs_4;
"Compare memory layout" >:: test_sub_pair_mem_1;
"Diff data location: UNSAT" >:: test_memory_model_1;
"Diff data location: SAT" >:: test_memory_model_2;
"Diff data location, substitution: UNSAT" >:: test_memory_model_3;
"Parsing smtlib compare expression" >:: test_mk_smtlib2_compare_1;
"Should not overwrite x_orig123" >:: test_mk_smtlib2_compare_2;
]