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