src/HOL/Tools/Nitpick/nitpick.ML
author wenzelm
Sat Jul 13 13:25:42 2013 +0200 (2013-07-13 ago)
changeset 52643 34c29356930e
parent 52202 d5c80b12a1f2
child 52644 cea207576f81
permissions -rw-r--r--
more explicit Markup.information for messages produced by "auto" tools;
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@35711
    11
  type term_postprocessor = Nitpick_Model.term_postprocessor
blanchet@43022
    12
blanchet@47560
    13
  datatype mode = Auto_Try | Try | Normal | TPTP
blanchet@43022
    14
blanchet@36390
    15
  type params =
blanchet@36390
    16
    {cards_assigns: (typ option * int list) list,
blanchet@36390
    17
     maxes_assigns: (styp option * int list) list,
blanchet@36390
    18
     iters_assigns: (styp option * int list) list,
blanchet@36390
    19
     bitss: int list,
blanchet@36390
    20
     bisim_depths: int list,
blanchet@36390
    21
     boxes: (typ option * bool option) list,
blanchet@36390
    22
     finitizes: (typ option * bool option) list,
blanchet@36390
    23
     monos: (typ option * bool option) list,
blanchet@36390
    24
     stds: (typ option * bool) list,
blanchet@36390
    25
     wfs: (styp option * bool option) list,
blanchet@36390
    26
     sat_solver: string,
blanchet@36390
    27
     blocking: bool,
blanchet@36390
    28
     falsify: bool,
blanchet@36390
    29
     debug: bool,
blanchet@36390
    30
     verbose: bool,
blanchet@36390
    31
     overlord: bool,
blanchet@36390
    32
     user_axioms: bool option,
blanchet@36390
    33
     assms: bool,
blanchet@38209
    34
     whacks: term list,
blanchet@36390
    35
     merge_type_vars: bool,
blanchet@36390
    36
     binary_ints: bool option,
blanchet@36390
    37
     destroy_constrs: bool,
blanchet@36390
    38
     specialize: bool,
blanchet@36390
    39
     star_linear_preds: bool,
blanchet@41856
    40
     total_consts: bool option,
blanchet@41876
    41
     needs: term list option,
blanchet@36390
    42
     peephole_optim: bool,
blanchet@38124
    43
     datatype_sym_break: int,
blanchet@38124
    44
     kodkod_sym_break: int,
blanchet@36390
    45
     timeout: Time.time option,
blanchet@36390
    46
     tac_timeout: Time.time option,
blanchet@36390
    47
     max_threads: int,
blanchet@36390
    48
     show_datatypes: bool,
blanchet@41993
    49
     show_skolems: bool,
blanchet@36390
    50
     show_consts: bool,
blanchet@36390
    51
     evals: term list,
blanchet@36390
    52
     formats: (term option * int list) list,
blanchet@37260
    53
     atomss: (typ option * string list) list,
blanchet@36390
    54
     max_potential: int,
blanchet@36390
    55
     max_genuine: int,
blanchet@36390
    56
     check_potential: bool,
blanchet@36390
    57
     check_genuine: bool,
blanchet@36390
    58
     batch_size: int,
blanchet@36390
    59
     expect: string}
blanchet@33192
    60
blanchet@43020
    61
  val genuineN : string
blanchet@43020
    62
  val quasi_genuineN : string
blanchet@43020
    63
  val potentialN : string
blanchet@43020
    64
  val noneN : string
blanchet@43020
    65
  val unknownN : string
blanchet@33192
    66
  val register_frac_type : string -> (string * string) list -> theory -> theory
blanchet@33192
    67
  val unregister_frac_type : string -> theory -> theory
blanchet@33192
    68
  val register_codatatype : typ -> string -> styp list -> theory -> theory
blanchet@33192
    69
  val unregister_codatatype : typ -> theory -> theory
blanchet@35711
    70
  val register_term_postprocessor :
blanchet@35711
    71
    typ -> term_postprocessor -> theory -> theory
blanchet@35711
    72
  val unregister_term_postprocessor : typ -> theory -> theory
blanchet@33192
    73
  val pick_nits_in_term :
blanchet@43022
    74
    Proof.state -> params -> mode -> int -> int -> int -> (term * term) list
blanchet@47715
    75
    -> term list -> term list -> term -> string * Proof.state
blanchet@33192
    76
  val pick_nits_in_subgoal :
blanchet@43022
    77
    Proof.state -> params -> mode -> int -> int -> string * Proof.state
blanchet@33192
    78
end;
blanchet@33192
    79
blanchet@33192
    80
structure Nitpick : NITPICK =
blanchet@33192
    81
struct
blanchet@33192
    82
blanchet@33232
    83
open Nitpick_Util
blanchet@33232
    84
open Nitpick_HOL
blanchet@35070
    85
open Nitpick_Preproc
blanchet@33232
    86
open Nitpick_Mono
blanchet@33232
    87
open Nitpick_Scope
blanchet@33232
    88
open Nitpick_Peephole
blanchet@33232
    89
open Nitpick_Rep
blanchet@33232
    90
open Nitpick_Nut
blanchet@33232
    91
open Nitpick_Kodkod
blanchet@33232
    92
open Nitpick_Model
blanchet@33192
    93
blanchet@34126
    94
structure KK = Kodkod
blanchet@34126
    95
blanchet@47560
    96
datatype mode = Auto_Try | Try | Normal | TPTP
blanchet@47560
    97
blanchet@47560
    98
fun is_mode_nt mode = (mode = Normal orelse mode = TPTP)
blanchet@43022
    99
blanchet@36390
   100
type params =
blanchet@36390
   101
  {cards_assigns: (typ option * int list) list,
blanchet@36390
   102
   maxes_assigns: (styp option * int list) list,
blanchet@36390
   103
   iters_assigns: (styp option * int list) list,
blanchet@36390
   104
   bitss: int list,
blanchet@36390
   105
   bisim_depths: int list,
blanchet@36390
   106
   boxes: (typ option * bool option) list,
blanchet@36390
   107
   finitizes: (typ option * bool option) list,
blanchet@36390
   108
   monos: (typ option * bool option) list,
blanchet@36390
   109
   stds: (typ option * bool) list,
blanchet@36390
   110
   wfs: (styp option * bool option) list,
blanchet@36390
   111
   sat_solver: string,
blanchet@36390
   112
   blocking: bool,
blanchet@36390
   113
   falsify: bool,
blanchet@36390
   114
   debug: bool,
blanchet@36390
   115
   verbose: bool,
blanchet@36390
   116
   overlord: bool,
blanchet@36390
   117
   user_axioms: bool option,
blanchet@36390
   118
   assms: bool,
blanchet@38209
   119
   whacks: term list,
blanchet@36390
   120
   merge_type_vars: bool,
blanchet@36390
   121
   binary_ints: bool option,
blanchet@36390
   122
   destroy_constrs: bool,
blanchet@36390
   123
   specialize: bool,
blanchet@36390
   124
   star_linear_preds: bool,
blanchet@41856
   125
   total_consts: bool option,
blanchet@41876
   126
   needs: term list option,
blanchet@36390
   127
   peephole_optim: bool,
blanchet@38124
   128
   datatype_sym_break: int,
blanchet@38124
   129
   kodkod_sym_break: int,
blanchet@36390
   130
   timeout: Time.time option,
blanchet@36390
   131
   tac_timeout: Time.time option,
blanchet@36390
   132
   max_threads: int,
blanchet@36390
   133
   show_datatypes: bool,
blanchet@41993
   134
   show_skolems: bool,
blanchet@36390
   135
   show_consts: bool,
blanchet@36390
   136
   evals: term list,
blanchet@36390
   137
   formats: (term option * int list) list,
blanchet@37260
   138
   atomss: (typ option * string list) list,
blanchet@36390
   139
   max_potential: int,
blanchet@36390
   140
   max_genuine: int,
blanchet@36390
   141
   check_potential: bool,
blanchet@36390
   142
   check_genuine: bool,
blanchet@36390
   143
   batch_size: int,
blanchet@36390
   144
   expect: string}
blanchet@33192
   145
blanchet@43020
   146
val genuineN = "genuine"
blanchet@43020
   147
val quasi_genuineN = "quasi_genuine"
blanchet@43020
   148
val potentialN = "potential"
blanchet@43020
   149
val noneN = "none"
blanchet@43020
   150
val unknownN = "unknown"
blanchet@43020
   151
blanchet@38240
   152
(* TODO: eliminate these historical aliases *)
blanchet@38240
   153
val register_frac_type = Nitpick_HOL.register_frac_type_global
blanchet@38240
   154
val unregister_frac_type = Nitpick_HOL.unregister_frac_type_global
blanchet@38240
   155
val register_codatatype = Nitpick_HOL.register_codatatype_global
blanchet@38240
   156
val unregister_codatatype = Nitpick_HOL.unregister_codatatype_global
blanchet@38240
   157
val register_term_postprocessor =
blanchet@38240
   158
  Nitpick_Model.register_term_postprocessor_global
blanchet@38240
   159
val unregister_term_postprocessor =
blanchet@38240
   160
  Nitpick_Model.unregister_term_postprocessor_global
blanchet@38240
   161
blanchet@36390
   162
type problem_extension =
blanchet@36390
   163
  {free_names: nut list,
blanchet@36390
   164
   sel_names: nut list,
blanchet@36390
   165
   nonsel_names: nut list,
blanchet@36390
   166
   rel_table: nut NameTable.table,
blanchet@36390
   167
   unsound: bool,
blanchet@36390
   168
   scope: scope}
blanchet@39316
   169
blanchet@34126
   170
