src/HOL/Tools/Nitpick/nitpick.ML
author blanchet
Tue Mar 09 09:25:23 2010 +0100 (2010-03-09 ago)
changeset 35665 ff2bf50505ab
parent 35408 b48ab741683b
child 35671 ed2c3830d881
permissions -rw-r--r--
added "finitize" option to Nitpick + remove dependency on "Coinductive_List"
blanchet@33982
     1
(*  Title:      HOL/Tools/Nitpick/nitpick.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2008, 2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Finite model generation for HOL formulas using Kodkod.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK =
blanchet@33192
     9
sig
blanchet@33705
    10
  type styp = Nitpick_Util.styp
blanchet@33192
    11
  type params = {
blanchet@33192
    12
    cards_assigns: (typ option * int list) list,
blanchet@33192
    13
    maxes_assigns: (styp option * int list) list,
blanchet@33192
    14
    iters_assigns: (styp option * int list) list,
blanchet@34124
    15
    bitss: int list,
blanchet@33192
    16
    bisim_depths: int list,
blanchet@33192
    17
    boxes: (typ option * bool option) list,
blanchet@35665
    18
    finitizes: (typ option * bool option) list,
blanchet@33192
    19
    monos: (typ option * bool option) list,
blanchet@34982
    20
    stds: (typ option * bool) list,
blanchet@33192
    21
    wfs: (styp option * bool option) list,
blanchet@33192
    22
    sat_solver: string,
blanchet@33192
    23
    blocking: bool,
blanchet@33192
    24
    falsify: bool,
blanchet@33192
    25
    debug: bool,
blanchet@33192
    26
    verbose: bool,
blanchet@33192
    27
    overlord: bool,
blanchet@33192
    28
    user_axioms: bool option,
blanchet@33192
    29
    assms: bool,
blanchet@33556
    30
    merge_type_vars: bool,
blanchet@34124
    31
    binary_ints: bool option,
blanchet@33192
    32
    destroy_constrs: bool,
blanchet@33192
    33
    specialize: bool,
blanchet@33192
    34
    skolemize: bool,
blanchet@33192
    35
    star_linear_preds: bool,
blanchet@33192
    36
    uncurry: bool,
blanchet@33192
    37
    fast_descrs: bool,
blanchet@33192
    38
    peephole_optim: bool,
blanchet@33192
    39
    timeout: Time.time option,
blanchet@33192
    40
    tac_timeout: Time.time option,
blanchet@33192
    41
    sym_break: int,
blanchet@33192
    42
    sharing_depth: int,
blanchet@33192
    43
    flatten_props: bool,
blanchet@33192
    44
    max_threads: int,
blanchet@33192
    45
    show_skolems: bool,
blanchet@33192
    46
    show_datatypes: bool,
blanchet@33192
    47
    show_consts: bool,
blanchet@33192
    48
    evals: term list,
blanchet@33192
    49
    formats: (term option * int list) list,
blanchet@33192
    50
    max_potential: int,
blanchet@33192
    51
    max_genuine: int,
blanchet@33192
    52
    check_potential: bool,
blanchet@33192
    53
    check_genuine: bool,
blanchet@33192
    54
    batch_size: int,
blanchet@33192
    55
    expect: string}
blanchet@33192
    56
blanchet@33192
    57
  val register_frac_type : string -> (string * string) list -> theory -> theory
blanchet@33192
    58
  val unregister_frac_type : string -> theory -> theory
blanchet@33192
    59
  val register_codatatype : typ -> string -> styp list -> theory -> theory
blanchet@33192
    60
  val unregister_codatatype : typ -> theory -> theory
blanchet@33192
    61
  val pick_nits_in_term :
blanchet@35335
    62
    Proof.state -> params -> bool -> int -> int -> int -> (term * term) list
blanchet@35335
    63
    -> term list -> term -> string * Proof.state
blanchet@33192
    64
  val pick_nits_in_subgoal :
blanchet@34982
    65
    Proof.state -> params -> bool -> int -> int -> string * Proof.state
blanchet@33192
    66
end;
blanchet@33192
    67
blanchet@33192
    68
structure Nitpick : NITPICK =
blanchet@33192
    69
struct
blanchet@33192
    70
blanchet@33232
    71
open Nitpick_Util
blanchet@33232
    72
open Nitpick_HOL
blanchet@35070
    73
open Nitpick_Preproc
blanchet@33232
    74
open Nitpick_Mono
blanchet@33232
    75
open Nitpick_Scope
blanchet@33232
    76
open Nitpick_Peephole
blanchet@33232
    77
open Nitpick_Rep
blanchet@33232
    78
open Nitpick_Nut
blanchet@33232
    79
open Nitpick_Kodkod
blanchet@33232
    80
open Nitpick_Model
blanchet@33192
    81
blanchet@34126
    82
structure KK = Kodkod
blanchet@34126
    83
blanchet@33192
    84
type params = {
blanchet@33192
    85
  cards_assigns: (typ option * int list) list,
blanchet@33192
    86
  maxes_assigns: (styp option * int list) list,
blanchet@33192
    87
  iters_assigns: (styp option * int list) list,
blanchet@34124
    88
  bitss: int list,
blanchet@33192
    89
  bisim_depths: int list,
blanchet@33192
    90
  boxes: (typ option * bool option) list,
blanchet@35665
    91
  finitizes: (typ option * bool option) list,
blanchet@33192
    92
  monos: (typ option * bool option) list,
blanchet@34982
    93
  stds: (typ option * bool) list,
blanchet@33192
    94
  wfs: (styp option * bool option) list,
blanchet@33192
    95
  sat_solver: string,
blanchet@33192
    96
  blocking: bool,
blanchet@33192
    97
  falsify: bool,
blanchet@33192
    98
  debug: bool,
blanchet@33192
    99
  verbose: bool,
blanchet@33192
   100
  overlord: bool,
blanchet@33192
   101
  user_axioms: bool option,
blanchet@33192
   102
  assms: bool,
blanchet@33556
   103
  merge_type_vars: bool,
blanchet@34124
   104
  binary_ints: bool option,
blanchet@33192
   105
  destroy_constrs: bool,
blanchet@33192
   106
  specialize: bool,
blanchet@33192
   107
  skolemize: bool,
blanchet@33192
   108
  star_linear_preds: bool,
blanchet@33192
   109
  uncurry: bool,
blanchet@33192
   110
  fast_descrs: bool,
blanchet@33192
   111
  peephole_optim: bool,
blanchet@33192
   112
  timeout: Time.time option,
blanchet@33192
   113
  tac_timeout: Time.time option,
blanchet@33192
   114
  sym_break: int,
blanchet@33192
   115
  sharing_depth: int,
blanchet@33192
   116
  flatten_props: bool,
blanchet@33192
   117
  max_threads: int,
blanchet@33192
   118
  show_skolems: bool,
blanchet@33192
   119
  show_datatypes: bool,
blanchet@33192
   120
  show_consts: bool,
blanchet@33192
   121
  evals: term list,
blanchet@33192
   122
  formats: (term option * int list) list,
blanchet@33192
   123
  max_potential: int,
blanchet@33192
   124
  max_genuine: int,
blanchet@33192
   125
  check_potential: bool,
blanchet@33192
   126
  check_genuine: bool,
blanchet@33192
   127
  batch_size: int,
blanchet@33192
   128
  expect: string}
blanchet@33192
   129
blanchet@33192
   130
type problem_extension = {
blanchet@33192
   131
  free_names: nut list,
blanchet@33192
   132
  sel_names: nut list,
blanchet@33192
   133
  nonsel_names: nut list,
blanchet@33192
   134
  rel_table: nut NameTable.table,
blanchet@35185
   135
  unsound: bool,
blanchet@35386
   136
  scope: scope}
blanchet@33192
   137
blanchet@34126
   138
type rich_problem = KK.problem * problem_extension
blanchet@33192
   139
blanchet@33192
   140
(* Proof.context -> string -> term list -> Pretty.T list *)
blanchet@33192
   141
fun pretties_for_formulas _ _ [] = []
blanchet@33192
   142
  | pretties_for_formulas ctxt s ts =
blanchet@33192
   143
    [Pretty.str (s ^ plural_s_for_list ts ^ ":"),
blanchet@33192
   144
     Pretty.indent indent_size (Pretty.chunks
blanchet@33192
   145
         (map2 (fn j => fn t =>
blanchet@34121
   146
                   Pretty.block [t |> shorten_names_in_term
blanchet@33192
   147
                                   |> Syntax.pretty_term ctxt,
blanchet@33192
   148
                                 Pretty.str (if j = 1 then "." else ";")])
blanchet@33192
   149
               (length ts downto 1) ts))]
blanchet@33192
   150
blanchet@33568
   151
(* unit -> string *)
blanchet@33568
   152
fun install_kodkodi_message () =
blanchet@33568
   153
  "Nitpick requires the external Java program Kodkodi. To install it, download \
blanchet@33568
   154
  \the package from Isabelle's web page and add the \"kodkodi-x.y.z\" \
blanchet@33568
   155
  \directory's full path to \"" ^
blanchet@33568
   156
  Path.implode (Path.expand (Path.appends
blanchet@33568
   157
      (Path.variable "ISABELLE_HOME_USER" ::
blanchet@33568
   158
       map Path.basic ["etc", "components"]))) ^ "\"."
blanchet@33568
   159
blanchet@35185
   160
val max_unsound_delay_ms = 200
blanchet@35185
   161
val max_unsound_delay_percent = 2
blanchet@33192
   162
blanchet@33192
   163
(* Time.time option -> int *)
blanchet@35185
   164
fun unsound_delay_for_timeout NONE = max_unsound_delay_ms
blanchet@35185
   165
  | unsound_delay_for_timeout (SOME timeout) =
blanchet@35185
   166
    Int.max (0, Int.min (max_unsound_delay_ms,
blanchet@33192
   167
                         Time.toMilliseconds timeout
blanchet@35185
   168
                         * max_unsound_delay_percent div 100))
blanchet@33192
   169
blanchet@33192
   170
(* Time.time option -> bool *)
blanchet@33192
   171
fun passed_deadline NONE = false
blanchet@33192
   172
  | passed_deadline (SOME time) = Time.compare (Time.now (), time) <> LESS
blanchet@33192
   173
blanchet@33192
   174
(* ('a * bool option) list -> bool *)
blanchet@34123
   175
fun none_true assigns = forall (not_equal (SOME true) o snd) assigns
blanchet@33192
   176
blanchet@34038
   177
val syntactic_sorts =
blanchet@34038
   178
  @{sort "{default,zero,one,plus,minus,uminus,times,inverse,abs,sgn,ord,eq}"} @
blanchet@34038
   179
  @{sort number}
blanchet@34038
   180
(* typ -> bool *)
blanchet@34038
   181
fun has_tfree_syntactic_sort (TFree (_, S as _ :: _)) =
blanchet@34038
   182
    subset (op =) (S, syntactic_sorts)
blanchet@34038
   183
  | has_tfree_syntactic_sort _ = false
blanchet@34038
   184
(* term -> bool *)
blanchet@34038
   185
val has_syntactic_sorts = exists_type (exists_subtype has_tfree_syntactic_sort)
blanchet@33192
   186
blanchet@33568
   187
(* (unit -> string) -> Pretty.T *)
blanchet@33568
   188
fun plazy f = Pretty.blk (0, pstrs (f ()))
blanchet@33568
   189
blanchet@35335
   190
(* Time.time -> Proof.state -> params -> bool -> int -> int -> int
blanchet@35335
   191
   -> (term * term) list -> term list -> term -> string * Proof.state *)
blanchet@34982
   192
fun pick_them_nits_in_term deadline state (params : params) auto i n step
blanchet@35335
   193
                           subst orig_assm_ts orig_t =
blanchet@33192
   194
  let
blanchet@33192
   195
    val timer = Timer.startRealTimer ()
blanchet@34935
   196
    val thy = Proof.theory_of state
blanchet@34935
   197
    val ctxt = Proof.context_of state
blanchet@35386
   198
(* FIXME: reintroduce code before new release:
blanchet@35386
   199
blanchet@34039
   200
    val nitpick_thy = ThyInfo.get_theory "Nitpick"
blanchet@34936
   201
    val _ = Theory.subthy (nitpick_thy, thy) orelse
blanchet@34936
   202
            error "You must import the theory \"Nitpick\" to use Nitpick"
blanchet@34982
   203
*)
blanchet@34124
   204
    val {cards_assigns, maxes_assigns, iters_assigns, bitss, bisim_depths,
blanchet@35665
   205
         boxes, finitizes, monos, stds, wfs, sat_solver, falsify, debug,
blanchet@35665
   206
         verbose, overlord, user_axioms, assms, merge_type_vars, binary_ints,
blanchet@35665
   207
         destroy_constrs, specialize, skolemize, star_linear_preds, uncurry,
blanchet@35665
   208
         fast_descrs, peephole_optim, tac_timeout, sym_break, sharing_depth,
blanchet@35665
   209
         flatten_props, max_threads, show_skolems, show_datatypes, show_consts,
blanchet@35665
   210
         evals, formats, max_potential, max_genuine, check_potential,
blanchet@35665
   211
         check_genuine, batch_size, ...} =
blanchet@33192
   212
      params
blanchet@33192
   213
    val state_ref = Unsynchronized.ref state
blanchet@33192
   214
    (* Pretty.T -> unit *)
blanchet@33192
   215
    val pprint =
blanchet@33192
   216
      if auto then
blanchet@33192
   217
        Unsynchronized.change state_ref o Proof.goal_message o K
blanchet@33561
   218
        o Pretty.chunks o cons (Pretty.str "") o single
blanchet@33192
   219
        o Pretty.mark Markup.hilite
blanchet@33192
   220
      else
blanchet@33192
   221
        priority o Pretty.string_of
blanchet@33192
   222
    (* (unit -> Pretty.T) -> unit *)
blanchet@33192
   223
    fun pprint_m f = () |> not auto ? pprint o f
blanchet@33192
   224
    fun pprint_v f = () |> verbose ? pprint o f
blanchet@33192
   225
    fun pprint_d f = () |> debug ? pprint o f
blanchet@33192
   226
    (* string -> unit *)
blanchet@33192
   227
    val print = pprint o curry Pretty.blk 0 o pstrs
blanchet@33192
   228
    (* (unit -> string) -> unit *)
blanchet@33568
   229
    val print_m = pprint_m o K o plazy
blanchet@33568
   230
    val print_v = pprint_v o K o plazy
blanchet@33192
   231
blanchet@33192
   232
    (* unit -> unit *)
blanchet@33192
   233
    fun check_deadline () =
blanchet@33192
   234
      if debug andalso passed_deadline deadline then raise TimeLimit.TimeOut
blanchet@33192
   235
      else ()
blanchet@33192
   236
    (* unit -> 'a *)
blanchet@33192
   237
    fun do_interrupted () =
blanchet@33192
   238
      if passed_deadline deadline then raise TimeLimit.TimeOut
blanchet@33192
   239
      else raise Interrupt
blanchet@33192
   240
blanchet@35335
   241
    val orig_assm_ts = if assms orelse auto then orig_assm_ts else []
blanchet@34982
   242
    val _ =
blanchet@34982
   243
      if step = 0 then
blanchet@34982
   244
        print_m (fn () => "Nitpicking formula...")
blanchet@34982
   245
      else
blanchet@34982
   246
        pprint_m (fn () => Pretty.chunks (
blanchet@34982
   247
            pretties_for_formulas ctxt ("Nitpicking " ^
blanchet@34982
   248
                (if i <> 1 orelse n <> 1 then
blanchet@34982
   249
                   "subgoal " ^ string_of_int i ^ " of " ^ string_of_int n
blanchet@34982
   250
                 else
blanchet@35181
   251
                   "goal")) [Logic.list_implies (orig_assm_ts, orig_t)]))
blanchet@33192
   252
    val neg_t = if falsify then Logic.mk_implies (orig_t, @{prop False})
blanchet@33192
   253
                else orig_t
blanchet@35335
   254
    val assms_t = Logic.mk_conjunction_list (neg_t :: orig_assm_ts)
blanchet@33192
   255
    val (assms_t, evals) =
blanchet@33705
   256
      assms_t :: evals |> merge_type_vars ? merge_type_vars_in_terms
blanchet@33705
   257
                       |> pairf hd tl
blanchet@33192
   258
    val original_max_potential = max_potential
blanchet@33192
   259
    val original_max_genuine = max_genuine
blanchet@33192
   260
(*
blanchet@33192
   261
    val _ = priority ("*** " ^ Syntax.string_of_term ctxt orig_t)
blanchet@33192
   262
    val _ = List.app (fn t => priority ("*** " ^ Syntax.string_of_term ctxt t))
blanchet@33192
   263
                     orig_assm_ts
blanchet@33192
   264
*)
blanchet@33192
   265
    val max_bisim_depth = fold Integer.max bisim_depths ~1
blanchet@35220
   266
    val case_names = case_const_names thy stds
blanchet@35335
   267
    val (defs, built_in_nondefs, user_nondefs) = all_axioms_of thy subst
blanchet@35335
   268
    val def_table = const_def_table ctxt subst defs
blanchet@33192
   269
    val nondef_table = const_nondef_table (built_in_nondefs @ user_nondefs)
blanchet@35335
   270
    val simp_table = Unsynchronized.ref (const_simp_table ctxt subst)
blanchet@35335
   271
    val psimp_table = const_psimp_table ctxt subst
blanchet@35335
   272
    val intro_table = inductive_intro_table ctxt subst def_table
blanchet@33192
   273
    val ground_thm_table = ground_theorem_table thy
blanchet@33192
   274
    val ersatz_table = ersatz_table thy
blanchet@35070
   275
    val (hol_ctxt as {wf_cache, ...}) =
blanchet@33192
   276
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   277
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@34124
   278
       binary_ints = binary_ints, destroy_constrs = destroy_constrs,
blanchet@34124
   279
       specialize = specialize, skolemize = skolemize,
blanchet@34124
   280
       star_linear_preds = star_linear_preds, uncurry = uncurry,
blanchet@34124
   281
       fast_descrs = fast_descrs, tac_timeout = tac_timeout, evals = evals,
blanchet@34124
   282
       case_names = case_names, def_table = def_table,
blanchet@33192
   283
       nondef_table = nondef_table, user_nondefs = user_nondefs,
blanchet@33192
   284
       simp_table = simp_table, psimp_table = psimp_table,
blanchet@33192
   285
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@33192
   286
       ersatz_table = ersatz_table, skolems = Unsynchronized.ref [],
blanchet@33192
   287
       special_funs = Unsynchronized.ref [],
blanchet@33580
   288
       unrolled_preds = Unsynchronized.ref [], wf_cache = Unsynchronized.ref [],
blanchet@33580
   289
       constr_cache = Unsynchronized.ref []}
blanchet@33192
   290
    val frees = Term.add_frees assms_t []
blanchet@34936
   291
    val _ = null (Term.add_tvars assms_t []) orelse
blanchet@34936
   292
            raise NOT_SUPPORTED "schematic type variables"
blanchet@35386
   293
    val (nondef_ts, def_ts, got_all_mono_user_axioms, no_poly_user_axioms,
blanchet@35665
   294
         binarize) = preprocess_term hol_ctxt finitizes monos assms_t
blanchet@33192
   295
    val got_all_user_axioms =
blanchet@33192
   296
      got_all_mono_user_axioms andalso no_poly_user_axioms
blanchet@33192
   297
blanchet@33192
   298
    (* styp * (bool * bool) -> unit *)
blanchet@33192
   299
    fun print_wf (x, (gfp, wf)) =
blanchet@33192
   300
      pprint (Pretty.blk (0,
blanchet@33192
   301
          pstrs ("The " ^ (if gfp then "co" else "") ^ "inductive predicate \"")
blanchet@33192
   302
          @ Syntax.pretty_term ctxt (Const x) ::
blanchet@33192
   303
          pstrs (if wf then
blanchet@33192
   304
                   "\" was proved well-founded. Nitpick can compute it \
blanchet@33192
   305
                   \efficiently."
blanchet@33192
   306
                 else
blanchet@33192
   307
                   "\" could not be proved well-founded. Nitpick might need to \
blanchet@33192
   308
                   \unroll it.")))
blanchet@33192
   309
    val _ = if verbose then List.app print_wf (!wf_cache) else ()
blanchet@33192
   310
    val _ =
blanchet@35386
   311
      pprint_d (fn () => Pretty.chunks
blanchet@35386
   312
          (pretties_for_formulas ctxt "Preprocessed formula" [hd nondef_ts] @
blanchet@35386
   313
           pretties_for_formulas ctxt "Relevant definitional axiom" def_ts @
blanchet@35386
   314
           pretties_for_formulas ctxt "Relevant nondefinitional axiom"
blanchet@35386
   315
                                 (tl nondef_ts)))
blanchet@35386
   316
    val _ = List.app (ignore o Term.type_of) (nondef_ts @ def_ts)
blanchet@33192
   317
            handle TYPE (_, Ts, ts) =>
blanchet@33192
   318
                   raise TYPE ("Nitpick.pick_them_nits_in_term", Ts, ts)
blanchet@33192
   319
blanchet@35386
   320
    val nondef_us = map (nut_from_term hol_ctxt Eq) nondef_ts
blanchet@35070
   321
    val def_us = map (nut_from_term hol_ctxt DefEq) def_ts
blanchet@33558
   322
    val (free_names, const_names) =
blanchet@35386
   323
      fold add_free_and_const_names (nondef_us @ def_us) ([], [])
blanchet@33558
   324
    val (sel_names, nonsel_names) =
blanchet@33558
   325
      List.partition (is_sel o nickname_of) const_names
blanchet@35665
   326
    val sound_finitizes =
blanchet@35665
   327
      none_true (filter_out (fn (SOME (Type (@{type_name fun}, _)), _) => true
blanchet@35665
   328
                          | _ => false) finitizes)
blanchet@35665
   329
    val genuine_means_genuine =
blanchet@35665
   330
      got_all_user_axioms andalso none_true wfs andalso sound_finitizes
blanchet@34982
   331
    val standard = forall snd stds
blanchet@33558
   332
(*
blanchet@35386
   333
    val _ = List.app (priority o string_for_nut ctxt) (nondef_us @ def_us)
blanchet@33558
   334
*)
blanchet@33558
   335
blanchet@34121
   336
    val unique_scope = forall (curry (op =) 1 o length o snd) cards_assigns
blanchet@35385
   337
    (* typ list -> string -> string *)
blanchet@35385
   338
    fun monotonicity_message Ts extra =
blanchet@35385
   339
      let val ss = map (quote o string_for_type ctxt) Ts in
blanchet@35385
   340
        "The type" ^ plural_s_for_list ss ^ " " ^
blanchet@35385
   341
        space_implode " " (serial_commas "and" ss) ^ " " ^
blanchet@35385
   342
        (if none_true monos then
blanchet@35385
   343
           "passed the monotonicity test"
blanchet@35385
   344
         else
blanchet@35385
   345
           (if length ss = 1 then "is" else "are") ^ " considered monotonic") ^
blanchet@35385
   346
        ". " ^ extra
blanchet@35385
   347
      end
blanchet@33192
   348
    (* typ -> bool *)
blanchet@35665
   349
    fun is_type_fundamentally_monotonic T =
blanchet@35220
   350
      (is_datatype thy stds T andalso not (is_quot_type thy T) andalso
blanchet@34938
   351
       (not (is_pure_typedef thy T) orelse is_univ_typedef thy T)) orelse
blanchet@35075
   352
      is_number_type thy T orelse is_bit_type T
blanchet@35385
   353
    fun is_type_actually_monotonic T =
blanchet@35386
   354
      formulas_monotonic hol_ctxt binarize T (nondef_ts, def_ts)
blanchet@35665
   355
    fun is_type_kind_of_monotonic T =
blanchet@35665
   356
      case triple_lookup (type_match thy) monos T of
blanchet@35665
   357
        SOME (SOME false) => false
blanchet@35665
   358
      | _ => is_type_actually_monotonic T
blanchet@34936
   359
    fun is_type_monotonic T =
blanchet@33192
   360
      unique_scope orelse
blanchet@33192
   361
      case triple_lookup (type_match thy) monos T of
blanchet@33192
   362
        SOME (SOME b) => b
blanchet@35665
   363
      | _ => is_type_fundamentally_monotonic T orelse
blanchet@35665
   364
             is_type_actually_monotonic T
blanchet@35665
   365
    fun is_shallow_datatype_finitizable (T as Type (@{type_name fin_fun}, _)) =
blanchet@35665
   366
        is_type_kind_of_monotonic T
blanchet@35665
   367
      | is_shallow_datatype_finitizable (T as Type (@{type_name fun_box}, _)) =
blanchet@35665
   368
        is_type_kind_of_monotonic T
blanchet@35665
   369
      | is_shallow_datatype_finitizable T =
blanchet@35665
   370
        case triple_lookup (type_match thy) finitizes T of
blanchet@35665
   371
          SOME (SOME b) => b
blanchet@35665
   372
        | _ => is_type_kind_of_monotonic T
blanchet@35385
   373
    fun is_datatype_deep T =
blanchet@35385
   374
      not standard orelse T = nat_T orelse is_word_type T orelse
blanchet@35385
   375
      exists (curry (op =) T o domain_type o type_of) sel_names
blanchet@35386
   376
    val all_Ts = ground_types_in_terms hol_ctxt binarize (nondef_ts @ def_ts)
wenzelm@35408
   377
                 |> sort Term_Ord.typ_ord
blanchet@34936
   378
    val _ = if verbose andalso binary_ints = SOME true andalso
blanchet@34982
   379
               exists (member (op =) [nat_T, int_T]) all_Ts then
blanchet@34124
   380
              print_v (K "The option \"binary_ints\" will be ignored because \
blanchet@34126
   381
                         \of the presence of rationals, reals, \"Suc\", \
blanchet@35386
   382
                         \\"gcd\", or \"lcm\" in the problem or because of the \
blanchet@35386
   383
                         \\"non_std\" option.")
blanchet@34124
   384
            else
blanchet@34124
   385
              ()
blanchet@34982
   386
    val (mono_Ts, nonmono_Ts) = List.partition is_type_monotonic all_Ts
blanchet@33192
   387
    val _ =
blanchet@34936
   388
      if verbose andalso not unique_scope then
blanchet@35665
   389
        case filter_out is_type_fundamentally_monotonic mono_Ts of
blanchet@34936
   390
          [] => ()
blanchet@34936
   391
        | interesting_mono_Ts =>
blanchet@35385
   392
          print_v (K (monotonicity_message interesting_mono_Ts
blanchet@35385
   393
                         "Nitpick might be able to skip some scopes."))
blanchet@33192
   394
      else
blanchet@33192
   395
        ()
blanchet@35385
   396
    val (deep_dataTs, shallow_dataTs) =
blanchet@35385
   397
      all_Ts |> filter (is_datatype thy stds) |> List.partition is_datatype_deep
blanchet@35385
   398
    val finitizable_dataTs =
blanchet@35385
   399
      shallow_dataTs |> filter_out (is_finite_type hol_ctxt)
blanchet@35665
   400
                     |> filter is_shallow_datatype_finitizable
blanchet@35385
   401
    val _ =
blanchet@35385
   402
      if verbose andalso not (null finitizable_dataTs) then
blanchet@35385
   403
        print_v (K (monotonicity_message finitizable_dataTs
blanchet@35385
   404
                        "Nitpick can use a more precise finite encoding."))
blanchet@35385
   405
      else
blanchet@35385
   406
        ()
blanchet@35183
   407
    (* This detection code is an ugly hack. Fortunately, it is used only to
blanchet@35183
   408
       provide a hint to the user. *)
blanchet@34982
   409
    (* string * (Rule_Cases.T * bool) -> bool *)
blanchet@35183
   410
    fun is_struct_induct_step (name, (Rule_Cases.Case {fixes, assumes, ...}, _)) =
blanchet@35183
   411
      not (null fixes) andalso
blanchet@35183
   412
      exists (String.isSuffix ".hyps" o fst) assumes andalso
blanchet@35183
   413
      exists (exists (curry (op =) name o shortest_name o fst)
blanchet@35183
   414
              o datatype_constrs hol_ctxt) deep_dataTs
blanchet@35183
   415
    val likely_in_struct_induct_step =
blanchet@35183
   416
      exists is_struct_induct_step (ProofContext.cases_of ctxt)
blanchet@35183
   417
    val _ = if standard andalso likely_in_struct_induct_step then
blanchet@34982
   418
              pprint_m (fn () => Pretty.blk (0,
blanchet@34982
   419
                  pstrs "Hint: To check that the induction hypothesis is \
blanchet@35177
   420
                        \general enough, try this command: " @
blanchet@34982
   421
                  [Pretty.mark Markup.sendback (Pretty.blk (0,
blanchet@35183
   422
                       pstrs ("nitpick [non_std, show_all]")))] @ pstrs "."))
blanchet@34982
   423
            else
blanchet@34982
   424
              ()
blanchet@33192
   425
(*
blanchet@34936
   426
    val _ = priority "Monotonic types:"
blanchet@34936
   427
    val _ = List.app (priority o string_for_type ctxt) mono_Ts
blanchet@34936
   428
    val _ = priority "Nonmonotonic types:"
blanchet@34936
   429
    val _ = List.app (priority o string_for_type ctxt) nonmono_Ts
blanchet@33192
   430
*)
blanchet@33192
   431
blanchet@33192
   432
    val need_incremental = Int.max (max_potential, max_genuine) >= 2
blanchet@33192
   433
    val effective_sat_solver =
blanchet@33192
   434
      if sat_solver <> "smart" then
blanchet@34936
   435
        if need_incremental andalso
blanchet@34936
   436
           not (member (op =) (Kodkod_SAT.configured_sat_solvers true)
blanchet@35333
   437
                       sat_solver) then
blanchet@33192
   438
          (print_m (K ("An incremental SAT solver is required: \"SAT4J\" will \
blanchet@33192
   439
                       \be used instead of " ^ quote sat_solver ^ "."));
blanchet@33192
   440
           "SAT4J")
blanchet@33192
   441
        else
blanchet@33192
   442
          sat_solver
blanchet@33192
   443
      else
blanchet@33232
   444
        Kodkod_SAT.smart_sat_solver_name need_incremental
blanchet@33192
   445
    val _ =
blanchet@33192
   446
      if sat_solver = "smart" then
blanchet@33192
   447
        print_v (fn () => "Using SAT solver " ^ quote effective_sat_solver ^
blanchet@33192
   448
                          ". The following" ^
blanchet@33192
   449
                          (if need_incremental then " incremental " else " ") ^
blanchet@33192
   450
                          "solvers are configured: " ^
blanchet@33232
   451
                          commas (map quote (Kodkod_SAT.configured_sat_solvers
blanchet@33192
   452
                                                       need_incremental)) ^ ".")
blanchet@33192
   453
      else
blanchet@33192
   454
        ()
blanchet@33192
   455
blanchet@33192
   456
    val too_big_scopes = Unsynchronized.ref []
blanchet@33192
   457
blanchet@33192
   458
    (* bool -> scope -> rich_problem option *)
blanchet@35185
   459
    fun problem_for_scope unsound
blanchet@34124
   460
            (scope as {card_assigns, bits, bisim_depth, datatypes, ofs, ...}) =
blanchet@33192
   461
      let
blanchet@33192
   462
        val _ = not (exists (fn other => scope_less_eq other scope)
blanchet@34936
   463
                            (!too_big_scopes)) orelse
blanchet@34936
   464
                raise TOO_LARGE ("Nitpick.pick_them_nits_in_term.\
blanchet@34936
   465
                                 \problem_for_scope", "too large scope")
blanchet@33192
   466
(*
blanchet@33192
   467
        val _ = priority "Offsets:"
blanchet@33192
   468
        val _ = List.app (fn (T, j0) =>
blanchet@33192
   469
                             priority (string_for_type ctxt T ^ " = " ^
blanchet@33192
   470
                                       string_of_int j0))
blanchet@33192
   471
                         (Typtab.dest ofs)
blanchet@33192
   472
*)
blanchet@35385
   473
        val all_exact = forall (is_exact_type datatypes true) all_Ts
blanchet@33192
   474
        (* nut list -> rep NameTable.table -> nut list * rep NameTable.table *)
blanchet@34123
   475
        val repify_consts = choose_reps_for_consts scope all_exact
blanchet@33192
   476
        val main_j0 = offset_of_type ofs bool_T
blanchet@33192
   477
        val (nat_card, nat_j0) = spec_of_type scope nat_T
blanchet@33192
   478
        val (int_card, int_j0) = spec_of_type scope int_T
blanchet@34936
   479
        val _ = (nat_j0 = main_j0 andalso int_j0 = main_j0) orelse
blanchet@34936
   480
                raise BAD ("Nitpick.pick_them_nits_in_term.problem_for_scope",
blanchet@34936
   481
                           "bad offsets")
blanchet@33192
   482
        val kk = kodkod_constrs peephole_optim nat_card int_card main_j0
blanchet@33192
   483
        val (free_names, rep_table) =
blanchet@33192
   484
          choose_reps_for_free_vars scope free_names NameTable.empty
blanchet@33192
   485
        val (sel_names, rep_table) = choose_reps_for_all_sels scope rep_table
blanchet@33192
   486
        val (nonsel_names, rep_table) = repify_consts nonsel_names rep_table
blanchet@33192
   487
        val min_highest_arity =
blanchet@33192
   488
          NameTable.fold (curry Int.max o arity_of_rep o snd) rep_table 1
blanchet@33192
   489
        val min_univ_card =
blanchet@33192
   490
          NameTable.fold (curry Int.max o min_univ_card_of_rep o snd) rep_table
blanchet@34126
   491
                         (univ_card nat_card int_card main_j0 [] KK.True)
blanchet@33192
   492
        val _ = check_arity min_univ_card min_highest_arity
blanchet@33192
   493
blanchet@35185
   494
        val def_us = map (choose_reps_in_nut scope unsound rep_table true)
blanchet@33192
   495
                         def_us
blanchet@35185
   496
        val nondef_us = map (choose_reps_in_nut scope unsound rep_table false)
blanchet@33192
   497
                            nondef_us
blanchet@33745
   498
(*
blanchet@33192
   499
        val _ = List.app (priority o string_for_nut ctxt)
blanchet@33192
   500
                         (free_names @ sel_names @ nonsel_names @
blanchet@35386
   501
                          nondef_us @ def_us)
blanchet@33745
   502
*)
blanchet@33192
   503
        val (free_rels, pool, rel_table) =
blanchet@33192
   504
          rename_free_vars free_names initial_pool NameTable.empty
blanchet@33192
   505
        val (sel_rels, pool, rel_table) =
blanchet@33192
   506
          rename_free_vars sel_names pool rel_table
blanchet@33192
   507
        val (other_rels, pool, rel_table) =
blanchet@33192
   508
          rename_free_vars nonsel_names pool rel_table
blanchet@35386
   509
        val nondef_us = map (rename_vars_in_nut pool rel_table) nondef_us
blanchet@33192
   510
        val def_us = map (rename_vars_in_nut pool rel_table) def_us
blanchet@35386
   511
        val nondef_fs = map (kodkod_formula_from_nut ofs kk) nondef_us
blanchet@35280
   512
        val def_fs = map (kodkod_formula_from_nut ofs kk) def_us
blanchet@35386
   513
        val formula = fold (fold s_and) [def_fs, nondef_fs] KK.True
blanchet@35185
   514
        val comment = (if unsound then "unsound" else "sound") ^ "\n" ^
blanchet@33192
   515
                      PrintMode.setmp [] multiline_string_for_scope scope
blanchet@34998
   516
        val kodkod_sat_solver =
blanchet@35177
   517
          Kodkod_SAT.sat_solver_spec effective_sat_solver |> snd
blanchet@34124
   518
        val bit_width = if bits = 0 then 16 else bits + 1
blanchet@35185
   519
        val delay = if unsound then
blanchet@33192
   520
                      Option.map (fn time => Time.- (time, Time.now ()))
blanchet@33192
   521
                                 deadline
blanchet@35185
   522
                      |> unsound_delay_for_timeout
blanchet@33192
   523
                    else
blanchet@33192
   524
                      0
blanchet@33192
   525
        val settings = [("solver", commas (map quote kodkod_sat_solver)),
blanchet@33192
   526
                        ("skolem_depth", "-1"),
blanchet@34124
   527
                        ("bit_width", string_of_int bit_width),
blanchet@33192
   528
                        ("symmetry_breaking", signed_string_of_int sym_break),
blanchet@33192
   529
                        ("sharing", signed_string_of_int sharing_depth),
blanchet@33192
   530
                        ("flatten", Bool.toString flatten_props),
blanchet@33192
   531
                        ("delay", signed_string_of_int delay)]
blanchet@33192
   532
        val plain_rels = free_rels @ other_rels
blanchet@33192
   533
        val plain_bounds = map (bound_for_plain_rel ctxt debug) plain_rels
blanchet@33192
   534
        val plain_axioms = map (declarative_axiom_for_plain_rel kk) plain_rels
blanchet@33192
   535
        val sel_bounds = map (bound_for_sel_rel ctxt debug datatypes) sel_rels
blanchet@35190
   536
        val dtype_axioms =
blanchet@35190
   537
          declarative_axioms_for_datatypes hol_ctxt binarize bits ofs kk
blanchet@35190
   538
                                           rel_table datatypes
blanchet@33192
   539
        val declarative_axioms = plain_axioms @ dtype_axioms
blanchet@35220
   540
        val univ_card = Int.max (univ_card nat_card int_card main_j0
blanchet@35220
   541
                                     (plain_bounds @ sel_bounds) formula,
blanchet@35220
   542
                                 main_j0 |> bits > 0 ? Integer.add (bits + 1))
blanchet@33192
   543
        val built_in_bounds = bounds_for_built_in_rels_in_formula debug
blanchet@33192
   544
                                  univ_card nat_card int_card main_j0 formula
blanchet@33192
   545
        val bounds = built_in_bounds @ plain_bounds @ sel_bounds
blanchet@33192
   546
                     |> not debug ? merge_bounds
blanchet@33192
   547
        val highest_arity =
blanchet@33192
   548
          fold Integer.max (map (fst o fst) (maps fst bounds)) 0
blanchet@33192
   549
        val formula = fold_rev s_and declarative_axioms formula
blanchet@34124
   550
        val _ = if bits = 0 then () else check_bits bits formula
blanchet@34126
   551
        val _ = if formula = KK.False then ()
blanchet@33192
   552
                else check_arity univ_card highest_arity
blanchet@33192
   553
      in
blanchet@33192
   554
        SOME ({comment = comment, settings = settings, univ_card = univ_card,
blanchet@33192
   555
               tuple_assigns = [], bounds = bounds,
blanchet@35280
   556
               int_bounds = if bits = 0 then sequential_int_bounds univ_card
blanchet@35280
   557
                            else pow_of_two_int_bounds bits main_j0,
blanchet@33192
   558
               expr_assigns = [], formula = formula},
blanchet@33192
   559
              {free_names = free_names, sel_names = sel_names,
blanchet@33192
   560
               nonsel_names = nonsel_names, rel_table = rel_table,
blanchet@35386
   561
               unsound = unsound, scope = scope})
blanchet@33192
   562
      end
blanchet@34124
   563
      handle TOO_LARGE (loc, msg) =>
blanchet@34936
   564
             if loc = "Nitpick_Kodkod.check_arity" andalso
blanchet@34936
   565
                not (Typtab.is_empty ofs) then
blanchet@35185
   566
               problem_for_scope unsound
blanchet@35190
   567
                   {hol_ctxt = hol_ctxt, binarize = binarize,
blanchet@35190
   568
                    card_assigns = card_assigns, bits = bits,
blanchet@35190
   569
                    bisim_depth = bisim_depth, datatypes = datatypes,
blanchet@35190
   570
                    ofs = Typtab.empty}
blanchet@33192
   571
             else if loc = "Nitpick.pick_them_nits_in_term.\
blanchet@33192
   572
                           \problem_for_scope" then
blanchet@33192
   573
               NONE
blanchet@33192
   574
             else
blanchet@33192
   575
               (Unsynchronized.change too_big_scopes (cons scope);
blanchet@33192
   576
                print_v (fn () => ("Limit reached: " ^ msg ^
blanchet@35185
   577
                                   ". Skipping " ^ (if unsound then "potential"
blanchet@33192
   578
                                                    else "genuine") ^
blanchet@33192
   579
                                   " component of scope."));
blanchet@33192
   580
                NONE)
blanchet@35280
   581
           | TOO_SMALL (_, msg) =>
blanchet@34124
   582
             (print_v (fn () => ("Limit reached: " ^ msg ^
blanchet@35185
   583
                                 ". Skipping " ^ (if unsound then "potential"
blanchet@34124
   584
                                                  else "genuine") ^
blanchet@34124
   585
                                 " component of scope."));
blanchet@34124
   586
              NONE)
blanchet@33192
   587
blanchet@34982
   588
    val das_wort_model =
blanchet@34982
   589
      (if falsify then "counterexample" else "model")
blanchet@34982
   590
      |> not standard ? prefix "nonstandard "
blanchet@33192
   591
blanchet@33192
   592
    val scopes = Unsynchronized.ref []
blanchet@33192
   593
    val generated_scopes = Unsynchronized.ref []
blanchet@35185
   594
    val generated_problems = Unsynchronized.ref ([] : rich_problem list)
blanchet@33192
   595
    val checked_problems = Unsynchronized.ref (SOME [])
blanchet@33192
   596
    val met_potential = Unsynchronized.ref 0
blanchet@33192
   597
blanchet@33192
   598
    (* rich_problem list -> int list -> unit *)
blanchet@33192
   599
    fun update_checked_problems problems =
blanchet@33192
   600
      List.app (Unsynchronized.change checked_problems o Option.map o cons
blanchet@33192
   601
                o nth problems)
blanchet@35333
   602
    (* string -> unit *)
blanchet@35333
   603
    fun show_kodkod_warning "" = ()
blanchet@35334
   604
      | show_kodkod_warning s = print_m (fn () => "Kodkod warning: " ^ s ^ ".")
blanchet@33192
   605
blanchet@34126
   606
    (* bool -> KK.raw_bound list -> problem_extension -> bool option *)
blanchet@33192
   607
    fun print_and_check_model genuine bounds
blanchet@33192
   608
            ({free_names, sel_names, nonsel_names, rel_table, scope, ...}
blanchet@33192
   609
             : problem_extension) =
blanchet@33192
   610
      let
blanchet@33192
   611
        val (reconstructed_model, codatatypes_ok) =
blanchet@33192
   612
          reconstruct_hol_model {show_skolems = show_skolems,
blanchet@33192
   613
                                 show_datatypes = show_datatypes,
blanchet@33192
   614
                                 show_consts = show_consts}
blanchet@33192
   615
              scope formats frees free_names sel_names nonsel_names rel_table
blanchet@33192
   616
              bounds
blanchet@34982
   617
        val genuine_means_genuine = genuine_means_genuine andalso codatatypes_ok
blanchet@33192
   618
      in
blanchet@33192
   619
        pprint (Pretty.chunks
blanchet@33192
   620
            [Pretty.blk (0,
blanchet@33192
   621
                 (pstrs ("Nitpick found a" ^
blanchet@33192
   622
                         (if not genuine then " potential "
blanchet@34982
   623
                          else if genuine_means_genuine then " "
blanchet@34982
   624
                          else " likely genuine ") ^ das_wort_model) @
blanchet@33192
   625
                  (case pretties_for_scope scope verbose of
blanchet@33192
   626
                     [] => []
blanchet@33192
   627
                   | pretties => pstrs " for " @ pretties) @
blanchet@33192
   628
                  [Pretty.str ":\n"])),
blanchet@33192
   629
             Pretty.indent indent_size reconstructed_model]);
blanchet@33192
   630
        if genuine then
blanchet@34982
   631
          (if check_genuine andalso standard then
blanchet@33192
   632
             (case prove_hol_model scope tac_timeout free_names sel_names
blanchet@33192
   633
                                   rel_table bounds assms_t of
blanchet@33192
   634
                SOME true => print ("Confirmation by \"auto\": The above " ^
blanchet@34982
   635
                                    das_wort_model ^ " is really genuine.")
blanchet@33192
   636
              | SOME false =>
blanchet@34982
   637
                if genuine_means_genuine then
blanchet@34982
   638
                  error ("A supposedly genuine " ^ das_wort_model ^ " was \
blanchet@34982
   639
                         \shown to be spurious by \"auto\".\nThis should never \
blanchet@34982
   640
                         \happen.\nPlease send a bug report to blanchet\
blanchet@33192
   641
                         \te@in.tum.de.")
blanchet@33192
   642
                else
blanchet@34982
   643
                  print ("Refutation by \"auto\": The above " ^ das_wort_model ^
blanchet@33192
   644
                         " is spurious.")
blanchet@33192
   645
              | NONE => print "No confirmation by \"auto\".")
blanchet@33192
   646
           else
blanchet@33192
   647
             ();
blanchet@35183
   648
           if not standard andalso likely_in_struct_induct_step then
blanchet@34982
   649
             print "The existence of a nonstandard model suggests that the \
blanchet@34982
   650
                   \induction hypothesis is not general enough or perhaps even \
blanchet@34982
   651
                   \wrong. See the \"Inductive Properties\" section of the \
blanchet@34982
   652
                   \Nitpick manual for details (\"isabelle doc nitpick\")."
blanchet@34982
   653
           else
blanchet@34982
   654
             ();
blanchet@34038
   655
           if has_syntactic_sorts orig_t then
blanchet@33192
   656
             print "Hint: Maybe you forgot a type constraint?"
blanchet@33192
   657
           else
blanchet@33192
   658
             ();
blanchet@34982
   659
           if not genuine_means_genuine then
blanchet@33192
   660
             if no_poly_user_axioms then
blanchet@33192
   661
               let
blanchet@33192
   662
                 val options =
blanchet@33192
   663
                   [] |> not got_all_mono_user_axioms
blanchet@33192
   664
                         ? cons ("user_axioms", "\"true\"")
blanchet@33192
   665
                      |> not (none_true wfs)
blanchet@33192
   666
                         ? cons ("wf", "\"smart\" or \"false\"")
blanchet@35665
   667
                      |> not sound_finitizes
blanchet@35665
   668
                         ? cons ("finitize", "\"smart\" or \"false\"")
blanchet@33192
   669
                      |> not codatatypes_ok
blanchet@33192
   670
                         ? cons ("bisim_depth", "a nonnegative value")
blanchet@33192
   671
                 val ss =
blanchet@33192
   672
                   map (fn (name, value) => quote name ^ " set to " ^ value)
blanchet@33192
   673
                       options
blanchet@33192
   674
               in
blanchet@33192
   675
                 print ("Try again with " ^
blanchet@33192
   676
                        space_implode " " (serial_commas "and" ss) ^
blanchet@34982
   677
                        " to confirm that the " ^ das_wort_model ^
blanchet@34982
   678
                        " is genuine.")
blanchet@33192
   679
               end
blanchet@33192
   680
             else
blanchet@33192
   681
               print ("Nitpick is unable to guarantee the authenticity of \
blanchet@34982
   682
                      \the " ^ das_wort_model ^ " in the presence of \
blanchet@34982
   683
                      \polymorphic axioms.")
blanchet@33192
   684
           else
blanchet@33192
   685
             ();
blanchet@33192
   686
           NONE)
blanchet@33192
   687
        else
blanchet@33192
   688
          if not genuine then
blanchet@33192
   689
            (Unsynchronized.inc met_potential;
blanchet@33192
   690
             if check_potential then
blanchet@33192
   691
               let
blanchet@33192
   692
                 val status = prove_hol_model scope tac_timeout free_names
blanchet@33192
   693
                                              sel_names rel_table bounds assms_t
blanchet@33192
   694
               in
blanchet@33192
   695
                 (case status of
blanchet@33192
   696
                    SOME true => print ("Confirmation by \"auto\": The above " ^
blanchet@34982
   697
                                        das_wort_model ^ " is genuine.")
blanchet@33192
   698
                  | SOME false => print ("Refutation by \"auto\": The above " ^
blanchet@34982
   699
                                         das_wort_model ^ " is spurious.")
blanchet@33192
   700
                  | NONE => print "No confirmation by \"auto\".");
blanchet@33192
   701
                 status
blanchet@33192
   702
               end
blanchet@33192
   703
             else
blanchet@33192
   704
               NONE)
blanchet@33192
   705
          else
blanchet@33192
   706
            NONE
blanchet@33192
   707
      end
blanchet@33192
   708
    (* int -> int -> int -> bool -> rich_problem list -> int * int * int *)
blanchet@33192
   709
    fun solve_any_problem max_potential max_genuine donno first_time problems =
blanchet@33192
   710
      let
blanchet@33192
   711
        val max_potential = Int.max (0, max_potential)
blanchet@33192
   712
        val max_genuine = Int.max (0, max_genuine)
blanchet@34126
   713
        (* bool -> int * KK.raw_bound list -> bool option *)
blanchet@33192
   714
        fun print_and_check genuine (j, bounds) =
blanchet@33192
   715
          print_and_check_model genuine bounds (snd (nth problems j))
blanchet@33192
   716
        val max_solutions = max_potential + max_genuine
blanchet@33192
   717
                            |> not need_incremental ? curry Int.min 1
blanchet@33192
   718
      in
blanchet@33192
   719
        if max_solutions <= 0 then
blanchet@33192
   720
          (0, 0, donno)
blanchet@33192
   721
        else
blanchet@34126
   722
          case KK.solve_any_problem overlord deadline max_threads max_solutions
blanchet@34126
   723
                                    (map fst problems) of
blanchet@34126
   724
            KK.NotInstalled =>
blanchet@33568
   725
            (print_m install_kodkodi_message;
blanchet@33233
   726
             (max_potential, max_genuine, donno + 1))
blanchet@35333
   727
          | KK.Normal ([], unsat_js, s) =>
blanchet@35333
   728
            (update_checked_problems problems unsat_js; show_kodkod_warning s;
blanchet@33192
   729
             (max_potential, max_genuine, donno))
blanchet@35333
   730
          | KK.Normal (sat_ps, unsat_js, s) =>
blanchet@33192
   731
            let
blanchet@33192
   732
              val (lib_ps, con_ps) =
blanchet@35185
   733
                List.partition (#unsound o snd o nth problems o fst) sat_ps
blanchet@33192
   734
            in
blanchet@33192
   735
              update_checked_problems problems (unsat_js @ map fst lib_ps);
blanchet@35333
   736
              show_kodkod_warning s;
blanchet@33192
   737
              if null con_ps then
blanchet@33192
   738
                let
haftmann@33955
   739
                  val num_genuine = take max_potential lib_ps
blanchet@33192
   740
                                    |> map (print_and_check false)
blanchet@34121
   741
                                    |> filter (curry (op =) (SOME true))
blanchet@34121
   742
                                    |> length
blanchet@33192
   743
                  val max_genuine = max_genuine - num_genuine
blanchet@33192
   744
                  val max_potential = max_potential
blanchet@33192
   745
                                      - (length lib_ps - num_genuine)
blanchet@33192
   746
                in
blanchet@33192
   747
                  if max_genuine <= 0 then
blanchet@33192
   748
                    (0, 0, donno)
blanchet@33192
   749
                  else
blanchet@33192
   750
                    let
blanchet@35185
   751
                      (* "co_js" is the list of sound problems whose unsound
blanchet@35185
   752
                         pendants couldn't be satisfied and hence that most
blanchet@35185
   753
                         probably can't be satisfied themselves. *)
blanchet@33192
   754
                      val co_js =
blanchet@33192
   755
                        map (fn j => j - 1) unsat_js
blanchet@33192
   756
                        |> filter (fn j =>
blanchet@33192
   757
                                      j >= 0 andalso
blanchet@33192
   758
                                      scopes_equivalent
blanchet@33192
   759
                                          (#scope (snd (nth problems j)))
blanchet@33192
   760
                                          (#scope (snd (nth problems (j + 1)))))
blanchet@33192
   761
                      val bye_js = sort_distinct int_ord (map fst sat_ps @
blanchet@33192
   762
                                                          unsat_js @ co_js)
blanchet@33192
   763
                      val problems =
blanchet@33192
   764
                        problems |> filter_out_indices bye_js
blanchet@33192
   765
                                 |> max_potential <= 0
blanchet@35185
   766
                                    ? filter_out (#unsound o snd)
blanchet@33192
   767
                    in
blanchet@33192
   768
                      solve_any_problem max_potential max_genuine donno false
blanchet@33192
   769
                                        problems
blanchet@33192
   770
                    end
blanchet@33192
   771
                end
blanchet@33192
   772
              else
blanchet@33192
   773
                let
haftmann@33955
   774
                  val _ = take max_genuine con_ps
blanchet@33192
   775
                          |> List.app (ignore o print_and_check true)
blanchet@33192
   776
                  val max_genuine = max_genuine - length con_ps
blanchet@33192
   777
                in
blanchet@33192
   778
                  if max_genuine <= 0 orelse not first_time then
blanchet@33192
   779
                    (0, max_genuine, donno)
blanchet@33192
   780
                  else
blanchet@33192
   781
                    let
blanchet@33192
   782
                      val bye_js = sort_distinct int_ord
blanchet@33192
   783
                                                 (map fst sat_ps @ unsat_js)
blanchet@33192
   784
                      val problems =
blanchet@33192
   785
                        problems |> filter_out_indices bye_js
blanchet@35185
   786
                                 |> filter_out (#unsound o snd)
blanchet@33192
   787
                    in solve_any_problem 0 max_genuine donno false problems end
blanchet@33192
   788
                end
blanchet@33192
   789
            end
blanchet@34126
   790
          | KK.TimedOut unsat_js =>
blanchet@33192
   791
            (update_checked_problems problems unsat_js; raise TimeLimit.TimeOut)
blanchet@34126
   792
          | KK.Interrupted NONE => (checked_problems := NONE; do_interrupted ())
blanchet@34126
   793
          | KK.Interrupted (SOME unsat_js) =>
blanchet@33192
   794
            (update_checked_problems problems unsat_js; do_interrupted ())
blanchet@34126
   795
          | KK.Error (s, unsat_js) =>
blanchet@33192
   796
            (update_checked_problems problems unsat_js;
blanchet@33192
   797
             print_v (K ("Kodkod error: " ^ s ^ "."));
blanchet@33192
   798
             (max_potential, max_genuine, donno + 1))
blanchet@33192
   799
      end
blanchet@33192
   800
blanchet@33192
   801
    (* int -> int -> scope list -> int * int * int -> int * int * int *)
blanchet@33192
   802
    fun run_batch j n scopes (max_potential, max_genuine, donno) =
blanchet@33192
   803
      let
blanchet@33192
   804
        val _ =
blanchet@33192
   805
          if null scopes then
blanchet@33192
   806
            print_m (K "The scope specification is inconsistent.")
blanchet@33192
   807
          else if verbose then
blanchet@33192
   808
            pprint (Pretty.chunks
blanchet@33192
   809
                [Pretty.blk (0,
blanchet@33192
   810
                     pstrs ((if n > 1 then
blanchet@33192
   811
                               "Batch " ^ string_of_int (j + 1) ^ " of " ^
blanchet@33192
   812
                               signed_string_of_int n ^ ": "
blanchet@33192
   813
                             else
blanchet@33192
   814
                               "") ^
blanchet@33192
   815
                            "Trying " ^ string_of_int (length scopes) ^
blanchet@33192
   816
                            " scope" ^ plural_s_for_list scopes ^ ":")),
blanchet@33192
   817
                 Pretty.indent indent_size
blanchet@33192
   818
                     (Pretty.chunks (map2
blanchet@33192
   819
                          (fn j => fn scope =>
blanchet@33192
   820
                              Pretty.block (
blanchet@33192
   821
                                  (case pretties_for_scope scope true of
blanchet@33192
   822
                                     [] => [Pretty.str "Empty"]
blanchet@33192
   823
                                   | pretties => pretties) @
blanchet@33192
   824
                                  [Pretty.str (if j = 1 then "." else ";")]))
blanchet@33192
   825
                          (length scopes downto 1) scopes))])
blanchet@33192
   826
          else
blanchet@33192
   827
            ()
blanchet@33192
   828
        (* scope * bool -> rich_problem list * bool
blanchet@33192
   829
           -> rich_problem list * bool *)
blanchet@35280
   830
        fun add_problem_for_scope (scope, unsound) (problems, donno) =
blanchet@33192
   831
          (check_deadline ();
blanchet@35185
   832
           case problem_for_scope unsound scope of
blanchet@33192
   833
             SOME problem =>
blanchet@33192
   834
             (problems
blanchet@33192
   835
              |> (null problems orelse
blanchet@34126
   836
                  not (KK.problems_equivalent (fst problem)
blanchet@34126
   837
                                              (fst (hd problems))))
blanchet@33192
   838
                  ? cons problem, donno)
blanchet@33192
   839
           | NONE => (problems, donno + 1))
blanchet@33192
   840
        val (problems, donno) =
blanchet@33192
   841
          fold add_problem_for_scope
blanchet@33192
   842
               (map_product pair scopes
blanchet@33192
   843
                    ((if max_genuine > 0 then [false] else []) @
blanchet@33192
   844
                     (if max_potential > 0 then [true] else [])))
blanchet@33192
   845
               ([], donno)
blanchet@33192
   846
        val _ = Unsynchronized.change generated_problems (append problems)
blanchet@33192
   847
        val _ = Unsynchronized.change generated_scopes (append scopes)
blanchet@35185
   848
        val _ =
blanchet@35185
   849
          if j + 1 = n then
blanchet@35185
   850
            let
blanchet@35185
   851
              val (unsound_problems, sound_problems) =
blanchet@35185
   852
                List.partition (#unsound o snd) (!generated_problems)
blanchet@35185
   853
            in
blanchet@35185
   854
              if not (null sound_problems) andalso
blanchet@35185
   855
                 forall (KK.is_problem_trivially_false o fst)
blanchet@35185
   856
                        sound_problems then
blanchet@35185
   857
                print_m (fn () =>
blanchet@35220
   858
                    "Warning: The conjecture either trivially holds for the \
blanchet@35384
   859
                    \given scopes or lies outside Nitpick's supported \
blanchet@35384
   860
                    \fragment." ^
blanchet@35185
   861
                    (if exists (not o KK.is_problem_trivially_false o fst)
blanchet@35185
   862
                               unsound_problems then
blanchet@35185
   863
                       " Only potential counterexamples may be found."
blanchet@35185
   864
                     else
blanchet@35185
   865
                       ""))
blanchet@35185
   866
              else
blanchet@35185
   867
                ()
blanchet@35185
   868
            end
blanchet@35185
   869
          else
blanchet@35185
   870
            ()
blanchet@33192
   871
      in
blanchet@33192
   872
        solve_any_problem max_potential max_genuine donno true (rev problems)
blanchet@33192
   873
      end
blanchet@33192
   874
blanchet@33192
   875
    (* rich_problem list -> scope -> int *)
blanchet@33192
   876
    fun scope_count (problems : rich_problem list) scope =
blanchet@33192
   877
      length (filter (scopes_equivalent scope o #scope o snd) problems)
blanchet@33192
   878
    (* string -> string *)
blanchet@33192
   879
    fun excipit did_so_and_so =
blanchet@33192
   880
      let
blanchet@33192
   881
        (* rich_problem list -> rich_problem list *)
blanchet@33192
   882
        val do_filter =
blanchet@35185
   883
          if !met_potential = max_potential then filter_out (#unsound o snd)
blanchet@33192
   884
          else I
blanchet@33192
   885
        val total = length (!scopes)
blanchet@33192
   886
        val unsat =
blanchet@33192
   887
          fold (fn scope =>
blanchet@33192
   888
                   case scope_count (do_filter (!generated_problems)) scope of
blanchet@33192
   889
                     0 => I
blanchet@33192
   890
                   | n =>
blanchet@33556
   891
                     scope_count (do_filter (these (!checked_problems)))
blanchet@33556
   892
                                 scope = n
blanchet@33556
   893
                     ? Integer.add 1) (!generated_scopes) 0
blanchet@33192
   894
      in
blanchet@33192
   895
        "Nitpick " ^ did_so_and_so ^
blanchet@33192
   896
        (if is_some (!checked_problems) andalso total > 0 then
blanchet@33192
   897
           " after checking " ^
blanchet@33192
   898
           string_of_int (Int.min (total - 1, unsat)) ^ " of " ^
blanchet@33192
   899
           string_of_int total ^ " scope" ^ plural_s total
blanchet@33192
   900
         else
blanchet@33192
   901
           "") ^ "."
blanchet@33192
   902
      end
blanchet@33192
   903
blanchet@34126
   904
    (* int -> int -> scope list -> int * int * int -> KK.outcome *)
blanchet@33192
   905
    fun run_batches _ _ [] (max_potential, max_genuine, donno) =
blanchet@33192
   906
        if donno > 0 andalso max_genuine > 0 then
blanchet@34124
   907
          (print_m (fn () => excipit "ran out of some resource"); "unknown")
blanchet@33192
   908
        else if max_genuine = original_max_genuine then
blanchet@33192
   909
          if max_potential = original_max_potential then
blanchet@34982
   910
            (print_m (fn () =>
blanchet@34982
   911
                 "Nitpick found no " ^ das_wort_model ^ "." ^
blanchet@35183
   912
                 (if not standard andalso likely_in_struct_induct_step then
blanchet@34982
   913
                    " This suggests that the induction hypothesis might be \
blanchet@34982
   914
                    \general enough to prove this subgoal."
blanchet@34982
   915
                  else
blanchet@34982
   916
                    "")); "none")
blanchet@33192
   917
          else
blanchet@34982
   918
            (print_m (fn () =>
blanchet@34982
   919
                 "Nitpick could not find a" ^
blanchet@34982
   920
                 (if max_genuine = 1 then " better " ^ das_wort_model ^ "."
blanchet@34982
   921
                  else "ny better " ^ das_wort_model ^ "s.")); "potential")
blanchet@33192
   922
        else
blanchet@34982
   923
          if genuine_means_genuine then "genuine" else "likely_genuine"
blanchet@33192
   924
      | run_batches j n (batch :: batches) z =
blanchet@33192
   925
        let val (z as (_, max_genuine, _)) = run_batch j n batch z in
blanchet@33192
   926
          run_batches (j + 1) n (if max_genuine > 0 then batches else []) z
blanchet@33192
   927
        end
blanchet@33192
   928
blanchet@33580
   929
    val (skipped, the_scopes) =
blanchet@35190
   930
      all_scopes hol_ctxt binarize sym_break cards_assigns maxes_assigns
blanchet@35190
   931
                 iters_assigns bitss bisim_depths mono_Ts nonmono_Ts deep_dataTs
blanchet@35385
   932
                 finitizable_dataTs
blanchet@33580
   933
    val _ = if skipped > 0 then
blanchet@34124
   934
              print_m (fn () => "Too many scopes. Skipping " ^
blanchet@33580
   935
                                string_of_int skipped ^ " scope" ^
blanchet@33580
   936
                                plural_s skipped ^
blanchet@33580
   937
                                ". (Consider using \"mono\" or \
blanchet@33580
   938
                                \\"merge_type_vars\" to prevent this.)")
blanchet@33580
   939
            else
blanchet@33580
   940
              ()
blanchet@33580
   941
    val _ = scopes := the_scopes
blanchet@33580
   942
blanchet@33192
   943
    val batches = batch_list batch_size (!scopes)
blanchet@33192
   944
    val outcome_code =
blanchet@33192
   945
      (run_batches 0 (length batches) batches (max_potential, max_genuine, 0)
blanchet@33192
   946
       handle Exn.Interrupt => do_interrupted ())
blanchet@33192
   947
      handle TimeLimit.TimeOut =>
blanchet@33192
   948
             (print_m (fn () => excipit "ran out of time");
blanchet@33192
   949
              if !met_potential > 0 then "potential" else "unknown")
blanchet@33192
   950
           | Exn.Interrupt => if auto orelse debug then raise Interrupt
blanchet@33192
   951
                              else error (excipit "was interrupted")
blanchet@33192
   952
    val _ = print_v (fn () => "Total time: " ^
blanchet@33192
   953
                              signed_string_of_int (Time.toMilliseconds
blanchet@33192
   954
                                    (Timer.checkRealTimer timer)) ^ " ms.")
blanchet@33192
   955
  in (outcome_code, !state_ref) end
blanchet@33192
   956
  handle Exn.Interrupt =>
blanchet@33192
   957
         if auto orelse #debug params then
blanchet@33192
   958
           raise Interrupt
blanchet@33192
   959
         else
blanchet@33192
   960
           if passed_deadline deadline then
blanchet@33192
   961
             (priority "Nitpick ran out of time."; ("unknown", state))
blanchet@33192
   962
           else
blanchet@33192
   963
             error "Nitpick was interrupted."
blanchet@33192
   964
blanchet@35335
   965
(* Proof.state -> params -> bool -> int -> int -> int -> (term * term) list
blanchet@35335
   966
   -> term list -> term -> string * Proof.state *)
blanchet@34982
   967
fun pick_nits_in_term state (params as {debug, timeout, expect, ...}) auto i n
blanchet@35335
   968
                      step subst orig_assm_ts orig_t =
blanchet@33568
   969
  if getenv "KODKODI" = "" then
blanchet@33568
   970
    (if auto then ()
blanchet@33568
   971
     else warning (Pretty.string_of (plazy install_kodkodi_message));
blanchet@33568
   972
     ("unknown", state))
blanchet@33568
   973
  else
blanchet@33568
   974
    let
blanchet@33568
   975
      val deadline = Option.map (curry Time.+ (Time.now ())) timeout
blanchet@33568
   976
      val outcome as (outcome_code, _) =
blanchet@33568
   977
        time_limit (if debug then NONE else timeout)
blanchet@35335
   978
            (pick_them_nits_in_term deadline state params auto i n step subst
blanchet@34982
   979
                                    orig_assm_ts) orig_t
blanchet@33568
   980
    in
blanchet@33568
   981
      if expect = "" orelse outcome_code = expect then outcome
blanchet@33568
   982
      else error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
blanchet@33568
   983
    end
blanchet@33192
   984
blanchet@35335
   985
(* string list -> term -> bool *)
blanchet@35335
   986
fun is_fixed_equation fixes
blanchet@35335
   987
                      (Const (@{const_name "=="}, _) $ Free (s, _) $ Const _) =
blanchet@35335
   988
    member (op =) fixes s
blanchet@35335
   989
  | is_fixed_equation _ _ = false
blanchet@35335
   990
(* Proof.context -> term list * term -> (term * term) list * term list * term *)
blanchet@35335
   991
fun extract_fixed_frees ctxt (assms, t) =
blanchet@35335
   992
  let
blanchet@35335
   993
    val fixes = Variable.fixes_of ctxt |> map snd
blanchet@35335
   994
    val (subst, other_assms) =
blanchet@35335
   995
      List.partition (is_fixed_equation fixes) assms
blanchet@35335
   996
      |>> map Logic.dest_equals
blanchet@35335
   997
  in (subst, other_assms, subst_atomic subst t) end
blanchet@35335
   998
blanchet@34982
   999
(* Proof.state -> params -> bool -> int -> int -> string * Proof.state *)
blanchet@34982
  1000
fun pick_nits_in_subgoal state params auto i step =
blanchet@33192
  1001
  let
blanchet@33192
  1002
    val ctxt = Proof.context_of state
wenzelm@33292
  1003
    val t = state |> Proof.raw_goal |> #goal |> prop_of
blanchet@33192
  1004
  in
blanchet@34982
  1005
    case Logic.count_prems t of
blanchet@34982
  1006
      0 => (priority "No subgoal!"; ("none", state))
blanchet@34982
  1007
    | n =>
blanchet@33192
  1008
      let
blanchet@35335
  1009
        val (t, frees) = Logic.goal_params t i
blanchet@35335
  1010
        val t = subst_bounds (frees, t)
blanchet@33192
  1011
        val assms = map term_of (Assumption.all_assms_of ctxt)
blanchet@35335
  1012
        val (subst, assms, t) = extract_fixed_frees ctxt (assms, t)
blanchet@35335
  1013
      in pick_nits_in_term state params auto i n step subst assms t end
blanchet@33192
  1014
  end
blanchet@33192
  1015
blanchet@33192
  1016
end;