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
|
(**************************************************************************)
(* *)
(* The Why platform for program certification *)
(* Copyright (C) 2002-2008 *)
(* Romain BARDOU *)
(* Jean-Franois COUCHOT *)
(* Mehdi DOGGUY *)
(* Jean-Christophe FILLITRE *)
(* Thierry HUBERT *)
(* Claude MARCH *)
(* Yannick MOY *)
(* Christine PAULIN *)
(* Yann RGIS-GIANAS *)
(* Nicolas ROUSSET *)
(* Xavier URBAIN *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU General Public *)
(* License version 2, as published by the Free Software Foundation. *)
(* *)
(* This software is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. *)
(* *)
(* See the GNU General Public License version 2 for more details *)
(* (enclosed in the file GPL). *)
(* *)
(**************************************************************************)
(* Statistics on Why goals *)
open Format
open Pp
open Ident
open Logic
open Ptree
let out = ref ""
let prefix = ref "x"
let spec = []
let usage = "why-stat files..."
let files = Queue.create ()
let rec explain_exception fmt = function
| Lexer.Lexical_error s ->
fprintf fmt "Lexical error: %s" s
| Parsing.Parse_error ->
fprintf fmt "Syntax error"
| Stream.Error s ->
fprintf fmt "Syntax error: %s" s
| Loc.Located (loc, e) ->
fprintf fmt "%a%a" Loc.report_position loc explain_exception e
| e ->
fprintf fmt "Anomaly: %s" (Printexc.to_string e); raise e
let add_file f =
try
let c = open_in f in
let lb = Lexing.from_channel c in
lb.Lexing.lex_curr_p <- { lb.Lexing.lex_curr_p with Lexing.pos_fname = f };
let p = Lexer.parse_file lb in
Queue.add p files;
close_in c
with e ->
explain_exception err_formatter e;
pp_print_newline err_formatter ();
exit 1
let () = Arg.parse spec add_file usage
(* sets of identifiers *)
module S = struct
include Idset
let print fmt s =
let l = Idset.elements s in
print_list (fun fmt () -> fprintf fmt ",") Ident.print fmt l
end
(* multisets of sets of identifiers *)
module M = struct
module MS = Map.Make(S)
let ms = ref MS.empty
let add s =
try incr (MS.find s !ms)
with Not_found -> ms := MS.add s (ref 1) !ms
let print fmt =
let l = MS.fold (fun s r l -> (!r,s) :: l) !ms [] in
let l = List.sort (fun (n1,_) (n2,_) -> compare n2 n1) l in
List.iter (fun (n,s) -> fprintf fmt "%8d %a@\n" n S.print s) l
end
let ident avoid s id = if not (S.mem id avoid) then S.add id s else s
let rec lexpr avoid s p = match p.pp_desc with
| PPvar id ->
ident avoid s id
| PPapp (id, l) ->
let s = ident avoid s id in
List.fold_left (lexpr avoid) s l
| PPconst _
| PPtrue
| PPfalse ->
s
| PPinfix (a, _, b) ->
lexpr avoid (lexpr avoid s a) b
| PPif (a, b, c) ->
lexpr avoid (lexpr avoid (lexpr avoid s a) b) c
| PPprefix (_, a)
| PPfpi (a, _, _)
| PPnamed (_, a) ->
lexpr avoid s a
| PPforall (id,_,_,p)
| PPexists (id,_,p) ->
let avoid = S.add id avoid in
lexpr avoid s p
let rec lexpr avoid s p = match p.pp_desc with
| PPvar id ->
ident avoid s id
| PPapp (id, l) ->
let s = ident avoid s id in
List.fold_left (lexpr avoid) s l
| PPconst _
| PPtrue
| PPfalse ->
s
| PPinfix (a, _, b) ->
lexpr avoid (lexpr avoid s a) b
| PPif (a, b, c) ->
lexpr avoid (lexpr avoid (lexpr avoid s a) b) c
| PPprefix (_, a)
| PPfpi (a, _, _)
| PPnamed (_, a) ->
lexpr avoid s a
| PPforall (id,_,_,p)
| PPexists (id,_,p) ->
let avoid = S.add id avoid in
lexpr avoid s p
let number_of_literals = ref 0
let rec compute_literal_number pr = match pr.pp_desc with
| PPinfix (p1,_, p2) ->
compute_literal_number p1 ;
compute_literal_number p2 ;
| PPif(_,p1,p2) ->
compute_literal_number p1 ;
compute_literal_number p2 ;
| PPapp(_) ->
number_of_literals := !number_of_literals + 1
| PPprefix(_,p)
| PPforall (_, _, _, p)
| PPexists (_,_,p)
| PPnamed(_,p)
| PPfpi(p,_,_) ->
compute_literal_number p
| PPvar(_)
| PPconst(_) ->
number_of_literals := !number_of_literals + 1
| PPtrue
| PPfalse -> ()
let decl = function
| Goal (_, _, p) ->
let rec intros avoid p = match p.pp_desc with
| PPinfix (_, PPimplies, p) -> intros avoid p
| PPforall (id, _, _, p) -> intros (S.add id avoid) p
| _ -> lexpr avoid S.empty p
in
let s = intros S.empty p in
M.add s ;
compute_literal_number p;
| Program _
| Parameter _
| Exception _
| Logic _
| Axiom _
| Predicate_def _
| Function_def _
| TypeDecl _ ->
()
let () =
Queue.iter (List.iter decl) files;
M.print std_formatter;
Printf.printf "Goal Literal Number : %d \n" !number_of_literals
|
