File: div.why

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (59 lines) | stat: -rw-r--r-- 1,374 bytes parent folder | download | duplicates (5)
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

theory EuclideanDivTest

  use int.Int
  use int.EuclideanDivision

  constant div_m1_2 : int = div (-1) 2
  constant mod_m1_2 : int = mod (-1) 2
  constant div_1_m2 : int = div 1 (-2)
  constant mod_1_m2 : int = mod 1 (-2)
  constant div_m1_m2 : int = div (-1) (-2)
  constant mod_m1_m2 : int = mod (-1) (-2)

  goal ok1 : div_m1_2 = -1
  goal ok2 : mod_m1_2 = 1
  goal ok3 : div_1_m2 = 0
  goal ok4 : mod_1_m2 = 1
  goal ok5 : div_m1_m2 = 1
  goal ok6 : mod_m1_m2 = 1

  goal smoke1 : div_m1_2 = 0
  goal smoke2 : mod_m1_2 = -1
  goal smoke3 : div_1_m2 = 1
  goal smoke4 : mod_1_m2 = -1
  goal smoke5 : div_m1_m2 = 0
  goal smoke6 : mod_m1_m2 = -1

end

theory ComputerDivTest

  use int.Int
  use int.ComputerDivision

  constant div_m1_2 : int = div (-1) 2
  constant mod_m1_2 : int = mod (-1) 2
  constant div_1_m2 : int = div 1 (-2)
  constant mod_1_m2 : int = mod 1 (-2)
  constant div_m1_m2 : int = div (-1) (-2)
  constant mod_m1_m2 : int = mod (-1) (-2)

  goal ok1 : div_m1_2 = 0
  goal ok2 : mod_m1_2 = -1
  goal ok3 : div_1_m2 = 0
  goal ok4 : mod_1_m2 = 1
  goal ok5 : div_m1_m2 = 0
  goal ok6 : mod_m1_m2 = -1

  goal smoke1 : div_m1_2 = -1
  goal smoke2 : mod_m1_2 = 1
  goal smoke3 : div_1_m2 = -1
  goal smoke4 : mod_1_m2 = -1
  goal smoke5 : div_m1_m2 = -1
  goal smoke6 : mod_m1_m2 = 1

  goal div_pos_neg: forall x y. x>=0 -> y<0 -> div x y <= 0


end