type rich_problem = KK.problem * problem_extension
blanchet@33192
   171
blanchet@33192
   172
fun pretties_for_formulas _ _ [] = []
blanchet@33192
   173
  | pretties_for_formulas ctxt s ts =
blanchet@33192
   174
    [Pretty.str (s ^ plural_s_for_list ts ^ ":"),
blanchet@33192
   175
     Pretty.indent indent_size (Pretty.chunks
blanchet@33192
   176
         (map2 (fn j => fn t =>
blanchet@34121
   177
                   Pretty.block [t |> shorten_names_in_term
blanchet@33192
   178
                                   |> Syntax.pretty_term ctxt,
blanchet@33192
   179
                                 Pretty.str (if j = 1 then "." else ";")])
blanchet@33192
   180
               (length ts downto 1) ts))]
blanchet@33192
   181
blanchet@49024
   182
val isabelle_wrong_message =
blanchet@49024
   183
  "Something appears to be wrong with your Isabelle installation."
blanchet@49024
   184
fun java_not_found_message () =
blanchet@49024
   185
  "Java could not be launched. " ^ isabelle_wrong_message
blanchet@49024
   186
fun java_too_old_message () =
blanchet@49024
   187
  "The Java version is too old. " ^ isabelle_wrong_message
blanchet@49024
   188
fun kodkodi_not_installed_message () =
blanchet@50830
   189
  "Nitpick requires the external Java program Kodkodi."
blanchet@50830
   190
fun kodkodi_too_old_message () = "The installed Kodkodi version is too old."
blanchet@35185
   191
val max_unsound_delay_ms = 200
blanchet@35185
   192
val max_unsound_delay_percent = 2
blanchet@33192
   193
blanchet@35185
   194
fun unsound_delay_for_timeout NONE = max_unsound_delay_ms
blanchet@35185
   195
  | unsound_delay_for_timeout (SOME timeout) =
blanchet@35185
   196
    Int.max (0, Int.min (max_unsound_delay_ms,
blanchet@33192
   197
                         Time.toMilliseconds timeout
blanchet@35185
   198
                         * max_unsound_delay_percent div 100))
blanchet@33192
   199
blanchet@33192
   200
fun passed_deadline NONE = false
blanchet@33192
   201
  | passed_deadline (SOME time) = Time.compare (Time.now (), time) <> LESS
blanchet@33192
   202
blanchet@34123
   203
fun none_true assigns = forall (not_equal (SOME true) o snd) assigns
blanchet@33192
   204
blanchet@41048
   205
fun has_lonely_bool_var (@{const Pure.conjunction}
blanchet@41048
   206
                         $ (@{const Trueprop} $ Free _) $ _) = true
blanchet@41048
   207
  | has_lonely_bool_var _ = false
blanchet@41048
   208
blanchet@34038
   209
val syntactic_sorts =
haftmann@38857
   210
  @{sort "{default,zero,one,plus,minus,uminus,times,inverse,abs,sgn,ord,equal}"} @
huffman@47108
   211
  @{sort numeral}
blanchet@34038
   212
fun has_tfree_syntactic_sort (TFree (_, S as _ :: _)) =
blanchet@34038
   213
    subset (op =) (S, syntactic_sorts)
blanchet@34038
   214
  | has_tfree_syntactic_sort _ = false
blanchet@34038
   215
val has_syntactic_sorts = exists_type (exists_subtype has_tfree_syntactic_sort)
blanchet@33192
   216
blanchet@33568
   217
fun plazy f = Pretty.blk (0, pstrs (f ()))
blanchet@33568
   218
blanchet@43022
   219
fun pick_them_nits_in_term deadline state (params : params) mode i n step
blanchet@47715
   220
                           subst def_assm_ts nondef_assm_ts orig_t =
blanchet@33192
   221
  let
blanchet@33192
   222
    val timer = Timer.startRealTimer ()
blanchet@34935
   223
    val thy = Proof.theory_of state
blanchet@34935
   224
    val ctxt = Proof.context_of state
blanchet@35386
   225
(* FIXME: reintroduce code before new release:
blanchet@35386
   226
wenzelm@37216
   227
    val nitpick_thy = Thy_Info.get_theory "Nitpick"
blanchet@34936
   228
    val _ = Theory.subthy (nitpick_thy, thy) orelse
blanchet@34936
   229
            error "You must import the theory \"Nitpick\" to use Nitpick"
blanchet@34982
   230
*)
blanchet@34124
   231
    val {cards_assigns, maxes_assigns, iters_assigns, bitss, bisim_depths,
blanchet@35665
   232
         boxes, finitizes, monos, stds, wfs, sat_solver, falsify, debug,
blanchet@38209
   233
         verbose, overlord, user_axioms, assms, whacks, merge_type_vars,
blanchet@38209
   234
         binary_ints, destroy_constrs, specialize, star_linear_preds,
blanchet@41875
   235
         total_consts, needs, peephole_optim, datatype_sym_break,
blanchet@41856
   236
         kodkod_sym_break, tac_timeout, max_threads, show_datatypes,
blanchet@41993
   237
         show_skolems, show_consts, evals, formats, atomss, max_potential,
blanchet@41993
   238
         max_genuine, check_potential, check_genuine, batch_size, ...} = params
blanchet@33192
   239
    val state_ref = Unsynchronized.ref state
blanchet@46086
   240
    fun pprint print =
blanchet@43022
   241
      if mode = Auto_Try then
blanchet@33192
   242
        Unsynchronized.change state_ref o Proof.goal_message o K
wenzelm@52643
   243
        o Pretty.chunks o single
wenzelm@52643
   244
        o Pretty.mark Markup.information
blanchet@33192
   245
      else
blanchet@46086
   246
        print o Pretty.string_of
blanchet@47559
   247
    val pprint_a = pprint Output.urgent_message
blanchet@47560
   248
    fun pprint_nt f = () |> is_mode_nt mode ? pprint Output.urgent_message o f
blanchet@46086
   249
    fun pprint_v f = () |> verbose ? pprint Output.urgent_message o f
blanchet@46086
   250
    fun pprint_d f = () |> debug ? pprint tracing o f
blanchet@46086
   251
    val print = pprint Output.urgent_message o curry Pretty.blk 0 o pstrs
blanchet@47560
   252
    fun print_t f = () |> mode = TPTP ? print o f
blanchet@39345
   253
(*
blanchet@46086
   254
    val print_g = pprint tracing o Pretty.str
blanchet@39345
   255
*)
blanchet@47560
   256
    val print_nt = pprint_nt o K o plazy
blanchet@33568
   257
    val print_v = pprint_v o K o plazy
blanchet@33192
   258
blanchet@33192
   259
    fun check_deadline () =
blanchet@41051
   260
      if passed_deadline deadline then raise TimeLimit.TimeOut else ()
blanchet@33192
   261
blanchet@47715
   262
    val (def_assm_ts, nondef_assm_ts) =
blanchet@47715
   263
      if assms orelse mode <> Normal then (def_assm_ts, nondef_assm_ts)
blanchet@47715
   264
      else ([], [])
blanchet@34982
   265
    val _ =
blanchet@34982
   266
      if step = 0 then
blanchet@47560
   267
        print_nt (fn () => "Nitpicking formula...")
blanchet@34982
   268
      else
blanchet@47560
   269
        pprint_nt (fn () => Pretty.chunks (
blanchet@34982
   270
            pretties_for_formulas ctxt ("Nitpicking " ^
blanchet@34982
   271
                (if i <> 1 orelse n <> 1 then
blanchet@34982
   272
                   "subgoal " ^ string_of_int i ^ " of " ^ string_of_int n
blanchet@34982
   273
                 else
blanchet@47715
   274
                   "goal")) [Logic.list_implies (nondef_assm_ts, orig_t)]))
blanchet@41278
   275
    val _ = print_v (enclose "Timestamp: " "." o Date.fmt "%H:%M:%S"
blanchet@41278
   276
                     o Date.fromTimeLocal o Time.now)
blanchet@33192
   277
    val neg_t = if falsify then Logic.mk_implies (orig_t, @{prop False})
blanchet@33192
   278
                else orig_t
blanchet@47715
   279
    val conj_ts = neg_t :: def_assm_ts @ nondef_assm_ts @ evals @ these needs
blanchet@38169
   280
    val tfree_table =
blanchet@41869
   281
      if merge_type_vars then merged_type_var_table_for_terms thy conj_ts
blanchet@41869
   282
      else []
blanchet@41869
   283
    val merge_tfrees = merge_type_vars_in_term thy merge_type_vars tfree_table
blanchet@41869
   284
    val neg_t = neg_t |> merge_tfrees
blanchet@47715
   285
    val def_assm_ts = def_assm_ts |> map merge_tfrees
blanchet@47715
   286
    val nondef_assm_ts = nondef_assm_ts |> map merge_tfrees
blanchet@41869
   287
    val evals = evals |> map merge_tfrees
blanchet@41876
   288
    val needs = needs |> Option.map (map merge_tfrees)
blanchet@47715
   289
    val conj_ts = neg_t :: def_assm_ts @ nondef_assm_ts @ evals @ these needs
blanchet@33192
   290
    val original_max_potential = max_potential
blanchet@33192
   291
    val original_max_genuine = max_genuine
blanchet@33192
   292
    val max_bisim_depth = fold Integer.max bisim_depths ~1
blanchet@38240
   293
    val case_names = case_const_names ctxt stds
blanchet@47715
   294
    val defs = def_assm_ts @ all_defs_of thy subst
blanchet@42415
   295
    val nondefs = all_nondefs_of ctxt subst
blanchet@41791
   296
    val def_tables = const_def_tables ctxt subst defs
blanchet@42415
   297
    val nondef_table = const_nondef_table nondefs
blanchet@35335
   298
    val simp_table = Unsynchronized.ref (const_simp_table ctxt subst)
blanchet@35335
   299
    val psimp_table = const_psimp_table ctxt subst
blanchet@35807
   300
    val choice_spec_table = const_choice_spec_table ctxt subst
blanchet@42415
   301
    val nondefs =
blanchet@42415
   302
      nondefs |> filter_out (is_choice_spec_axiom thy choice_spec_table)
blanchet@41791
   303
    val intro_table = inductive_intro_table ctxt subst def_tables
blanchet@33192
   304
    val ground_thm_table = ground_theorem_table thy
blanchet@38240
   305
    val ersatz_table = ersatz_table ctxt
blanchet@41007
   306
    val hol_ctxt as {wf_cache, ...} =
blanchet@33192
   307
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   308
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@38209
   309
       whacks = whacks, binary_ints = binary_ints,
blanchet@38209
   310
       destroy_constrs = destroy_constrs, specialize = specialize,
blanchet@41871
   311
       star_linear_preds = star_linear_preds, total_consts = total_consts,
blanchet@41875
   312
       needs = needs, tac_timeout = tac_timeout, evals = evals,
blanchet@41871
   313
       case_names = case_names, def_tables = def_tables,
blanchet@42415
   314
       nondef_table = nondef_table, nondefs = nondefs, simp_table = simp_table,
blanchet@42415
   315
       psimp_table = psimp_table, choice_spec_table = choice_spec_table,
blanchet@42415
   316
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@42415
   317
       ersatz_table = ersatz_table, skolems = Unsynchronized.ref [],
blanchet@42415
   318
       special_funs = Unsynchronized.ref [],
blanchet@33580
   319
       unrolled_preds = Unsynchronized.ref [], wf_cache = Unsynchronized.ref [],
blanchet@33580
   320
       constr_cache = Unsynchronized.ref []}
blanchet@41789
   321
    val pseudo_frees = []
blanchet@41869
   322
    val real_frees = fold Term.add_frees conj_ts []
blanchet@41869
   323
    val _ = null (fold Term.add_tvars conj_ts []) orelse
blanchet@41869
   324
            error "Nitpick cannot handle goals with schematic type variables."
blanchet@41875
   325
    val (nondef_ts, def_ts, need_ts, got_all_mono_user_axioms,
blanchet@41803
   326
         no_poly_user_axioms, binarize) =
blanchet@47715
   327
      preprocess_formulas hol_ctxt nondef_assm_ts neg_t
blanchet@33192
   328
    val got_all_user_axioms =
blanchet@33192
   329
      got_all_mono_user_axioms andalso no_poly_user_axioms
blanchet@33192
   330
blanchet@33192
   331
    fun print_wf (x, (gfp, wf)) =
blanchet@47560
   332
      pprint_nt (fn () => Pretty.blk (0,
blanchet@33192
   333
          pstrs ("The " ^ (if gfp then "co" else "") ^ "inductive predicate \"")
blanchet@33192
   334
          @ Syntax.pretty_term ctxt (Const x) ::
blanchet@33192
   335
          pstrs (if wf then
blanchet@33192
   336
                   "\" was proved well-founded. Nitpick can compute it \
blanchet@33192
   337
                   \efficiently."
blanchet@33192
   338
                 else
blanchet@33192
   339
                   "\" could not be proved well-founded. Nitpick might need to \
blanchet@33192
   340
                   \unroll it.")))
blanchet@33192
   341
    val _ = if verbose then List.app print_wf (!wf_cache) else ()
blanchet@38171
   342
    val das_wort_formula = if falsify then "Negated conjecture" else "Formula"
blanchet@33192
   343
    val _ =
blanchet@35386
   344
      pprint_d (fn () => Pretty.chunks
blanchet@38171
   345
          (pretties_for_formulas ctxt das_wort_formula [hd nondef_ts] @
blanchet@35386
   346
           pretties_for_formulas ctxt "Relevant definitional axiom" def_ts @
blanchet@35386
   347
           pretties_for_formulas ctxt "Relevant nondefinitional axiom"
blanchet@35386
   348
                                 (tl nondef_ts)))
blanchet@35386
   349
    val _ = List.app (ignore o Term.type_of) (nondef_ts @ def_ts)
blanchet@33192
   350
            handle TYPE (_, Ts, ts) =>
blanchet@33192
   351
                   raise TYPE ("Nitpick.pick_them_nits_in_term", Ts, ts)
blanchet@33192
   352
blanchet@41801
   353
    val nondef_us = nondef_ts |> map (nut_from_term hol_ctxt Eq)
blanchet@41801
   354
    val def_us = def_ts |> map (nut_from_term hol_ctxt DefEq)
blanchet@41875
   355
    val need_us = need_ts |> map (nut_from_term hol_ctxt Eq)
blanchet@33558
   356
    val (free_names, const_names) =
blanchet@41888
   357
      fold add_free_and_const_names (nondef_us @ def_us @ need_us) ([], [])
blanchet@33558
   358
    val (sel_names, nonsel_names) =
blanchet@33558
   359
      List.partition (is_sel o nickname_of) const_names
blanchet@46114
   360
    val sound_finitizes = none_true finitizes
blanchet@34982
   361
    val standard = forall snd stds
blanchet@33558
   362
(*
blanchet@41888
   363
    val _ =
blanchet@41888
   364
      List.app (print_g o string_for_nut ctxt) (nondef_us @ def_us @ need_us)
blanchet@33558
   365
*)
blanchet@33558
   366
blanchet@34121
   367
    val unique_scope = forall (curry (op =) 1 o length o snd) cards_assigns
blanchet@35385
   368
    fun monotonicity_message Ts extra =
blanchet@38188
   369
      let val pretties = map (pretty_maybe_quote o pretty_for_type ctxt) Ts in
blanchet@38188
   370
        Pretty.blk (0,
blanchet@38188
   371
          pstrs ("The type" ^ plural_s_for_list pretties ^ " ") @
blanchet@38188
   372
          pretty_serial_commas "and" pretties @
blanchet@38188
   373
          pstrs (" " ^
blanchet@42959
   374
                 (if none_true monos then
blanchet@42959
   375
                    "passed the monotonicity test"
blanchet@42959
   376
                  else
blanchet@42959
   377
                    (if length pretties = 1 then "is" else "are") ^
blanchet@42959
   378
                    " considered monotonic") ^
blanchet@42959
   379
                 ". " ^ extra))
blanchet@35385
   380
      end
blanchet@35665
   381
    fun is_type_fundamentally_monotonic T =
blanchet@38240
   382
      (is_datatype ctxt stds T andalso not (is_quot_type ctxt T) andalso
blanchet@37256
   383
       (not (is_pure_typedef ctxt T) orelse is_univ_typedef ctxt T)) orelse
blanchet@38240
   384
      is_number_type ctxt T orelse is_bit_type T
blanchet@35385
   385
    fun is_type_actually_monotonic T =
blanchet@47716
   386
      time_limit tac_timeout (formulas_monotonic hol_ctxt binarize T)
blanchet@47716
   387
                 (nondef_ts, def_ts)
blanchet@47716
   388
      handle TimeLimit.TimeOut => false
blanchet@35665
   389
    fun is_type_kind_of_monotonic T =
blanchet@35665
   390
      case triple_lookup (type_match thy) monos T of
blanchet@35665
   391
        SOME (SOME false) => false
blanchet@35665
   392
      | _ => is_type_actually_monotonic T
blanchet@34936
   393
    fun is_type_monotonic T =
blanchet@33192
   394
      unique_scope orelse
blanchet@33192
   395
      case triple_lookup (type_match thy) monos T of
blanchet@33192
   396
        SOME (SOME b) => b
blanchet@35665
   397
      | _ => is_type_fundamentally_monotonic T orelse
blanchet@35665
   398
             is_type_actually_monotonic T
blanchet@41793
   399
    fun is_deep_datatype_finitizable T =
blanchet@41793
   400
      triple_lookup (type_match thy) finitizes T = SOME (SOME true)
blanchet@41052
   401
    fun is_shallow_datatype_finitizable (T as Type (@{type_name fun_box}, _)) =
blanchet@35665
   402
        is_type_kind_of_monotonic T
blanchet@35665
   403
      | is_shallow_datatype_finitizable T =
blanchet@35665
   404
        case triple_lookup (type_match thy) finitizes T of
blanchet@35665
   405
          SOME (SOME b) => b
blanchet@35665
   406
        | _ => is_type_kind_of_monotonic T
blanchet@35385
   407
    fun is_datatype_deep T =
blanchet@46103
   408
      not standard orelse T = @{typ unit} orelse T = nat_T orelse
blanchet@46103
   409
      is_word_type T orelse
blanchet@35385
   410
      exists (curry (op =) T o domain_type o type_of) sel_names
blanchet@35386
   411
    val all_Ts = ground_types_in_terms hol_ctxt binarize (nondef_ts @ def_ts)
wenzelm@35408
   412
                 |> sort Term_Ord.typ_ord
blanchet@38214
   413
    val _ =
blanchet@38214
   414
      if verbose andalso binary_ints = SOME true andalso
blanchet@38214
   415
         exists (member (op =) [nat_T, int_T]) all_Ts then
blanchet@38214
   416
        print_v (K "The option \"binary_ints\" will be ignored because of the \
blanchet@38214
   417
                   \presence of rationals, reals, \"Suc\", \"gcd\", or \"lcm\" \
blanchet@38214
   418
                   \in the problem or because of the \"non_std\" option.")
blanchet@38214
   419
      else
blanchet@38214
   420
        ()
blanchet@38214
   421
    val _ =
blanchet@43022
   422
      if mode = Normal andalso
blanchet@38214
   423
         exists (fn Type (@{type_name Datatype.node}, _) => true | _ => false)
blanchet@38214
   424
                all_Ts then
blanchet@47560
   425
        print_nt (K ("Warning: The problem involves directly or indirectly the \
blanchet@47560
   426
                     \internal type " ^ quote @{type_name Datatype.node} ^
blanchet@47560
   427
                     ". This type is very Nitpick-unfriendly, and its presence \
blanchet@47560
   428
                     \usually indicates either a failure of abstraction or a \
blanchet@47560
   429
                     \quirk in Nitpick."))
blanchet@38214
   430
      else
blanchet@38214
   431
        ()
blanchet@34982
   432
    val (mono_Ts, nonmono_Ts) = List.partition is_type_monotonic all_Ts
blanchet@33192
   433
    val _ =
blanchet@34936
   434
      if verbose andalso not unique_scope then
blanchet@35665
   435
        case filter_out is_type_fundamentally_monotonic mono_Ts of
blanchet@34936
   436
          [] => ()
blanchet@34936
   437
        | interesting_mono_Ts =>
blanchet@38188
   438
          pprint_v (K (monotonicity_message interesting_mono_Ts
blanchet@38188
   439
                          "Nitpick might be able to skip some scopes."))
blanchet@33192
   440
      else
blanchet@33192
   441
        ()
blanchet@35385
   442
    val (deep_dataTs, shallow_dataTs) =
blanchet@37256
   443
      all_Ts |> filter (is_datatype ctxt stds)
blanchet@37256
   444
             |> List.partition is_datatype_deep
blanchet@35385
   445
    val finitizable_dataTs =
blanchet@41793
   446
      (deep_dataTs |> filter_out (is_finite_type hol_ctxt)
blanchet@41793
   447
                   |> filter is_deep_datatype_finitizable) @
blanchet@41793
   448
      (shallow_dataTs |> filter_out (is_finite_type hol_ctxt)
blanchet@41793
   449
                      |> filter is_shallow_datatype_finitizable)
blanchet@35385
   450
    val _ =
blanchet@35385
   451
      if verbose andalso not (null finitizable_dataTs) then
blanchet@38188
   452
        pprint_v (K (monotonicity_message finitizable_dataTs
blanchet@38188
   453
                         "Nitpick can use a more precise finite encoding."))
blanchet@35385
   454
      else
blanchet@35385
   455
        ()
blanchet@35183
   456
    (* This detection code is an ugly hack. Fortunately, it is used only to
blanchet@35183
   457
       provide a hint to the user. *)
blanchet@35183
   458
    fun is_struct_induct_step (name, (Rule_Cases.Case {fixes, assumes, ...}, _)) =
blanchet@35183
   459
      not (null fixes) andalso
blanchet@35183
   460
      exists (String.isSuffix ".hyps" o fst) assumes andalso
blanchet@35183
   461
      exists (exists (curry (op =) name o shortest_name o fst)
blanchet@35183
   462
              o datatype_constrs hol_ctxt) deep_dataTs
blanchet@35183
   463
    val likely_in_struct_induct_step =
wenzelm@42361
   464
      exists is_struct_induct_step (Proof_Context.cases_of ctxt)
blanchet@35183
   465
    val _ = if standard andalso likely_in_struct_induct_step then
blanchet@47560
   466
              pprint_nt (fn () => Pretty.blk (0,
blanchet@34982
   467
                  pstrs "Hint: To check that the induction hypothesis is \
blanchet@35177
   468
                        \general enough, try this command: " @
wenzelm@50450
   469
                  [Pretty.mark
wenzelm@50450
   470
                    (Active.make_markup Markup.sendbackN {implicit = false, properties = []})
wenzelm@50215
   471
                    (Pretty.blk (0,
blanchet@35183
   472
                       pstrs ("nitpick [non_std, show_all]")))] @ pstrs "."))
blanchet@34982
   473
            else
blanchet@34982
   474
              ()
blanchet@33192
   475
(*
blanchet@36128
   476
    val _ = print_g "Monotonic types:"
blanchet@36128
   477
    val _ = List.app (print_g o string_for_type ctxt) mono_Ts
blanchet@36128
   478
    val _ = print_g "Nonmonotonic types:"
blanchet@36128
   479
    val _ = List.app (print_g o string_for_type ctxt) nonmono_Ts
blanchet@33192
   480
*)
blanchet@33192
   481
blanchet@36384
   482
    val incremental = Int.max (max_potential, max_genuine) >= 2
blanchet@36384
   483
    val actual_sat_solver =
blanchet@33192
   484
      if sat_solver <> "smart" then
blanchet@36384
   485
        if incremental andalso
blanchet@34936
   486
           not (member (op =) (Kodkod_SAT.configured_sat_solvers true)
blanchet@35333
   487
                       sat_solver) then
blanchet@47560
   488
          (print_nt (K ("An incremental SAT solver is required: \"SAT4J\" will \
blanchet@47560
   489
                        \be used instead of " ^ quote sat_solver ^ "."));
blanchet@33192
   490
           "SAT4J")
blanchet@33192
   491
        else
blanchet@33192
   492
          sat_solver
blanchet@33192
   493
      else
blanchet@36384
   494
        Kodkod_SAT.smart_sat_solver_name incremental
blanchet@33192
   495
    val _ =
blanchet@33192
   496
      if sat_solver = "smart" then
blanchet@36384
   497
        print_v (fn () =>
blanchet@36384
   498
            "Using SAT solver " ^ quote actual_sat_solver ^ ". The following" ^
blanchet@36384
   499
            (if incremental then " incremental " else " ") ^
blanchet@36384
   500
            "solvers are configured: " ^
blanchet@36384
   501
            commas_quote (Kodkod_SAT.configured_sat_solvers incremental) ^ ".")
blanchet@33192
   502
      else
blanchet@33192
   503
        ()
blanchet@33192
   504
blanchet@33192
   505
    val too_big_scopes = Unsynchronized.ref []
blanchet@33192
   506
blanchet@35185
   507
    fun problem_for_scope unsound
blanchet@34124
   508
            (scope as {card_assigns, bits, bisim_depth, datatypes, ofs, ...}) =
blanchet@33192
   509
      let
blanchet@33192
   510
        val _ = not (exists (fn other => scope_less_eq other scope)
blanchet@34936
   511
                            (!too_big_scopes)) orelse
blanchet@34936
   512
                raise TOO_LARGE ("Nitpick.pick_them_nits_in_term.\
blanchet@34936
   513
                                 \problem_for_scope", "too large scope")
blanchet@33192
   514
(*
blanchet@36128
   515
        val _ = print_g "Offsets:"
blanchet@33192
   516
        val _ = List.app (fn (T, j0) =>
blanchet@36128
   517
                             print_g (string_for_type ctxt T ^ " = " ^
blanchet@36128
   518
                                    string_of_int j0))
blanchet@33192
   519
                         (Typtab.dest ofs)
blanchet@33192
   520
*)
blanchet@41858
   521
        val effective_total_consts =
blanchet@41856
   522
          case total_consts of
blanchet@41856
   523
            SOME b => b
blanchet@41856
   524
          | NONE => forall (is_exact_type datatypes true) all_Ts
blanchet@33192
   525
        val main_j0 = offset_of_type ofs bool_T
blanchet@33192
   526
        val (nat_card, nat_j0) = spec_of_type scope nat_T
blanchet@33192
   527
        val (int_card, int_j0) = spec_of_type scope int_T
blanchet@34936
   528
        val _ = (nat_j0 = main_j0 andalso int_j0 = main_j0) orelse
blanchet@34936
   529
                raise BAD ("Nitpick.pick_them_nits_in_term.problem_for_scope",
blanchet@34936
   530
                           "bad offsets")
blanchet@33192
   531
        val kk = kodkod_constrs peephole_optim nat_card int_card main_j0
blanchet@33192
   532
        val (free_names, rep_table) =
blanchet@38170
   533
          choose_reps_for_free_vars scope pseudo_frees free_names
blanchet@38170
   534
                                    NameTable.empty
blanchet@33192
   535
        val (sel_names, rep_table) = choose_reps_for_all_sels scope rep_table
blanchet@38170
   536
        val (nonsel_names, rep_table) =
blanchet@41858
   537
          choose_reps_for_consts scope effective_total_consts nonsel_names
blanchet@41858
   538
                                 rep_table
blanchet@38182
   539
        val (guiltiest_party, min_highest_arity) =
blanchet@38182
   540
          NameTable.fold (fn (name, R) => fn (s, n) =>
blanchet@38182
   541
                             let val n' = arity_of_rep R in
blanchet@38182
   542
                               if n' > n then (nickname_of name, n') else (s, n)
blanchet@38182
   543
                             end) rep_table ("", 1)
blanchet@33192
   544
        val min_univ_card =
blanchet@36384
   545
          NameTable.fold (Integer.max o min_univ_card_of_rep o snd) rep_table
blanchet@34126
   546
                         (univ_card nat_card int_card main_j0 [] KK.True)
blanchet@52202
   547
        val _ = check_arity guiltiest_party min_univ_card min_highest_arity
blanchet@33192
   548
blanchet@41802
   549
        val def_us =
blanchet@41802
   550
          def_us |> map (choose_reps_in_nut scope unsound rep_table true)
blanchet@41802
   551
        val nondef_us =
blanchet@41802
   552
          nondef_us |> map (choose_reps_in_nut scope unsound rep_table false)
blanchet@41875
   553
        val need_us =
blanchet@41875
   554
          need_us |> map (choose_reps_in_nut scope unsound rep_table false)
blanchet@33745
   555
(*
blanchet@36128
   556
        val _ = List.app (print_g o string_for_nut ctxt)
blanchet@33192
   557
                         (free_names @ sel_names @ nonsel_names @
blanchet@41888
   558
                          nondef_us @ def_us @ need_us)
blanchet@33745
   559
*)
blanchet@33192
   560
        val (free_rels, pool, rel_table) =
blanchet@33192
   561
          rename_free_vars free_names initial_pool NameTable.empty
blanchet@33192
   562
        val (sel_rels, pool, rel_table) =
blanchet@33192
   563
          rename_free_vars sel_names pool rel_table
blanchet@33192
   564
        val (other_rels, pool, rel_table) =
blanchet@33192
   565
          rename_free_vars nonsel_names pool rel_table
blanchet@41802
   566
        val nondef_us = nondef_us |> map (rename_vars_in_nut pool rel_table)
blanchet@41802
   567
        val def_us = def_us |> map (rename_vars_in_nut pool rel_table)
blanchet@41875
   568
        val need_us = need_us |> map (rename_vars_in_nut pool rel_table)
blanchet@35386
   569
        val nondef_fs = map (kodkod_formula_from_nut ofs kk) nondef_us
blanchet@35280
   570
        val def_fs = map (kodkod_formula_from_nut ofs kk) def_us
blanchet@35386
   571
        val formula = fold (fold s_and) [def_fs, nondef_fs] KK.True
blanchet@35185
   572
        val comment = (if unsound then "unsound" else "sound") ^ "\n" ^
wenzelm@37146
   573
                      Print_Mode.setmp [] multiline_string_for_scope scope
blanchet@34998
   574
        val kodkod_sat_solver =
blanchet@36384
   575
          Kodkod_SAT.sat_solver_spec actual_sat_solver |> snd
blanchet@34124
   576
        val bit_width = if bits = 0 then 16 else bits + 1
blanchet@36384
   577
        val delay =
blanchet@36384
   578
          if unsound then
blanchet@36384
   579
            Option.map (fn time => Time.- (time, Time.now ())) deadline
blanchet@36384
   580
            |> unsound_delay_for_timeout
blanchet@36384
   581
          else
blanchet@36384
   582
            0
blanchet@36384
   583
        val settings = [("solver", commas_quote kodkod_sat_solver),
blanchet@34124
   584
                        ("bit_width", string_of_int bit_width),
blanchet@38124
   585
                        ("symmetry_breaking", string_of_int kodkod_sym_break),
blanchet@36386
   586
                        ("sharing", "3"),
blanchet@36386
   587
                        ("flatten", "false"),
blanchet@33192
   588
                        ("delay", signed_string_of_int delay)]
blanchet@33192
   589
        val plain_rels = free_rels @ other_rels
blanchet@33192
   590
        val plain_bounds = map (bound_for_plain_rel ctxt debug) plain_rels
blanchet@33192
   591
        val plain_axioms = map (declarative_axiom_for_plain_rel kk) plain_rels
blanchet@41995
   592
        val need_vals =
blanchet@41995
   593
          map (fn dtype as {typ, ...} =>
blanchet@41995
   594
                  (typ, needed_values_for_datatype need_us ofs dtype)) datatypes
blanchet@41995
   595
        val sel_bounds =
blanchet@41995
   596
          map (bound_for_sel_rel ctxt debug need_vals datatypes) sel_rels
blanchet@35190
   597
        val dtype_axioms =
blanchet@41995
   598
          declarative_axioms_for_datatypes hol_ctxt binarize need_us need_vals
blanchet@41801
   599
              datatype_sym_break bits ofs kk rel_table datatypes
blanchet@33192
   600
        val declarative_axioms = plain_axioms @ dtype_axioms
blanchet@35220
   601
        val univ_card = Int.max (univ_card nat_card int_card main_j0
blanchet@35220
   602
                                     (plain_bounds @ sel_bounds) formula,
blanchet@35220
   603
                                 main_j0 |> bits > 0 ? Integer.add (bits + 1))
blanchet@38126
   604
        val (built_in_bounds, built_in_axioms) =
blanchet@39345
   605
          bounds_and_axioms_for_built_in_rels_in_formulas debug univ_card
blanchet@39345
   606
              nat_card int_card main_j0 (formula :: declarative_axioms)
blanchet@33192
   607
        val bounds = built_in_bounds @ plain_bounds @ sel_bounds
blanchet@33192
   608
                     |> not debug ? merge_bounds
blanchet@38126
   609
        val axioms = built_in_axioms @ declarative_axioms
blanchet@33192
   610
        val highest_arity =
blanchet@33192
   611
          fold Integer.max (map (fst o fst) (maps fst bounds)) 0
blanchet@38126
   612
        val formula = fold_rev s_and axioms formula
blanchet@34124
   613
        val _ = if bits = 0 then () else check_bits bits formula
blanchet@52202
   614
        val _ = if formula = KK.False then ()
blanchet@38182
   615
                else check_arity "" univ_card highest_arity
blanchet@33192
   616
      in
blanchet@33192
   617
        SOME ({comment = comment, settings = settings, univ_card = univ_card,
blanchet@33192
   618
               tuple_assigns = [], bounds = bounds,
blanchet@35280
   619
               int_bounds = if bits = 0 then sequential_int_bounds univ_card
blanchet@35280
   620
                            else pow_of_two_int_bounds bits main_j0,
blanchet@33192
   621
               expr_assigns = [], formula = formula},
blanchet@33192
   622
              {free_names = free_names, sel_names = sel_names,
blanchet@33192
   623
               nonsel_names = nonsel_names, rel_table = rel_table,
blanchet@35386
   624
               unsound = unsound, scope = scope})
blanchet@33192
   625
      end
blanchet@34124
   626
      handle TOO_LARGE (loc, msg) =>
blanchet@34936
   627
             if loc = "Nitpick_Kodkod.check_arity" andalso
blanchet@34936
   628
                not (Typtab.is_empty ofs) then
blanchet@35185
   629
               problem_for_scope unsound
blanchet@35190
   630
                   {hol_ctxt = hol_ctxt, binarize = binarize,
blanchet@35190
   631
                    card_assigns = card_assigns, bits = bits,
blanchet@35190
   632
                    bisim_depth = bisim_depth, datatypes = datatypes,
blanchet@35190
   633
                    ofs = Typtab.empty}
blanchet@33192
   634
             else if loc = "Nitpick.pick_them_nits_in_term.\
blanchet@33192
   635
                           \problem_for_scope" then
blanchet@33192
   636
               NONE
blanchet@33192
   637
             else
blanchet@33192
   638
               (Unsynchronized.change too_big_scopes (cons scope);
blanchet@41992
   639
                print_v (fn () =>
blanchet@41992
   640
                    "Limit reached: " ^ msg ^ ". Skipping " ^
blanchet@41992
   641
                    (if unsound then "potential component of " else "") ^
blanchet@41992
   642
                    "scope.");
blanchet@33192
   643
                NONE)
blanchet@35280
   644
           | TOO_SMALL (_, msg) =>
blanchet@41992
   645
             (print_v (fn () =>
blanchet@41992
   646
                  "Limit reached: " ^ msg ^ ". Skipping " ^
blanchet@41992
   647
                  (if unsound then "potential component of " else "") ^
blanchet@41992
   648
                  "scope.");
blanchet@34124
   649
              NONE)
blanchet@33192
   650
blanchet@34982
   651
    val das_wort_model =
blanchet@34982
   652
      (if falsify then "counterexample" else "model")
blanchet@34982
   653
      |> not standard ? prefix "nonstandard "
blanchet@33192
   654
blanchet@33192
   655
    val scopes = Unsynchronized.ref []
blanchet@33192
   656
    val generated_scopes = Unsynchronized.ref []
blanchet@35185
   657
    val generated_problems = Unsynchronized.ref ([] : rich_problem list)
blanchet@33192
   658
    val checked_problems = Unsynchronized.ref (SOME [])
blanchet@33192
   659
    val met_potential = Unsynchronized.ref 0
blanchet@33192
   660
blanchet@33192
   661
    fun update_checked_problems problems =
blanchet@33192
   662
      List.app (Unsynchronized.change checked_problems o Option.map o cons
blanchet@33192
   663
                o nth problems)
blanchet@35333
   664
    fun show_kodkod_warning "" = ()
blanchet@47560
   665
      | show_kodkod_warning s = print_nt (fn () => "Kodkod warning: " ^ s ^ ".")
blanchet@33192
   666
blanchet@33192
   667
    fun print_and_check_model genuine bounds
blanchet@33192
   668
            ({free_names, sel_names, nonsel_names, rel_table, scope, ...}
blanchet@33192
   669
             : problem_extension) =
blanchet@33192
   670
      let
blanchet@47752
   671
        val _ =
blanchet@47752
   672
          print_t (fn () =>
blanchet@47752
   673
               "% SZS status " ^
blanchet@47752
   674
               (if genuine then
blanchet@47752
   675
                  if falsify then "CounterSatisfiable" else "Satisfiable"
blanchet@47752
   676
                else
blanchet@47752
   677
                  "Unknown") ^ "\n" ^
blanchet@47752
   678
               "% SZS output start FiniteModel")
blanchet@33192
   679
        val (reconstructed_model, codatatypes_ok) =
blanchet@41993
   680
          reconstruct_hol_model
blanchet@41993
   681
              {show_datatypes = show_datatypes, show_skolems = show_skolems,
blanchet@41993
   682
               show_consts = show_consts}
blanchet@38170
   683
              scope formats atomss real_frees pseudo_frees free_names sel_names
blanchet@38170
   684
              nonsel_names rel_table bounds
blanchet@35671
   685
        val genuine_means_genuine =
blanchet@35671
   686
          got_all_user_axioms andalso none_true wfs andalso
blanchet@41858
   687
          sound_finitizes andalso total_consts <> SOME true andalso
blanchet@41858
   688
          codatatypes_ok
blanchet@47715
   689
        fun assms_prop () =
blanchet@47715
   690
          Logic.mk_conjunction_list (neg_t :: def_assm_ts @ nondef_assm_ts)
blanchet@33192
   691
      in
blanchet@47752
   692
        (pprint_a (Pretty.chunks
blanchet@35671
   693
             [Pretty.blk (0,
blanchet@43022
   694
                  (pstrs ((if mode = Auto_Try then "Auto " else "") ^
blanchet@43022
   695
                          "Nitpick found a" ^
blanchet@41992
   696
                          (if not genuine then " potentially spurious "
blanchet@35671
   697
                           else if genuine_means_genuine then " "
blanchet@35671
   698
                           else " quasi genuine ") ^ das_wort_model) @
blanchet@35671
   699
                   (case pretties_for_scope scope verbose of
blanchet@35671
   700
                      [] => []
blanchet@35671
   701
                    | pretties => pstrs " for " @ pretties) @
blanchet@35671
   702
                   [Pretty.str ":\n"])),
blanchet@35671
   703
              Pretty.indent indent_size reconstructed_model]);
blanchet@47564
   704
         print_t (K "% SZS output end FiniteModel");
blanchet@35671
   705
         if genuine then
blanchet@35671
   706
           (if check_genuine andalso standard then
blanchet@35671
   707
              case prove_hol_model scope tac_timeout free_names sel_names
blanchet@38169
   708
                                   rel_table bounds (assms_prop ()) of
blanchet@35671
   709
                SOME true =>
blanchet@35671
   710
                print ("Confirmation by \"auto\": The above " ^
blanchet@35671
   711
                       das_wort_model ^ " is really genuine.")
blanchet@33192
   712
              | SOME false =>
blanchet@34982
   713
                if genuine_means_genuine then
blanchet@34982
   714
                  error ("A supposedly genuine " ^ das_wort_model ^ " was \
blanchet@34982
   715
                         \shown to be spurious by \"auto\".\nThis should never \
blanchet@34982
   716
                         \happen.\nPlease send a bug report to blanchet\
blanchet@33192
   717
                         \te@in.tum.de.")
blanchet@35671
   718
                 else
blanchet@35671
   719
                   print ("Refutation by \"auto\": The above " ^
blanchet@35671
   720
                          das_wort_model ^ " is spurious.")
blanchet@35671
   721
               | NONE => print "No confirmation by \"auto\"."
blanchet@35671
   722
            else
blanchet@35671
   723
              ();
blanchet@35671
   724
            if not standard andalso likely_in_struct_induct_step then
blanchet@35671
   725
              print "The existence of a nonstandard model suggests that the \
blanchet@36126
   726
                    \induction hypothesis is not general enough or may even be \
blanchet@36126
   727
                    \wrong. See the Nitpick manual's \"Inductive Properties\" \
blanchet@36126
   728
                    \section for details (\"isabelle doc nitpick\")."
blanchet@35671
   729
            else
blanchet@35671
   730
              ();
blanchet@41048
   731
            if has_lonely_bool_var orig_t then
blanchet@41048
   732
              print "Hint: Maybe you forgot a colon after the lemma's name?"
blanchet@41048
   733
            else if has_syntactic_sorts orig_t then
blanchet@35671
   734
              print "Hint: Maybe you forgot a type constraint?"
blanchet@35671
   735
            else
blanchet@35671
   736
              ();
blanchet@35671
   737
            if not genuine_means_genuine then
blanchet@35671
   738
              if no_poly_user_axioms then
blanchet@35671
   739
                let
blanchet@35671
   740
                  val options =
blanchet@35671
   741
                    [] |> not got_all_mono_user_axioms
blanchet@35671
   742
                          ? cons ("user_axioms", "\"true\"")
blanchet@35671
   743
                       |> not (none_true wfs)
blanchet@35671
   744
                          ? cons ("wf", "\"smart\" or \"false\"")
blanchet@35671
   745
                       |> not sound_finitizes
blanchet@35671
   746
                          ? cons ("finitize", "\"smart\" or \"false\"")
blanchet@41858
   747
                       |> total_consts = SOME true
blanchet@41858
   748
                          ? cons ("total_consts", "\"smart\" or \"false\"")
blanchet@35671
   749
                       |> not codatatypes_ok
blanchet@35671
   750
                          ? cons ("bisim_depth", "a nonnegative value")
blanchet@35671
   751
                  val ss =
blanchet@35671
   752
                    map (fn (name, value) => quote name ^ " set to " ^ value)
blanchet@35671
   753
                        options
blanchet@35671
   754
                in
blanchet@35671
   755
                  print ("Try again with " ^
blanchet@41872
   756
                         space_implode " " (serial_commas "and" ss) ^
blanchet@35671
   757
                         " to confirm that the " ^ das_wort_model ^
blanchet@35671
   758
                         " is genuine.")
blanchet@35671
   759
                end
blanchet@35671
   760
              else
blanchet@35671
   761
                print ("Nitpick is unable to guarantee the authenticity of \
blanchet@35671
   762
                       \the " ^ das_wort_model ^ " in the presence of \
blanchet@35671
   763
                       \polymorphic axioms.")
blanchet@35671
   764
            else
blanchet@35671
   765
              ();
blanchet@35671
   766
            NONE)
blanchet@35671
   767
         else
blanchet@35671
   768
           if not genuine then
blanchet@35671
   769
             (Unsynchronized.inc met_potential;
blanchet@35671
   770
              if check_potential then
blanchet@35671
   771
                let
blanchet@35671
   772
                  val status = prove_hol_model scope tac_timeout free_names
blanchet@38169
   773
                                               sel_names rel_table bounds
blanchet@38169
   774
                                               (assms_prop ())
blanchet@35671
   775
                in
blanchet@35671
   776
                  (case status of
blanchet@35671
   777
                     SOME true => print ("Confirmation by \"auto\": The \
blanchet@35671
   778
                                         \above " ^ das_wort_model ^
blanchet@35671
   779
                                         " is genuine.")
blanchet@35671
   780
                   | SOME false => print ("Refutation by \"auto\": The above " ^
blanchet@35671
   781
                                          das_wort_model ^ " is spurious.")
blanchet@35671
   782
                   | NONE => print "No confirmation by \"auto\".");
blanchet@35671
   783
                  status
blanchet@35671
   784
                end
blanchet@35671
   785
              else
blanchet@35671
   786
                NONE)
blanchet@33192
   787
           else
blanchet@35671
   788
             NONE)
blanchet@35671
   789
        |> pair genuine_means_genuine
blanchet@33192
   790
      end
blanchet@35671
   791
    fun solve_any_problem (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   792
                           donno) first_time problems =
blanchet@33192
   793
      let
blanchet@33192
   794
        val max_potential = Int.max (0, max_potential)
blanchet@33192
   795
        val max_genuine = Int.max (0, max_genuine)
blanchet@33192
   796
        fun print_and_check genuine (j, bounds) =
blanchet@33192
   797
          print_and_check_model genuine bounds (snd (nth problems j))
blanchet@33192
   798
        val max_solutions = max_potential + max_genuine
blanchet@36384
   799
                            |> not incremental ? Integer.min 1
blanchet@33192
   800
      in
blanchet@33192
   801
        if max_solutions <= 0 then
blanchet@35671
   802
          (found_really_genuine, 0, 0, donno)
blanchet@33192
   803
        else
blanchet@41793
   804
          case KK.solve_any_problem debug overlord deadline max_threads
blanchet@41793
   805
                                    max_solutions (map fst problems) of
blanchet@49024
   806
            KK.JavaNotFound =>
blanchet@49024
   807
            (print_nt java_not_found_message;
blanchet@35696
   808
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@38516
   809
          | KK.JavaTooOld =>
blanchet@49024
   810
            (print_nt java_too_old_message;
blanchet@38516
   811
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@35696
   812
          | KK.KodkodiNotInstalled =>
blanchet@49024
   813
            (print_nt kodkodi_not_installed_message;
blanchet@35671
   814
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@50487
   815
          | KK.KodkodiTooOld =>
blanchet@50487
   816
            (print_nt kodkodi_too_old_message;
blanchet@50487
   817
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@35333
   818
          | KK.Normal ([], unsat_js, s) =>
blanchet@35333
   819
            (update_checked_problems problems unsat_js; show_kodkod_warning s;
blanchet@35671
   820
             (found_really_genuine, max_potential, max_genuine, donno))
blanchet@35333
   821
          | KK.Normal (sat_ps, unsat_js, s) =>
blanchet@33192
   822
            let
blanchet@33192
   823
              val (lib_ps, con_ps) =
blanchet@35185
   824
                List.partition (#unsound o snd o nth problems o fst) sat_ps
blanchet@33192
   825
            in
blanchet@33192
   826
              update_checked_problems problems (unsat_js @ map fst lib_ps);
blanchet@35333
   827
              show_kodkod_warning s;
blanchet@33192
   828
              if null con_ps then
blanchet@33192
   829
                let
blanchet@35671
   830
                  val genuine_codes =
blanchet@35671
   831
                    lib_ps |> take max_potential
blanchet@35671
   832
                           |> map (print_and_check false)
blanchet@35671
   833
                           |> filter (curry (op =) (SOME true) o snd)
blanchet@35671
   834
                  val found_really_genuine =
blanchet@35671
   835
                    found_really_genuine orelse exists fst genuine_codes
blanchet@35671
   836
                  val num_genuine = length genuine_codes
blanchet@33192
   837
                  val max_genuine = max_genuine - num_genuine
blanchet@33192
   838
                  val max_potential = max_potential
blanchet@33192
   839
                                      - (length lib_ps - num_genuine)
blanchet@33192
   840
                in
blanchet@33192
   841
                  if max_genuine <= 0 then
blanchet@35671
   842
                    (found_really_genuine, 0, 0, donno)
blanchet@33192
   843
                  else
blanchet@33192
   844
                    let
blanchet@35185
   845
                      (* "co_js" is the list of sound problems whose unsound
blanchet@35185
   846
                         pendants couldn't be satisfied and hence that most
blanchet@35185
   847
                         probably can't be satisfied themselves. *)
blanchet@33192
   848
                      val co_js =
blanchet@33192
   849
                        map (fn j => j - 1) unsat_js
blanchet@33192
   850
                        |> filter (fn j =>
blanchet@33192
   851
                                      j >= 0 andalso
blanchet@33192
   852
                                      scopes_equivalent
blanchet@35814
   853
                                          (#scope (snd (nth problems j)),
blanchet@35814
   854
                                           #scope (snd (nth problems (j + 1)))))
blanchet@33192
   855
                      val bye_js = sort_distinct int_ord (map fst sat_ps @
blanchet@33192
   856
                                                          unsat_js @ co_js)
blanchet@33192
   857
                      val problems =
blanchet@33192
   858
                        problems |> filter_out_indices bye_js
blanchet@33192
   859
                                 |> max_potential <= 0
blanchet@35185
   860
                                    ? filter_out (#unsound o snd)
blanchet@33192
   861
                    in
blanchet@35671
   862
                      solve_any_problem (found_really_genuine, max_potential,
blanchet@35671
   863
                                         max_genuine, donno) false problems
blanchet@33192
   864
                    end
blanchet@33192
   865
                end
blanchet@33192
   866
              else
blanchet@33192
   867
                let
blanchet@35671
   868
                  val genuine_codes =
blanchet@35671
   869
                    con_ps |> take max_genuine
blanchet@35671
   870
                           |> map (print_and_check true)
blanchet@35671
   871
                  val max_genuine = max_genuine - length genuine_codes
blanchet@35671
   872
                  val found_really_genuine =
blanchet@35671
   873
                    found_really_genuine orelse exists fst genuine_codes
blanchet@33192
   874
                in
blanchet@33192
   875
                  if max_genuine <= 0 orelse not first_time then
blanchet@35671
   876
                    (found_really_genuine, 0, max_genuine, donno)
blanchet@33192
   877
                  else
blanchet@33192
   878
                    let
blanchet@33192
   879
                      val bye_js = sort_distinct int_ord
blanchet@33192
   880
                                                 (map fst sat_ps @ unsat_js)
blanchet@33192
   881
                      val problems =
blanchet@33192
   882
                        problems |> filter_out_indices bye_js
blanchet@35185
   883
                                 |> filter_out (#unsound o snd)
blanchet@35671
   884
                    in
blanchet@35671
   885
                      solve_any_problem (found_really_genuine, 0, max_genuine,
blanchet@35671
   886
                                         donno) false problems
blanchet@35671
   887
                    end
blanchet@33192
   888
                end
blanchet@33192
   889
            end
blanchet@34126
   890
          | KK.TimedOut unsat_js =>
blanchet@33192
   891
            (update_checked_problems problems unsat_js; raise TimeLimit.TimeOut)
blanchet@34126
   892
          | KK.Error (s, unsat_js) =>
blanchet@33192
   893
            (update_checked_problems problems unsat_js;
blanchet@33192
   894
             print_v (K ("Kodkod error: " ^ s ^ "."));
blanchet@35671
   895
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@33192
   896
      end
blanchet@33192
   897
blanchet@35671
   898
    fun run_batch j n scopes (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   899
                              donno) =
blanchet@33192
   900
      let
blanchet@33192
   901
        val _ =
blanchet@33192
   902
          if null scopes then
blanchet@47560
   903
            print_nt (K "The scope specification is inconsistent.")
blanchet@33192
   904
          else if verbose then
blanchet@47560
   905
            pprint_nt (fn () => Pretty.chunks
blanchet@33192
   906
                [Pretty.blk (0,
blanchet@33192
   907
                     pstrs ((if n > 1 then
blanchet@33192
   908
                               "Batch " ^ string_of_int (j + 1) ^ " of " ^
blanchet@33192
   909
                               signed_string_of_int n ^ ": "
blanchet@33192
   910
                             else
blanchet@33192
   911
                               "") ^
blanchet@33192
   912
                            "Trying " ^ string_of_int (length scopes) ^
blanchet@33192
   913
                            " scope" ^ plural_s_for_list scopes ^ ":")),
blanchet@33192
   914
                 Pretty.indent indent_size
blanchet@33192
   915
                     (Pretty.chunks (map2
blanchet@33192
   916
                          (fn j => fn scope =>
blanchet@33192
   917
                              Pretty.block (
blanchet@33192
   918
                                  (case pretties_for_scope scope true of
blanchet@33192
   919
                                     [] => [Pretty.str "Empty"]
blanchet@33192
   920
                                   | pretties => pretties) @
blanchet@33192
   921
                                  [Pretty.str (if j = 1 then "." else ";")]))
blanchet@33192
   922
                          (length scopes downto 1) scopes))])
blanchet@33192
   923
          else
blanchet@33192
   924
            ()
blanchet@35280
   925
        fun add_problem_for_scope (scope, unsound) (problems, donno) =
blanchet@33192
   926
          (check_deadline ();
blanchet@35185
   927
           case problem_for_scope unsound scope of
blanchet@33192
   928
             SOME problem =>
blanchet@33192
   929
             (problems
blanchet@33192
   930
              |> (null problems orelse
blanchet@35814
   931
                  not (KK.problems_equivalent (fst problem, fst (hd problems))))
blanchet@33192
   932
                  ? cons problem, donno)
blanchet@33192
   933
           | NONE => (problems, donno + 1))
blanchet@33192
   934
        val (problems, donno) =
blanchet@33192
   935
          fold add_problem_for_scope
blanchet@33192
   936
               (map_product pair scopes
blanchet@33192
   937
                    ((if max_genuine > 0 then [false] else []) @
blanchet@33192
   938
                     (if max_potential > 0 then [true] else [])))
blanchet@33192
   939
               ([], donno)
blanchet@33192
   940
        val _ = Unsynchronized.change generated_problems (append problems)
blanchet@33192
   941
        val _ = Unsynchronized.change generated_scopes (append scopes)
blanchet@35185
   942
        val _ =
blanchet@35185
   943
          if j + 1 = n then
blanchet@35185
   944
            let
blanchet@35185
   945
              val (unsound_problems, sound_problems) =
blanchet@35185
   946
                List.partition (#unsound o snd) (!generated_problems)
blanchet@35185
   947
            in
blanchet@35185
   948
              if not (null sound_problems) andalso
blanchet@35185
   949
                 forall (KK.is_problem_trivially_false o fst)
blanchet@35185
   950
                        sound_problems then
blanchet@47560
   951
                print_nt (fn () =>
blanchet@44395
   952
                    "Warning: The conjecture " ^
blanchet@44395
   953
                    (if falsify then "either trivially holds"
blanchet@44395
   954
                     else "is either trivially unsatisfiable") ^
blanchet@44395
   955
                    " for the given scopes or lies outside Nitpick's supported \
blanchet@35384
   956
                    \fragment." ^
blanchet@35185
   957
                    (if exists (not o KK.is_problem_trivially_false o fst)
blanchet@35185
   958
                               unsound_problems then
blanchet@41992
   959
                       " Only potentially spurious " ^ das_wort_model ^
blanchet@41992
   960
                       "s may be found."
blanchet@35185
   961
                     else
blanchet@35185
   962
                       ""))
blanchet@35185
   963
              else
blanchet@35185
   964
                ()
blanchet@35185
   965
            end
blanchet@35185
   966
          else
blanchet@35185
   967
            ()
blanchet@33192
   968
      in
blanchet@35671
   969
        solve_any_problem (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   970
                           donno) true (rev problems)
blanchet@33192
   971
      end
blanchet@33192
   972
blanchet@33192
   973
    fun scope_count (problems : rich_problem list) scope =
blanchet@35814
   974
      length (filter (curry scopes_equivalent scope o #scope o snd) problems)
blanchet@33192
   975
    fun excipit did_so_and_so =
blanchet@33192
   976
      let
blanchet@33192
   977
        val do_filter =
blanchet@35185
   978
          if !met_potential = max_potential then filter_out (#unsound o snd)
blanchet@33192
   979
          else I
blanchet@33192
   980
        val total = length (!scopes)
blanchet@33192
   981
        val unsat =
blanchet@33192
   982
          fold (fn scope =>
blanchet@33192
   983
                   case scope_count (do_filter (!generated_problems)) scope of
blanchet@33192
   984
                     0 => I
blanchet@33192
   985
                   | n =>
blanchet@33556
   986
                     scope_count (do_filter (these (!checked_problems)))
blanchet@33556
   987
                                 scope = n
blanchet@33556
   988
                     ? Integer.add 1) (!generated_scopes) 0
blanchet@33192
   989
      in
blanchet@47560
   990
        (if mode = TPTP then "% SZS status Unknown\n" else "") ^
blanchet@33192
   991
        "Nitpick " ^ did_so_and_so ^
blanchet@33192
   992
        (if is_some (!checked_problems) andalso total > 0 then
blanchet@39361
   993
           " " ^ string_of_int unsat ^ " of " ^ string_of_int total ^ " scope"
blanchet@39361
   994
           ^ plural_s total
blanchet@33192
   995
         else
blanchet@33192
   996
           "") ^ "."
blanchet@33192
   997
      end
blanchet@33192
   998
blanchet@37704
   999
    val (skipped, the_scopes) =
blanchet@37704
  1000
      all_scopes hol_ctxt binarize cards_assigns maxes_assigns iters_assigns
blanchet@37704
  1001
                 bitss bisim_depths mono_Ts nonmono_Ts deep_dataTs
blanchet@37704
  1002
                 finitizable_dataTs
blanchet@37704
  1003
    val _ = if skipped > 0 then
blanchet@47560
  1004
              print_nt (fn () => "Too many scopes. Skipping " ^
blanchet@47560
  1005
                                 string_of_int skipped ^ " scope" ^
blanchet@47560
  1006
                                 plural_s skipped ^
blanchet@47560
  1007
                                 ". (Consider using \"mono\" or \
blanchet@47560
  1008
                                 \\"merge_type_vars\" to prevent this.)")
blanchet@37704
  1009
            else
blanchet@37704
  1010
              ()
blanchet@37704
  1011
    val _ = scopes := the_scopes
blanchet@37704
  1012
blanchet@35671
  1013
    fun run_batches _ _ []
blanchet@35671
  1014
                    (found_really_genuine, max_potential, max_genuine, donno) =
blanchet@33192
  1015
        if donno > 0 andalso max_genuine > 0 then
blanchet@47560
  1016
          (print_nt (fn () => excipit "checked"); unknownN)
blanchet@33192
  1017
        else if max_genuine = original_max_genuine then
blanchet@33192
  1018
          if max_potential = original_max_potential then
blanchet@47562
  1019
            (print_t (K "% SZS status Unknown");
blanchet@47560
  1020
             print_nt (fn () =>
blanchet@34982
  1021
                 "Nitpick found no " ^ das_wort_model ^ "." ^
blanchet@35183
  1022
                 (if not standard andalso likely_in_struct_induct_step then
blanchet@34982
  1023
                    " This suggests that the induction hypothesis might be \
blanchet@34982
  1024
                    \general enough to prove this subgoal."
blanchet@34982
  1025
                  else
blanchet@43020
  1026
                    "")); if skipped > 0 then unknownN else noneN)
blanchet@33192
  1027
          else
blanchet@47560
  1028
            (print_nt (fn () =>
blanchet@38123
  1029
                 excipit ("could not find a" ^
blanchet@38123
  1030
                          (if max_genuine = 1 then
blanchet@38123
  1031
                             " better " ^ das_wort_model ^ "."
blanchet@38123
  1032
                           else
blanchet@38123
  1033
                             "ny better " ^ das_wort_model ^ "s.") ^
blanchet@38123
  1034
                          " It checked"));
blanchet@43020
  1035
             potentialN)
blanchet@35671
  1036
        else if found_really_genuine then
blanchet@43020
  1037
          genuineN
blanchet@33192
  1038
        else
blanchet@43020
  1039
          quasi_genuineN
blanchet@33192
  1040
      | run_batches j n (batch :: batches) z =
blanchet@35671
  1041
        let val (z as (_, _, max_genuine, _)) = run_batch j n batch z in
blanchet@33192
  1042
          run_batches (j + 1) n (if max_genuine > 0 then batches else []) z
blanchet@33192
  1043
        end
blanchet@33192
  1044
blanchet@48323
  1045
    val batches = chunk_list batch_size (!scopes)
blanchet@33192
  1046
    val outcome_code =
blanchet@40411
  1047
      run_batches 0 (length batches) batches
blanchet@40411
  1048
                  (false, max_potential, max_genuine, 0)
blanchet@33192
  1049
      handle TimeLimit.TimeOut =>
blanchet@47560
  1050
             (print_nt (fn () => excipit "ran out of time after checking");
blanchet@43020
  1051
              if !met_potential > 0 then potentialN else unknownN)
blanchet@40341
  1052
    val _ = print_v (fn () =>
blanchet@52031
  1053
                "Total time: " ^ string_of_time (Timer.checkRealTimer timer) ^
blanchet@40341
  1054
                ".")
blanchet@33192
  1055
  in (outcome_code, !state_ref) end
blanchet@33192
  1056
blanchet@41051
  1057
(* Give the inner timeout a chance. *)
blanchet@41772
  1058
val timeout_bonus = seconds 1.0
blanchet@41051
  1059
blanchet@43022
  1060
fun pick_nits_in_term state (params as {debug, timeout, expect, ...}) mode i n
blanchet@47715
  1061
                      step subst def_assm_ts nondef_assm_ts orig_t =
blanchet@47670
  1062
  let
blanchet@47670
  1063
    val print_nt = if is_mode_nt mode then Output.urgent_message else K ()
blanchet@47670
  1064
    val print_t = if mode = TPTP then Output.urgent_message else K ()
blanchet@47670
  1065
  in
blanchet@37213
  1066
    if getenv "KODKODI" = "" then
blanchet@37497
  1067
      (* The "expect" argument is deliberately ignored if Kodkodi is missing so
blanchet@37497
  1068
         that the "Nitpick_Examples" can be processed on any machine. *)
blanchet@49024
  1069
      (print_nt (Pretty.string_of (plazy kodkodi_not_installed_message));
blanchet@37497
  1070
       ("no_kodkodi", state))
blanchet@37213
  1071
    else
blanchet@37213
  1072
      let
blanchet@43020
  1073
        val unknown_outcome = (unknownN, state)
blanchet@37213
  1074
        val deadline = Option.map (curry Time.+ (Time.now ())) timeout
blanchet@37213
  1075
        val outcome as (outcome_code, _) =
blanchet@41051
  1076
          time_limit (if debug orelse is_none timeout then NONE
blanchet@41051
  1077
                      else SOME (Time.+ (the timeout, timeout_bonus)))
blanchet@43022
  1078
              (pick_them_nits_in_term deadline state params mode i n step subst
blanchet@47715
  1079
                                      def_assm_ts nondef_assm_ts) orig_t
blanchet@37213
  1080
          handle TOO_LARGE (_, details) =>
blanchet@47670
  1081
                 (print_t "% SZS status Unknown";
blanchet@47670
  1082
                  print_nt ("Limit reached: " ^ details ^ "."); unknown_outcome)
blanchet@37213
  1083
               | TOO_SMALL (_, details) =>
blanchet@47670
  1084
                 (print_t "% SZS status Unknown";
blanchet@47670
  1085
                  print_nt ("Limit reached: " ^ details ^ "."); unknown_outcome)
blanchet@37213
  1086
               | Kodkod.SYNTAX (_, details) =>
blanchet@47670
  1087
                 (print_t "% SZS status Unknown";
blanchet@47670
  1088
                  print_nt ("Malformed Kodkodi output: " ^ details ^ ".");
blanchet@37213
  1089
                  unknown_outcome)
blanchet@41772
  1090
               | TimeLimit.TimeOut =>
blanchet@47670
  1091
                 (print_t "% SZS status TimedOut";
blanchet@47670
  1092
                  print_nt "Nitpick ran out of time."; unknown_outcome)
blanchet@37213
  1093
      in
blanchet@37213
  1094
        if expect = "" orelse outcome_code = expect then outcome
blanchet@37213
  1095
        else error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
blanchet@37213
  1096
      end
blanchet@37213
  1097
  end
blanchet@33192
  1098
wenzelm@42486
  1099
fun is_fixed_equation ctxt
blanchet@35335
  1100
                      (Const (@{const_name "=="}, _) $ Free (s, _) $ Const _) =
wenzelm@42486
  1101
    Variable.is_fixed ctxt s
blanchet@35335
  1102
  | is_fixed_equation _ _ = false
blanchet@35335
  1103
fun extract_fixed_frees ctxt (assms, t) =
blanchet@35335
  1104
  let
blanchet@35335
  1105
    val (subst, other_assms) =
wenzelm@42486
  1106
      List.partition (is_fixed_equation ctxt) assms
blanchet@35335
  1107
      |>> map Logic.dest_equals
blanchet@35335
  1108
  in (subst, other_assms, subst_atomic subst t) end
blanchet@35335
  1109
blanchet@43022
  1110
fun pick_nits_in_subgoal state params mode i step =
blanchet@33192
  1111
  let
blanchet@33192
  1112
    val ctxt = Proof.context_of state
wenzelm@33292
  1113
    val t = state |> Proof.raw_goal |> #goal |> prop_of
blanchet@33192
  1114
  in
blanchet@34982
  1115
    case Logic.count_prems t of
blanchet@43020
  1116
      0 => (Output.urgent_message "No subgoal!"; (noneN, state))
blanchet@34982
  1117
    | n =>
blanchet@33192
  1118
      let
blanchet@36406
  1119
        val t = Logic.goal_params t i |> fst
blanchet@33192
  1120
        val assms = map term_of (Assumption.all_assms_of ctxt)
blanchet@35335
  1121
        val (subst, assms, t) = extract_fixed_frees ctxt (assms, t)
blanchet@47715
  1122
      in pick_nits_in_term state params mode i n step subst [] assms t end
blanchet@33192
  1123
  end
blanchet@33192
  1124
blanchet@33192
  1125
end;