1 % (c) 2009-2025 Lehrstuhl fuer Softwaretechnik und Programmiersprachen,
2 % Heinrich Heine Universitaet Duesseldorf
3 % This software is licenced under EPL 1.0 (http://www.eclipse.org/org/documents/epl-v10.html)
4
5 % tcltk_interface.pl
6 :- module(tcltk_interface,[
7 tcltk_goto_state/2,
8 tcltk_add_new_transition_transid/6,
9 tcltk_add_new_transition/5,
10 tcltk_get_options/1, tcltk_get_options_dest_info/1, tcltk_get_state/1, tcltk_get_state/2,
11 tcltk_get_options_or_candidates/1, tcltk_get_options_candidate_nr_name/2,
12 potentially_enabled_operation/4,
13 tcltk_get_options_nr_description/2,
14 tcltk_get_history_nr_description/2,
15 tcltk_get_history_nr_origin_str/2, tcltk_edit_history_nr_origin_str/1,
16
17 tcltk_get_state_errors/1, tcltk_get_detailed_state_error/6,
18 tcltk_open_state_error_in_editor/1,
19 tcltk_get_line_col/5,
20 tcltk_current_state_invariant_violated/0,
21 tcltk_get_status/3,
22 tcltk_get_ops_with_virtual_timeout/1,
23 tcltk_get_ops_with_real_timeout/1,
24 tcltk_get_ops_user_interrupt_occurred/0,
25
26 tcltk_compute_options/2,
27 can_generate_dot_from_last_state_error/0,
28 tcltk_initialise/0, tcltk_reset/0,
29
30 tcltk_perform_nr/1, tcltk_random_perform/0, tcltk_random_perform/1,
31 tcltk_perform_nr_option/3,
32 tcltk_perform_action_term/2,
33 tcltk_is_sync_event/1,
34
35 tcltk_exists_an_open_node/0, tcltk_goto_an_open_node/0,
36 tcltk_goto_max_reached_node/0, tcltk_goto_timeout_node/0,
37 tcltk_state_exists_with_invariant_violated/0,
38 tcltk_goto_an_invariant_violation/0, tcltk_goto_node_with_id/1,
39 tcltk_try_goto_node_with_id/1,
40 tcltk_current_node_has_no_real_transition/0, tcltk_current_node_has_real_transition/0,
41 tcltk_current_node_has_partial_transition/0,
42 tcltk_goto_a_non_deterministic_node/1, tcltk_goto_a_non_deterministic_output_node/1,
43 tcltk_goto_a_branching_node/0, tcltk_goto_a_non_resetable_node/0,
44 tcltk_state_space_only_has_root_node/0, tcltk_no_constants_or_no_inititalisation_found/0,
45 tcltk_goto_event_list_property_violation/3, tcltk_goto_state_enabling_operation/2,
46 tcltk_find_max_reached_node/0, tcltk_find_max_reached_node/1,
47 tcltk_search_among_existing_nodes/6,
48 find_invariant_violation_among_not_checked_nodes/1,
49
50 tcltk_model_check/12, do_model_check/13,
51 tcltk_set_dbf_mode/1, tcltk_dbf_modes/1,
52 tcltk_mark_current_node_to_be_recomputed_wo_timeout/0,
53 tcltk_mark_current_node_to_be_recomputed_with_random_enum/0,
54 tcltk_finish_current_node_to_be_recomputed_with_random_enum/0,
55 tcltk_hash_model_checking_imprecise/0,
56 tcltk_clear_state_space_and_refocus_to_current_state/0,
57
58 tcltk_constraint_based_check/1,
59 tcltk_constraint_based_check_op/2, tcltk_constraint_based_check_op/3,
60 tcltk_constraint_based_check/2, tcltk_constraint_based_check_with_timeout/2,
61 tcltk_cbc_find_trace/2, tcltk_cbc_find_trace/4,
62 tcltk_cbc_refinement_check/2,
63 tcltk_constraint_find_valid_state/0,
64 tcltk_constraint_find_maximal_valid_state/0,
65 tcltk_constraint_find_dynamic_assertion_violation/0,
66 tcltk_constraint_find_valid_state_with_pred/3,
67 tcltk_constraint_find_deadlock_state/1,
68 tcltk_constraint_find_deadlock_state_with_goal/2,
69 tcltk_constraint_find_deadlock_state_with_goal/3,
70 tcltk_constraint_find_static_assertion_violation/1,
71 tcltk_check_if_feasible_operation/4,
72 cbc_constraint_find_static_assertion_violation/2,
73
74 tcltk_can_backtrack/0, tcltk_can_backtrack/1,
75 tcltk_can_forward/0, tcltk_can_forward/1,
76 tcltk_prepare_for_reload/0,
77 tcltk_backtrack/0, tcltk_backtrack/1, tcltk_fast_forward/0, tcltk_forward/0,
78 tcltk_execute_trace_to_current_node/0, tcltk_find_shortest_trace_to_current_node/1,
79 tcltk_execute_longest_trace_from/1,
80 tcltk_get_history/1,
81 tcltk_perform_action_string/3,
82 tcltk_perform_action/2,
83 tcltk_perform_action/4,
84
85 tcltk_open_xtl_file/1,
86 tcltk_open_z_file/1, tcltk_open_z_tex_file/1,
87 tcltk_open_alloy_file/1, tcltk_open_alloy_prolog_ast_file/1,
88 tcltk_open_cspm_file/1,
89 tcltk_add_csp_file/1,
90 tcltk_load_packaged_eventb_file/1,
91
92 tcltk_verify_alloy_cmd/4,
93 tcltk_get_alloy_cmd_names/1,
94 tcltk_load_alloy_cmd_in_current_translation/1,
95
96 tcltk_machine_has_assertions/0,
97 tcltk_unique_top_level_operation/1, tcltk_top_level_operations/1,
98
99 compute_all_transitions_if_necessary/0,
100 compute_all_transitions_if_necessary/2,
101 compute_state_information_if_necessary/0, % compute transitions and invariant
102 compute_invariant_if_necessary/3,
103 check_invariantKO/2,
104 check_invariantKO/3,
105 catch_clpfd_overflow_call_for_state/4,
106 compute_ample_set/3,
107 compute_all_transitions/2,
108 add_transition/4,
109 add_trans_id/5,
110
111 tcltk_has_eventtrace/1, tcltk_show_eventtrace/2,
112 tcltk_execute_model/3,
113 tcltk_execute_trace_to_node/1,
114 find_shortest_trace_to_node/4,
115
116 tcltk_explore_csp_process/2, tcltk_visualize_csp_process/2,
117 get_csp_process_id/2, get_csp_process_stats/1,
118
119 tcltk_add_user_executed_operation/2, tcltk_add_user_executed_operation/3,
120 tcltk_add_user_executed_operation_typed/4, tcltk_add_user_executed_operation_typed/6,
121 tcltk_add_user_executed_statement/3,
122 tcltk_add_user_modify_variable_transition/2, tcltk_add_user_modify_variable_transition/4,
123
124 tcltk_analyse_option/2,
125 tcltk_analyse/6,
126 tcltk_show_typing_of_variables_and_constants/1,
127 tcltk_show_current_state/1,
128 tcltk_eval/4, interruptable_tcltk_eval/4,
129 tcltk_eval_as_table/2,
130 tcltk_find_value_as_table/3, find_value_in_cur_state/4,
131 tcltk_time_call/1, eval_elapsed_time/1,
132 tcltk_check_csp_assertions/2, tcltk_check_csp_assertion/4, tcltk_check_csp_assertion/5,
133 checkAssertion/5,
134 tcltk_get_vacuous_guards/1,
135 tcltk_get_vacuous_invariants/1, tcltk_get_vacuous_invariants_table/1,
136 tcltk_operations_covered_info/3, operation_name_covered/1,
137 tcltk_show_expression_as_dot/2,
138 generate_dot_from_formula/2,
139 generate_dot_from_invariant/1, generate_dot_from_properties/1, generate_dot_from_assertions/1,
140 generate_dot_from_deadlock_po/1, generate_dot_from_goal/1, generate_dot_from_last_span_predicate/1,
141 generate_dot_from_operation/2, generate_dot_from_operation_with_params/4,
142 write_dot_file_for_pred_expr/2,
143 write_dot_file_for_value_as_tree/2,
144 evaluate_expression_over_history_to_csv_file/2, tcltk_evaluate_expression_over_history/2,
145 translate_error_for_tclk/2,
146 tcltk_set_initial_machine/0, tcltk_clear_machine/0,
147 % set_tcltk_cspm_mode/0, unset_tcltk_cspm_mode/0,
148 tcltk_open_b_file/1, tcltk_open_b_file_for_minor_mode/2,
149 tcltk_run_ltsmin/5,
150 tcltk_save_history_as_trace_file/1,
151 tcltk_execute_until/1,
152
153 tcltk_bv_get_tops/1,
154 tcltk_bv_get_structure/3,
155 tcltk_bv_is_leaf/2,
156 tcltk_bv_get_values/3,
157 tcltk_bv_get_value/3,
158 tcltk_bv_show_formula_as_dot_tree/2,
159 tcltk_bv_show_formula_as_dot_graph/2,
160 tcltk_bv_show_value_as_dot_tree/2,
161 tcltk_bv_get_pp_formula_string/2,
162 tcltk_show_identifier_value_as_dot_tree/2, % a version of the above independent of bvisual
163 tcltk_bv_get_unlimited_value/3, tcltk_bv_get_unlimited_value_atom/2,
164
165 tcltk_get_constants_predicate/1, tcltk_get_constants_predicate/3,
166
167 get_cbc_data_base_id_checks/1, get_cbc_data_base_text_checks/1,
168
169 tcltk_write_uml_sequence_chart/1,
170
171 get_ltl_formulas_from_file/2,
172 tcltk_mcts_auto_play/0, tcltk_mcts_auto_play/1, mcts_auto_play_available/0,
173 tcltk_simplify_predicate/2 % not used
174
175 ]).
176
177
178 :- meta_predicate call_pred_on_expanded_state(3,-,-,-).
179 :- meta_predicate map_over_history(3,-).
180 :- meta_predicate tcltk_time_call(0).
181 :- meta_predicate catch_clpfd_overflow_call_for_state(-,-,0,0).
182 :- meta_predicate add_csp_process_id1(-,-,1).
183
184 %prob_use_module(X) :- load_files(X,[if(changed),load_type(source),compilation_mode(compile)]).
185
186 /* load all necessary modules */
187 :- use_module(library(random)).
188 :- use_module(library(lists)).
189
190 :- use_module(library(ordsets)).
191 :- use_module(library(avl)).
192
193 :- use_module(module_information).
194 :- module_info(group,tcltk).
195 :- module_info(description,'Interface between the Tcl/Tk GUI, the CLI and the internal modules.').
196
197 :- use_module(typechecker).
198 :- use_module(self_check).
199 :- use_module(probsrc(preferences)).
200 :- use_module(probsrc(debug)).
201 :- use_module(error_manager).
202 :- use_module(kernel_waitflags).
203 :- use_module(probsrc(tools)).
204 :- use_module(probsrc(specfile)).
205 :- use_module(probsrc(state_space_exploration_modes)).
206 :- use_module(probsrc(translate)).
207 :- use_module(probsrc(b_state_model_check)).
208 :- use_module(probsrc(bmachine)).
209 :- use_module(probsrc(b_interpreter)).
210 :- use_module(probsrc(b_trace_checking)).
211 :- use_module(probsrc(bsyntaxtree)).
212 :- use_module(kernel_objects).
213 :- use_module(probsrc(state_space)).
214 :- use_module(extension('plspec/plspec/plspec_core'),[set_error_handler/1]).
215 :- use_module(extension('plspec/plspec/prettyprinter'),[pretty_print_error/1]).
216 prob_plspec_error_handler(ErrTerm) :- pretty_print_error(ErrTerm),
217 add_internal_error('Error detected by plspec',ErrTerm).
218 :- set_error_handler(tcltk_interface:prob_plspec_error_handler).
219 :- use_module(model_checker).
220 :- use_module(dotsrc(visualize_graph)).
221 :- use_module(dotsrc(state_space_reduction)).
222 :- use_module(dotsrc(state_custom_dot_graph)).
223 :- use_module(succeed_max).
224 %:- use_module(testcase_generator).
225 :- use_module(prozsrc(proz),[open_proz_file/2]).
226 :- use_module(dotsrc(reduce_graph_state_space)).
227 :- use_module(b_read_write_info).
228 %:- use_module(flow).
229 :- use_module(probltlsrc(ltl),[parse_and_preprocess_formula/3, parse_ltlfile/2,
230 pp_ltl_formula/2, ltl_model_check_with_ce1/5,
231 is_fairness_implication/1, tcltk_play_ltl_counterexample/2]).
232 :- use_module(probltlsrc(ctl),[ctl_model_check_with_ce/6, tcltk_play_ctl_counterexample/2]).
233 %:- use_module('promela/promela_ncprinter').
234 :- use_module(extrasrc(bvisual2),[bv_get_top_level/1, bv_expand_formula/3, bv_get_values/3, bv_get_btvalue/4,
235 bv_get_stored_formula_expr/2, bv_is_explanation_node/1, bv_get_value_unlimited/3]).
236 :- use_module(b_show_history).
237 :- use_module(probcspsrc(haskell_csp),[parse_single_csp_declaration/3]).
238 %:- use_module(probcspsrc(slicer_csp),[slice_from_program_point/14]).
239 :- use_module(value_persistance, [save_constants/1,add_new_transitions_to_cache/1]).
240 :- use_module(cbcsrc(cbc_path_solver),[create_testcase_path_nondet/4,verify_alloy_command/5]).
241 :- use_module(dotsrc(uml_generator),[write_uml_sequence_chart/1]).
242
243 /* main program
244 * ============
245 */
246
247
248 /*
249 Start server for LTSmin
250 */
251
252 :- use_module(extension('ltsmin/ltsmin'),[start_ltsmin/4]).
253
254
255 % Backend = symbolic or sequential
256 tcltk_run_ltsmin(Backend,NoDead,NoInv,UsePOR,Res) :-
257 % in case of POR we can also enable/disable use_cbc_analysis preference
258 (UsePOR == true -> MoreFlags = [por] ; MoreFlags=[]),
259 start_ltsmin(Backend, [NoDead, NoInv], MoreFlags,Result),
260 get_check_name(NoDead,NoInv,Kind),
261 process_ltsmin_result(Result,Kind,Res).
262
263 % get_check_name(+NoDead,+NoInv,-Kind)
264 get_check_name(true,false,Kind) :- Kind = 'INVARIANT'.
265 get_check_name(false,true,Kind) :- Kind = 'DEADLOCK'.
266
267 :- use_module(tools_printing,[format_with_colour_nl/4]).
268 :- use_module(extension('ltsmin/ltsmin_trace'),[csv_to_trace/3]).
269 process_ltsmin_result(ltsmin_model_checking_ok,Kind,no_counter_example_found) :-
270 format_with_colour_nl(user_output,green,'LTSMin found no ~w Counter Example',Kind).
271 process_ltsmin_result(ltsmin_counter_example_found(CsvFile),Kind,counter_example_found) :-
272 format_with_colour_nl(user_output,[red,bold],'LTSMin found ~w Counter Example',Kind),
273 csv_to_trace(CsvFile,States,Transitions),
274 length(Transitions,TLen), format('*** REPLAYING TRACE with length ~w: ~w~n', [TLen, Transitions]),
275 % print(States),nl,
276 % length(States,SLen), print(state_len(SLen)),nl,
277 (replay_ltsmin_trace(States,Transitions) -> true
278 ; add_error(process_ltsmin_result,'Could not replay trace:',Transitions)).
279
280 replay_ltsmin_trace([],[]).
281 replay_ltsmin_trace([State|TS],[TransName|TT]) :-
282 (find_successor_state(State,TransName)
283 -> replay_ltsmin_trace(TS,TT)
284 ; add_error(replay_ltsmin_trace,'Could not execute:',trans_to(TransName,State)),fail).
285
286 :- use_module(state_space,[visited_expression/2]).
287 find_successor_state(EState,'$init_state') :- !,
288 tcltk_reset,
289 compute_all_inits, !,
290 is_initial_state_id(NewID),
291 visited_expression(NewID,State), % print(found_initial(State,EState,NewID)),nl,
292 expand_const_and_vars_to_full_store(State,EState), !,
293 tcltk_execute_trace_to_node(NewID).
294 find_successor_state(EState,TransName) :-
295 tcltk_get_options(_),
296 current_options(Options), % print(Options),nl,
297 member( (_,_Action,ActionOpAsTerm,NewID), Options),
298 get_operation_name(ActionOpAsTerm,TransName),
299 visited_expression(NewID,State), % print(found_transition(State,EState,NewID,ActionOpAsTerm)),nl,
300 expand_const_and_vars_to_full_store(State,EState), !, % TODO: only compare variables
301 tcltk_goto_state(ActionOpAsTerm,NewID).
302
303 % compute all INITIALISATIONS
304 compute_all_inits :- compute_all_transitions_if_necessary(root), fail.
305 compute_all_inits :- is_concrete_constants_state_id(ID), compute_all_transitions_if_necessary(ID), fail.
306 compute_all_inits.
307
308 /* -------------------------------------------------------------------- */
309
310 %tcltk_find_untyped_vars(Vs) :- find_untyped_vars(Vs), Vs \== [].
311
312 %tcltk_find_untyped_consts(Vs) :- find_untyped_consts(Vs), Vs \== [].
313
314
315 ?tcltk_find_max_reached_node :- tcltk_find_max_reached_node(_).
316 ?tcltk_find_max_reached_node(ID) :- max_reached_or_timeout_for_node(ID).
317
318
319 tcltk_current_node_has_no_real_transition :-
320 \+ tcltk_current_node_has_real_transition.
321 tcltk_current_node_has_real_transition :-
322 current_state_id(CurID),
323 transition(CurID,Trans,_),
324 (CurID \= root -> true
325 ; Trans = '$partial_setup_constants'
326 -> properties_were_filtered(Nr), Nr>0 % we probably have the partial transition due to prob-ignore pragmas
327 % TODO: detect whether any of the other non-ignored conjuncts were false/unknown
328 ; true),!.
329 tcltk_current_node_has_partial_transition :-
330 current_state_id(CurID),
331 transition(CurID,'$partial_setup_constants',_),!.
332
333 /* --------------------------------------------------------------------- */
334 tcltk_goto_state(ActionAsTerm,StateID) :-
335 (var(StateID) -> print_message(var_state(tcltk_goto_state(ActionAsTerm,StateID))) ; true),
336 (visited_expression_id(StateID)
337 -> true
338 ; ajoin(['State ',StateID,' does not exist. Could be due to insufficient memory. Transition: '],Msg),
339 add_warning(tcltk_goto_state,Msg,ActionAsTerm),
340 fail
341 ),
342 (current_state_id(CurID) -> true ; print('*** no_current_state_id ***'),nl),
343 ? ((transition(CurID,ActionAsTerm,OpID,StateID)
344 ; ActionAsTerm=jump, % jump is used by ProB2 and eclipse interface; TODO: use $jump or something similar to avoid confusion with real operation names
345 transition(CurID,_,OpID,StateID)
346 )
347 -> /* ok: proper transition */
348 set_current_state_id(StateID),
349 add_to_op_trace_ids(OpID),
350 add_id_to_history(CurID)
351 ; (CurID=StateID
352 -> true
353 ; ActionAsTerm=jump, find_id_in_history(StateID,Pos)
354 -> tcltk_backtrack(Pos)
355 ; ActionAsTerm=jump, find_id_in_forward_history(StateID,Pos)
356 -> tcltk_forward(Pos)
357 ; set_current_state_id(StateID),
358 add_to_op_trace_ids(jump(StateID)),
359 add_id_to_history(CurID)
360 )
361 ).
362
363 find_id_in_history(StateId,Position) :- history(H), nth1(Position,H,StateId).
364 find_id_in_forward_history(StateId,Position) :- forward_history(H), nth1(Position,H,forward(StateId,_)).
365
366 add_id_to_history(CurID) :-
367 (retract(history(History))->true ; add_warning(add_id_to_history,'No history for: ',CurID),History=[]),
368 (History=[],CurID\=root
369 -> add_message(add_id_to_history,'Adding missing root to history: ',CurID),
370 assertz(history([CurID,root])) % fix error in synchronisation between ProB2UI and prolog; should be fixed now
371 ; assertz(history([CurID|History]))
372 ),
373 retractall(forward_history(_)).
374
375
376
377 tcltk_add_new_transition(FromID,Action,ToID,ToTempl,TransInfo) :-
378 tcltk_add_new_transition_transid(FromID,Action,ToID,ToTempl,TransInfo,_TransId).
379
380 tcltk_add_new_transition_transid(FromID,Action,ToID,ToTempl,TransInfo,TransId) :-
381 add_new_transition_transid_with_infos(FromID,[],Action,ToID,ToTempl,TransInfo,TransId).
382
383 % variation with precomputed infos for the initial id (FromID)
384 add_new_transition_transid_with_infos(FromID,PrecomputedInfos,Action,ToID,ToTempl,TransInfo,TransId) :-
385 get_operation_internal_name(Action,OpName), % will use $initialise_machine; important for test 961 and PROOF_INFO
386 get_id_of_node_and_add_if_required_with_skip_check(ToTempl,ToID,Exists,FromID,OpName,PrecomputedInfos),
387 %% print_message(tcltk_add_new_transition(FromID,Action,ToID,Exists)), %%
388 ( Exists=exists,
389 (preferences:preference(store_only_one_incoming_transition,true),
390 \+ operation_not_yet_covered(OpName) % otherwise store at least one transition to achieve coverage
391 %-> transition(FromID,_,_,_) % add transition to prevent deadlock being detected
392 ? ; transition(FromID,Action,TransId,ToID)
393 )
394 -> true % // the transition already exists
395 ; % we have a new transition:
396 (preferences:preference(forget_state_space,true)
397 -> (any_transition(FromID,_,_) -> true
398 ; store_transition(FromID,'$NO_DEADLOCK',FromID,TransId)) /* just add dummy transition */
399 ; store_transition(FromID,Action,ToID,TransId
400 ),
401 (store_transition_infos(TransInfo,TransId) -> true
402 ; add_internal_error('storing transition info failed', store_transition_infos(TransInfo,TransId)))
403 ),
404 mark_operation_as_covered(OpName),
405 (FromID \= ToID, b_or_z_mode, not_all_transitions_added(ToID)
406 -> add_additional_destination_infos(FromID,OpName,ToID) % e.g., PROOF_INF
407 ; true
408 )
409 ).
410
411 % a version that checks for query/skip operations and then simply returns old id
412 get_id_of_node_and_add_if_required_with_skip_check(_ToTempl,ToID,Exists,FromID,OpName,_PrecomputedInfos) :-
413 animation_mode(b), % csp_and_b mode is *not* ok ; see test 1701 for example
414 b_operation_cannot_modify_state(OpName),
415 !,
416 Exists=exists,ToID=FromID.
417 get_id_of_node_and_add_if_required_with_skip_check(ToTempl,ToID,Exists,FromID,OpName,PrecomputedInfos) :-
418 get_id_of_node_and_add_if_required(ToTempl,ToID,Exists,FromID,OpName,PrecomputedInfos).
419
420
421
422 % will only be called for ToID different from FromID
423 add_additional_destination_infos(FromID,ActionName,ToID) :- %print(add_dest(FromID,ActionName,ToID)),nl,
424 ( b_operation_preserves_invariant(ActionName,Full),
425 \+ invariant_still_to_be_checked(FromID),
426 \+ invariant_violated(FromID) % if Invariant does not hold in previous state, we have no idea about invariants in the new state (proof assumes invariant holds before)
427 ->
428 (retract(specialized_inv(ToID,OldAVL)) -> true ; empty_avl(OldAVL)),
429 (Full=full_invariant
430 -> assertz(specialized_inv(ToID,invariant_preserved))
431 % unfortunately we cannot yet retract invariant_not_yet_checked
432 ; OldAVL=invariant_preserved
433 -> assertz(specialized_inv(ToID,invariant_preserved))
434 ; avl_store(ActionName,OldAVL,nothing,NewAVL),
435 %print(specialized_inv(ToID,NewAVL)),nl,
436 assertz(specialized_inv(ToID,NewAVL))
437 )
438 ; true
439 ).
440 /*
441 Store names of incoming transitions in an AVL tree
442 Used to calculate invariant in presence of proof information
443 */
444 % we could store this information to allow us to quickly generate traces from root to any state
445 %add_additional_destination_infos(FromID,ActionName,ToID) :-
446 % (reached_via(ToID,_,_) -> true ; %TODO: probably we should also store transition id
447 % assertz(reached_via(ToID,ActionName,FromID))).
448 % TO DO: we could store pge disabling information here disabled_operations
449
450
451
452
453 :- use_module(state_space_exploration_modes,[set_depth_breadth_first_mode/1,dbf_modes/3]).
454
455
456 tcltk_set_dbf_mode(Nr) :- dbf_modes(Nr,Mode,_),!,
457 set_depth_breadth_first_mode(Mode).
458 tcltk_set_dbf_mode(Nr) :- add_error(tcltk_set_dbf_mode,'Unknown mode: ',Nr).
459
460 tcltk_dbf_modes(list(Names)) :- findall(N,dbf_modes(_,_,N),Names).
461
462
463 :- dynamic prev_randomise_enumeration_order/1.
464
465
466 tcltk_mark_current_node_to_be_recomputed_wo_timeout :-
467 current_state_id(CurID),
468 format('Recomputing state id=~w without TIME_OUT~n',[CurID]),
469 tcltk_mark_node_for_recomputed(CurID),
470 (use_no_timeout(CurID) -> true ; assertz(use_no_timeout(CurID))).
471
472 % used for recomputing a state with random enumeration
473 tcltk_mark_current_node_to_be_recomputed_with_random_enum :-
474 current_state_id(CurID),
475 format('Recomputing state id=~w with random enumeration~n',[CurID]),
476 tcltk_mark_node_for_recomputed(CurID),
477 % retractall(transition(CurID,_,_,_)), % we no longer delete the transitions; this can cause problems with the history
478 % (if CurID appears earlier in the history and we remove the transition) and lead to error messages
479 % also: for the user it may be good to add new transitions incrementally
480 temporary_set_preference(randomise_enumeration_order,true,PREV),
481 assertz(prev_randomise_enumeration_order(PREV)).
482
483 tcltk_finish_current_node_to_be_recomputed_with_random_enum :-
484 retract(prev_randomise_enumeration_order(PREV)),
485 reset_temporary_preference(randomise_enumeration_order,PREV).
486
487 tcltk_mark_node_for_recomputed(ID) :-
488 (not_all_transitions_added(ID) -> true
489 ; add_id_at_front(ID)),
490 retractall(max_reached_for_node(ID)),
491 retractall(time_out_for_node(ID,_,_)),
492 % TODO: clear b_operation_cache:operation_cached_time_out for relevant nodes
493 (transition(ID,'$partial_setup_constants',ID2)
494 -> delete_node(ID2) ; true),
495 retractall(state_space:transition(ID,'$partial_setup_constants',_,_)).
496
497 transitions_computed_for_node(ID) :-
498 \+(not_all_transitions_added(ID)),
499 \+ is_not_interesting(ID).
500
501
502
503
504 tcltk_set_initial_machine :-
505 tcltk_clear_machine,
506 b_set_initial_machine,
507 set_animation_mode(b).
508
509 % new profiler
510 %:- use_module('../extensions/profiler/profiler.pl').
511 % old profiler
512 %:- use_module(runtime_profiler,[reset_runtime_profiler/0]).
513
514 % the following clears the entire state space and uses the current state as now starting initial state
515 tcltk_clear_state_space_and_refocus_to_current_state :-
516 Op = 'REFOCUS-ANIMATOR',
517 current_expression(_CurID,CurState),
518 (CurState = const_and_vars(ConstID,VarState) ->
519 visited_expression(ConstID,ConstState),
520 transition(root,SetupConstantAction,_,ConstID)
521 ; ConstState=[]),
522 announce_event(reset_specification),
523 (ConstState=[]
524 -> add_trans_id(root,Op,CurState,NewID,_TransId)
525 ; add_trans_id(root,SetupConstantAction,ConstState,NewConstID,_),
526 add_trans_id(NewConstID,Op,const_and_vars(NewConstID,VarState),NewID,_),
527 (retract_open_node(NewConstID) -> true ; true),
528 tcltk_goto_state(Op,NewConstID)
529 ),
530 tcltk_goto_state(Op,NewID),
531 (retract_open_node(root) -> true ; true).
532
533 :- use_module(eventhandling, [announce_event/1]).
534 tcltk_clear_machine :-
535 announce_event(reset_specification),
536 announce_event(clear_specification),
537 reset_tcltk_interface,
538 set_animation_mode(b),
539 bmachine:b_set_empty_machine,
540 reset_errors,
541 % reset_dynamics, % new profiler
542 % Now done via event handling: b_interpreter:reset_b_interpreter,reset_model_checker,
543 garbage_collect_atoms. % reclaim atoms if possible
544
545 :- use_module(prob2_interface, [start_animation/0, update_preferences_from_spec/0]).
546 tcltk_initialise :-
547 update_preferences_from_spec,
548 start_animation,
549 tcltk_try_reload.
550
551 tcltk_reset :- reset_errors,
552 history(H), op_trace_ids(T),
553 current_state_id(CurID),
554 (forward_history(FH) -> true ; FH=[]),
555 state_space_reset,
556 gen_forward_history(T,[CurID|H],FH,FwdHist),
557 retractall(forward_history(_)),
558 assertz(forward_history(FwdHist)).
559
560 gen_forward_history([],H,R,R) :- (H=[root] -> true ; print(unexpected_remaining_hist(H)),nl).
561 gen_forward_history([A|TT],[ID|TH],Acc,Res) :-
562 gen_forward_history(TT,TH,[forward(ID,A)|Acc],Res).
563
564
565
566 /* ---- getting available options ----- */
567
568 tcltk_get_options_dest_info(L) :-
569 tcltk_get_options_dest_info(L,[]). %[no_query_operations]).
570 tcltk_get_options_dest_info(list(DestinationInfos),Options) :-
571 debug_println(9,start_tcltk_get_options_dest_info),
572 % get a list of all options which are skip events
573 current_state_id(CurID),
574 compute_all_transitions_if_necessary(CurID),
575 tcltk_get_candidates_dest_info(List1),
576 findall(Res, (transition(CurID,ActionAsTerm,ID), % check no_query_operations
577 (member(no_query_operations,Options) -> \+ query_op_transition(ActionAsTerm) ; true),
578 option_dest_info(ID,ActionAsTerm,CurID,Res)),
579 DestinationInfos,List1).
580
581 option_dest_info(DestID,ActionAsTerm,CurID,Res) :- DestID=CurID,!,
582 (query_op_transition(ActionAsTerm) -> Res=query ; Res=skip).
583 option_dest_info(DestID,_,_,Res) :- not_all_transitions_added(DestID),!, Res=open.
584 option_dest_info(DestID,_,_,Res) :- invariant_violated(DestID),!,Res=invariant_violated.
585 option_dest_info(DestID,_,_,Res) :- is_deadlocked(DestID),!,Res=deadlock.
586 option_dest_info(DestID,_,_,Res) :- node_satisfies_goal(DestID),!,Res=goal.
587 option_dest_info(_DestID,_,_,unknown).
588
589 query_op_transition(Term) :- b_or_z_mode,
590 get_operation_name(Term,OpName),
591 b_operation_cannot_modify_state(OpName).
592
593 tcltk_get_options(O) :-
594 tcltk_get_options(O,[]). %[no_query_operations]).
595 tcltk_get_options(list(Options),Parameters) :-
596 current_state_id(CurID), debug_println(9,start_tcltk_get_options(CurID)),
597 catch(tcltk_compute_options(CurID,TransSpecs), user_interrupt_signal, (
598 assert_time_out_for_node(CurID,'unspecified_operation_interrupted_by_user',user_interrupt_signal),
599 tcltk_get_computed_options(CurID,TransSpecs)
600 )),
601 extract_actions(TransSpecs,CurID,Parameters,ActionsAndIDs,Actions),
602 set_current_options(ActionsAndIDs),
603 %print(Actions),nl,
604 debug_println(9,finished_tcltk_get_options(CurID)),
605 Actions = Options.
606
607 :- dynamic current_candidate_options/1.
608
609 % a newer version of tcltk_options which returns list of potentially enabled events
610 % in case MAX_OPERATIONS is set to 0; these virtual events are appended at the end of the
611 % current transitions (which at the start are empty; but can be populated by executed by predicate)
612 tcltk_get_options_or_candidates(list(List)) :-
613 retractall(current_candidate_options(_)),
614 tcltk_get_options(list(List1)),
615 current_state_id(CurID),
616 (\+ \+ max_operations_zero_for_operation(_), %preference(maxNrOfEnablingsPerOperation,0),
617 CurID \= root,
618 \+ is_concrete_constants_state_id(CurID) % we could provide setup_constants or initialisation in other states
619 -> tcltk_get_candidate_operations(Candidates),
620 assert(current_candidate_options(Candidates)),
621 maplist(get_cand_name,Candidates,List2),
622 append(List1,List2,List)
623 ; List=List1).
624 get_cand_name(candidate(OpName,TO),OpNameRes) :-
625 (TO==true -> ajoin([OpName,' (*timeout*)'],OpNameRes) ; OpNameRes=OpName).
626
627
628 :- use_module(specfile,[max_operations_zero_for_operation/1]).
629 % in case of MAX_OPERATIONS=0 just show the potentially enabled operations
630 tcltk_get_candidate_operations(Candidates) :-
631 current_state_id(CurID),
632 findall(candidate(OpName,TO), (max_operations_zero_for_operation(OpName),
633 potentially_enabled_operation(CurID,OpName,TO,_Precise)),Candidates).
634
635 :- use_module(tools_timeout,[time_out_with_factor_call/4]).
636 % get operations with MAX_OPERATIONS=0 which are potentially enabled
637 potentially_enabled_operation(StateId,OpName,TimeOutOccurred,PreciseGuard) :- b_or_z_mode,
638 b_top_level_operation(OpName),
639 max_operations_zero_for_operation(OpName),
640 Simplify=true,
641 get_quantified_operation_enabling_condition(OpName, Guard, _, PreciseGuard, Simplify),
642 (time_out_with_factor_call(
643 eclipse_interface:test_boolean_expression_in_node(StateId,Guard,'operation Guard'),
644 0.1, [max_time_out(2000),
645 silent],
646 (format('TIME-OUT checking if ~w is enabled; assuming it could be.~n',[OpName]),TimeOutOccurred=true)
647 )
648 -> (var(TimeOutOccurred) -> TimeOutOccurred=false ; true)).
649
650 % get the name of a currently stored candidate option/operation
651 % the option list was empty and we inserted a list of candidate operations
652 % (e.g., because MAX_OPERATIONS was 0)
653 tcltk_get_options_candidate_nr_name(Nr,OpName) :-
654 current_candidate_options(List),
655 current_options(List1), length(List1,Len),
656 N1 is Nr-Len, % the candidate of potentially enabled events are listed after the regular options
657 nth1(N1,List,candidate(OpName,_)).
658
659 % get destination info for candidate operations in the Operations View
660 tcltk_get_candidates_dest_info(L) :- current_state_id(CurID),
661 current_candidate_options(Cands),!,
662 maplist(get_cand_dest(CurID),Cands,L).
663 tcltk_get_candidates_dest_info([]).
664 get_cand_dest(_,candidate(_,true),R) :- !, R=time_out.
665 get_cand_dest(CurID,candidate(OpName,_),Res) :-
666 transition(CurID,ActionTerm,_ActId,_DestID),
667 get_operation_name(ActionTerm,OpName),!,
668 % it is a candidate for which we already have a transition
669 Res = reached_candidate.
670 get_cand_dest(_,_,candidate).
671
672 :- use_module(tools_timeout,[time_out_call/2]).
673 :- use_module(translate,[translate_event_with_src_and_target_id/4]).
674 extract_actions([],_,_,[],[]).
675 extract_actions([(_,Term,_)|T],CurID,Parameters,Srest,ET) :-
676 member(no_query_operations,Parameters),
677 query_op_transition(Term),
678 !,
679 extract_actions(T,CurID,Parameters,Srest,ET).
680 extract_actions([(ActionId,Term,Dst)|T],CurID,Parameters,[(ActionId,Str,Term,Dst)|Srest],[Str|ET]) :-
681 time_out_call(translate_event_with_src_and_target_id(Term,CurID,Dst,Str),
682 Str='**TIMEOUT**'),
683 extract_actions(T,CurID,Parameters,Srest,ET).
684
685 % compute transitions and invariant info
686 compute_state_information_if_necessary :-
687 current_state_id(CurID),
688 compute_state_information_if_necessary(CurID).
689 compute_state_information_if_necessary(CurID) :-
690 compute_all_transitions_if_necessary(CurID,true). % CheckInvariant=true
691
692 tcltk_compute_options(CurID,ActionsAndIDs) :-
693 compute_state_information_if_necessary(CurID),
694 %print(found_transitions(CurID)),nl,
695 tcltk_get_computed_options(CurID,ActionsAndIDs).
696
697 tcltk_get_computed_options(CurID,ActionsAndIDs) :-
698 findall((ActId,ActionAsTerm,DestID),
699 transition(CurID,ActionAsTerm,ActId,DestID),
700 % TO DO: sort or group, especially if we randomize transition/3
701 ActionsAndIDs).
702
703 tcltk_get_status(INVVIOLATED,MAXREACHED,TIMEOUT) :- debug_println(9,start_tcltk_get_status),
704 current_state_id(CurID),
705 (time_out_for_invariant(CurID) -> INVVIOLATED = 2
706 ; get_invariant_violated(CurID) -> INVVIOLATED = 1
707 ; not_invariant_checked(CurID) -> INVVIOLATED = 3
708 ; not_interesting(CurID) -> INVVIOLATED = 3
709 ; INVVIOLATED = 0
710 ),
711 (max_reached_for_node(CurID) -> MAXREACHED = 1
712 ; not_interesting(CurID) -> MAXREACHED = 2
713 ; MAXREACHED = 0),
714 (time_out_for_node(CurID,_,time_out) -> TIMEOUT = 1
715 ; time_out_for_node(CurID,_,user_interrupt_signal) -> TIMEOUT = 3 % CTRL-C
716 ; time_out_for_node(CurID,_,virtual_time_out(kodkod_timeout)) -> TIMEOUT = 1 % KODKOD; regular time-out
717 ; time_out_for_node(CurID,_,_) -> TIMEOUT = 2 % virtual_time_out
718 ; TIMEOUT = 0),
719 debug_println(9,got_status(INVVIOLATED,MAXREACHED,TIMEOUT)).
720
721 tcltk_get_ops_with_virtual_timeout(OpNameList) :-
722 current_state_id(StateId),
723 ops_with_timeout(StateId,OpNameList,virtual_time_out(_)).
724 tcltk_get_ops_with_real_timeout(OpNameList) :-
725 current_state_id(StateId),
726 ops_with_timeout(StateId,OpNameList,time_out).
727 % Note: possibilities are currently: time_out, user_interrupt_signal, virtual_time_out(_)
728 tcltk_get_ops_user_interrupt_occurred :-
729 current_state_id(StateId),
730 time_out_for_node(StateId,_,user_interrupt_signal).
731 ops_with_timeout(StateId,OpNameList,Type) :-
732 findall(OpName, time_out_for_node(StateId,OpName,Type), OpNameList).
733
734
735 %%fd_copy_term(X,Y,true) :- copy_term(X,Y).
736
737
738
739 /* --------------------------------------------------------------------- */
740
741 tcltk_get_history(list(StringHistory)) :- debug_println(9,start_tcltk_get_trace),
742 get_action_trace(History),
743 convert_trace_to_list_of_strings(History,StringHistory).
744
745 convert_trace_to_list_of_strings([],[]).
746 convert_trace_to_list_of_strings([action(AS,_)|T],[AS|CT]) :- !,
747 %truncate_atom(AS,1000,TruncatedAS), % especially SETUP_CONSTANTS, INITIALISATION can be very large; leading to performance issues
748 % get_action_trace now truncates
749 convert_trace_to_list_of_strings(T,CT).
750 convert_trace_to_list_of_strings([H|T],[H|CT]) :- convert_trace_to_list_of_strings(T,CT).
751
752 tcltk_write_uml_sequence_chart(File) :-
753 write_uml_sequence_chart(File).
754
755 /* --------------------------------------------------------------------- */
756
757 :- dynamic cached_state_as_strings/2.
758 :- use_module(probsrc(state_space),[try_compute_depth_of_state_id/2]).
759 %tcltk_get_state(list(List)) :- !,List=[]. % comment in to disable State Properties View in ProB Tcl/Tk
760 tcltk_get_state(list(List)) :- debug_println(9,start_tcltk_get_state),
761 current_expression(CurID,CurState),
762 compute_state_information_if_necessary(CurID),
763 (time_out_for_invariant(CurID) -> List = [invariant_time_out|List1]
764 ; invariant_violated(CurID) -> List = [invariant_violated|List1]
765 ; invariant_not_yet_checked(CurID) -> List = [invariant_not_checked|List1]
766 ; CurID=root -> List = List1
767 ; CurState = concrete_constants(_) -> List = List1
768 ; specfile:b_or_z_mode -> List=[invariant_ok|List1]
769 % only in b_or_z_mode do we add not_invariant_checked facts and check invariant while model checking/animating
770 ; List=List1),
771 (try_compute_depth_of_state_id(CurID,Depth),
772 translate:translate_properties_with_limit(['='(depth,Depth)],[DS])
773 -> List1 = [DS|StateAsStrings]
774 ; List1 = StateAsStrings),
775 (cached_state_as_strings(CurID,StateAsStrings) % TO DO: separate constant / variable properties ?
776 -> true
777 ; retractall(cached_state_as_strings(_,_)),
778 time_out_call(tcltk_get_state(StateAsStrings,CurState),
779 StateAsStrings = ['***TIMEOUT-PROPERTY***']),
780 assertz(cached_state_as_strings(CurID,StateAsStrings))
781 ),
782 debug_println(9,finished_tcltk_get_state).
783
784 tcltk_get_state(StateAsStrings,State) :-
785 %print(get_state),nl,
786 findall(Prop,property(State,Prop),StateProps),
787 %print(translating(StateProps)),nl,
788 translate:translate_properties_with_limit(StateProps,StateAsStrings).
789 %print(translated(StateAsStrings)),nl.
790
791
792 tcltk_get_state_errors(list(ErrorsAsStrings)) :-
793 get_current_state_errors(_CurID,Errors),
794 translate_state_errors(Errors,ErrorsAsStrings).
795
796 get_current_state_errors(CurID,Errors) :-
797 current_state_id(CurID),
798 findall(Error,( state_error(CurID,_,Error), Error \== invariant_violated ), Errors).
799
800 :- dynamic last_detailed_error/3.
801
802 reset_tcltk_interface :- debug_println(19,reset_tcltk),
803 retractall(cbc_inv_error_found(_,_)), reset_nr_cbc_sols,
804 retractall(find_flag(_,_)),
805 retractall(resetable_node(_)),
806 retractall(non_det_constant(_)),
807 retractall(current_candidate_options(_)),
808 retractall(cached_state_as_strings(_,_)),
809 retractall(last_detailed_error(_,_,_)).
810
811 tcltk_get_detailed_state_error(Num,ErrorMsg,Srow,Scol,Erow,Ecol) :-
812 retractall(last_detailed_error(_,_,_)),
813 get_current_state_errors(CurID,Errors),
814 nth0(Num,Errors,Error),
815 !,
816 explain_state_error(Error,Span,ErrorMsg),
817 assertz(last_detailed_error(CurID,Span,ErrorMsg)), % save info, so that we can debug if Span contains a span_predicate
818 %(generate_dot_from_last_span_predicate('~/Desktop/err.dot') -> true ; true),
819 (extract_line_col_for_main_file(Span,Srow,Scol,Erow,Ecol)
820 -> true
821 ; Srow= -1, Scol= -1, Erow= -2, Ecol= -2).
822
823
824 :- use_module(probsrc(tools_commands),[edit_file/2]).
825 :- use_module(specfile,[b_absolute_file_name_relative_to_opened_file/2]).
826 % show location of state error in external editor
827 tcltk_open_state_error_in_editor(Num) :-
828 get_current_state_errors(_,Errors),
829 nth0(Num,Errors,Error),
830 (get_state_error_span(Error,Span)
831 -> (extract_file_line_col(Span,FILE,LINE,_COL,_Erow,_Ecol)
832 -> b_absolute_file_name_relative_to_opened_file(FILE,AFILE),
833 edit_file(AFILE,LINE)
834 ; add_error(tcltk_open_state_error_in_editor,'Could not extract file position: ',Span)
835 )
836 ; add_error(tcltk_open_state_error_in_editor,'Could not extract source location for state error: ',Num)
837 ).
838
839 can_generate_dot_from_last_state_error :-
840 last_detailed_error(_CurID,ErrSpan,_),!,
841 get_inner_span(ErrSpan,span_predicate(_,_,_)).
842 can_generate_dot_from_last_state_error :-
843 current_state_id(CurID), state_error(CurID,_,_). % not sure if it is really possible to extract span predicate though
844 generate_dot_from_last_span_predicate(FileName) :-
845 current_state_id(CurID),
846 (last_detailed_error(CurID,ErrSpan,_ErrorMsg) % also works with expressions
847 -> true
848 ; tcltk_get_detailed_state_error(0,_,_,_,_,_), % try and generate error description
849 last_detailed_error(CurID,ErrSpan,_)
850 ),
851 get_inner_span(ErrSpan,span_predicate(P,LS,State)),
852 (State=[], visited_expression(CurID,S),
853 state_corresponds_to_initialised_b_machine(S,FullState)
854 -> true % span predicates from event trace do not have the current state, add state
855 ; FullState=State),
856 write_dot_file_for_pred_expr_and_state(P, LS, FullState,FileName).
857
858 get_inner_span(pos_context(Span1,_,_),SP) :- !,
859 get_inner_span(Span1,SP).
860 get_inner_span(SP,SP).
861
862 tcltk_current_state_invariant_violated :-
863 current_state_id(CurID),
864 get_invariant_violated(CurID).
865
866 tcltk_state_exists_with_invariant_violated :-
867 (invariant_violated(_) -> true). % would be too expensive for XTL mode
868
869 % also checks for other formalisms whether something similar to an invariant violation holds
870 get_invariant_violated(CurID) :- xtl_mode,!,
871 visited_expression(CurID,CurState),
872 xtl_invariant_violated(CurState).
873 get_invariant_violated(CurID) :- invariant_violated(CurID).
874
875 /* --------------------------------------------------------------------- */
876
877 :- use_module(b_trace_checking, [tcltk_save_history_as_trace_file/2]).
878 tcltk_save_history_as_trace_file(File) :-
879 tcltk_save_history_as_trace_file(prolog,File).
880
881
882 /* --------------------------------------------------------------------- */
883
884 :- use_module(translate, [get_bexpression_column_template/4]).
885 evaluate_bexpr_over_state(Stream,Expr,ValueTemplate,Columns,ResultColStrings,BState,OpName) :-
886 format(Stream,'~w,',[OpName]),
887 b_compute_expression_with_prob_ids(Expr,BState,Value),
888 copy_term((ValueTemplate,Columns),(Value,ResultCols)),
889 my_print_csv_value(ResultCols,Stream),
890 maplist(translate:translate_bvalue,ResultCols,ResultColStrings),
891 nl(Stream).
892
893 % evaluate an expression over the history and save the result to a CSV file
894 evaluate_expression_over_history_to_csv_file(Expr,File) :-
895 parse_machine_expression(Expr,TypedExpr),
896 get_bexpression_column_template(TypedExpr,ValueTemplate,ColHeaders,Columns),
897 format('Writing CSV file: ~w~n',[File]),
898 open(File,write,Stream),
899 format(Stream,'OPERATION,',[]),
900 my_print_csv_atoms(ColHeaders,Stream),
901 call_cleanup(map_over_history(evaluate_bexpr_over_state(Stream,TypedExpr,ValueTemplate,Columns),_),
902 close(Stream)),
903 format('Finished writing CSV file: ~w~n',[File]).
904
905
906 tcltk_evaluate_expression_over_history(Expr,list([list(['OPERATION','State Id'|ColHeaders])|ColumnLists])) :-
907 parse_machine_expression(Expr,TypedExpr),
908 get_bexpression_column_template(TypedExpr,ValueTemplate,ColHeaders,Columns),
909 map_over_history(evaluate_bexpr_over_state(user_output,TypedExpr,ValueTemplate,Columns),
910 ColumnLists).
911
912 map_over_history(Pred,ResColumnLists) :-
913 history(H), current_state_id(CurID),
914 reverse([CurID|H],RH),
915 get_action_trace(T), reverse(T,RT),
916 maplist(call_pred_on_expanded_state(Pred),RH,[action(root,root)|RT],ColumnLists),
917 prune_list(ColumnLists,ResColumnLists).
918 % remove unknown elements at front for Tk
919 prune_list([unknown|T],Res) :- !, prune_list(T,Res).
920 prune_list(R,R).
921
922 call_pred_on_expanded_state(_Pred,root,_,ColList) :- !, ColList=unknown.
923 call_pred_on_expanded_state(Pred,StateId,action(_,ActionTerm),ResColList) :- print(StateId),nl,
924 get_operation_name(ActionTerm,OpName),
925 format('Processing state ~w (reached via ~w)~n',[StateId,OpName]),
926 visited_expression(StateId,State),
927 (state_corresponds_to_initialised_b_machine(State,BState)
928 -> call(Pred,ColList,BState,OpName), ResColList = list([OpName,StateId|ColList])
929 ; ResColList = unknown ).
930
931 :- use_module(eval_let_store,[extend_state_with_probids_and_lets/2]).
932 b_compute_expression_with_prob_ids(Expr,BState,Value) :-
933 extend_state_with_probids_and_lets(BState,BState2),
934 b_interpreter:b_compute_expression_nowf(Expr,[],BState2,Value,'Tcl/Tk',0).
935
936
937 my_print_csv_atoms([A,B|T],Stream) :- !, format(Stream,'"~w",',[A]),
938 my_print_csv_atoms([B|T],Stream).
939 my_print_csv_atoms([A],Stream) :- format(Stream,'"~w"~n',[A]).
940
941 my_print_csv_value([A,B|T],Stream) :- !,
942 my_print_csv_value([A],Stream),
943 write(Stream,','),
944 my_print_csv_value([B|T],Stream).
945 my_print_csv_value([V],Stream) :-
946 (no_quotes_necessary(V) -> true ; write(Stream,'"')),
947 translate:print_bvalue_stream(Stream,V),
948 (no_quotes_necessary(V) -> true ; write(Stream,'"')).
949
950 no_quotes_necessary(int(_)).
951 no_quotes_necessary(pred_false).
952 no_quotes_necessary(pred_true).
953
954
955 /* --------------------------------------------------------------------- */
956
957 :- use_module(probltlsrc(ltl_tools),[temporal_parser/3]).
958 :- use_module(probltlsrc(ltl),[preprocess_formula/2]).
959
960 tcltk_execute_until(FormulaAsAtom) :-
961 (temporal_parser(FormulaAsAtom,ltl,Ltl) ->
962 true
963 ;
964 add_error(ltl,'LTL Parser failed: ',FormulaAsAtom),fail),
965 ( Ltl=syntax_error ->
966 add_error(ltl,'Syntax error while parsing: ',FormulaAsAtom),fail
967 ;
968 preprocess_formula(Ltl,Ltl2)
969 ),
970 current_state_id(CurID),
971 prob2_interface: find_trace1(CurID,Ltl2,no_loop,1000,Trace,_Result),
972 %TODO: check if result is deadlock. Will not fail.
973 update_history_from_trace(Trace).
974
975 update_history_from_trace([]). % TODO: Can we get an empty trace from find_trace predicate?
976 update_history_from_trace([op(OpID,_Name,CurID,NextID)]) :-
977 add_id_to_history(CurID),
978 add_to_op_trace_ids(OpID),
979 add_id_to_history(NextID),
980 set_current_state_id(NextID).
981 update_history_from_trace([op(OpID,_Name,CurID,NextID)|T]) :-
982 add_id_to_history(CurID),
983 add_to_op_trace_ids(OpID),
984 add_id_to_history(NextID),
985 update_history_from_trace(T).
986
987
988 tcltk_random_perform :- tcltk_random_perform2(_,fully_random).
989 tcltk_random_perform(Kind) :- tcltk_random_perform2(_,Kind).
990
991 % Kind can be fully_random, no_self_loops, explore_open
992 % TODO: other options like out_degree, ...
993 tcltk_random_perform2(ActionId,Kind) :-
994 current_options(Opts),
995 current_state_id(CurID),
996 (Kind=explore_open, exclude(is_already_explored,Opts,Options2), Options2 = [_|_] -> true % try and find unexplored successor
997 ; is_heuristic(Kind),
998 maplist(compute_heuristic(Kind),Opts,HOpts),
999 sort(HOpts,SHOpts),
1000 keep_min_heuristic(SHOpts,Opts1)
1001 ->
1002 (exclude(is_already_explored,Opts1,Options2), Options2 = [_|_]
1003 -> true % among the nodes with the lowest heuristic value choose open nodes first; to try find new values
1004 ; Options2=Opts1)
1005 ; Kind=execute_first_enabled, Opts = [First|_] -> Options2 = [First]
1006 ; Kind\=fully_random,
1007 exclude(is_self_loop(CurID),Opts,Options2), Options2 = [_|_] -> true % try find different node
1008 ; Options2=Opts),
1009 length(Options2,Len),
1010 (Len>0
1011 -> L1 is Len+1,
1012 random(1,L1,RanChoice),
1013 tcltk_perform_nr_option(RanChoice,Options2,ActionId)
1014 ; true
1015 ).
1016
1017 is_already_explored((_Id,_Action,_,NextId)) :- \+ not_all_transitions_added(NextId).
1018 is_self_loop(CurId,(_Id,_Action,_,CurId)).
1019
1020 is_heuristic(heuristic).
1021 is_heuristic(min_out_degree).
1022 :- use_module(probsrc(state_space_exploration_modes),[compute_heuristic_function_for_state_id/2]).
1023 :- use_module(probsrc(state_space),[out_degree/2, compute_transitions_if_necessary/1]).
1024 compute_heuristic(Kind,(Id,Action,ActTerm,NextId),heurval(HeurVal,Id,Action,ActTerm,NextId)) :-
1025 compute_h2(Kind,NextId,HeurVal).
1026 compute_h2(heuristic,NextId,HeurVal) :-
1027 compute_heuristic_function_for_state_id(NextId,HeurVal).
1028 compute_h2(min_out_degree,NextId,HeurVal) :-
1029 compute_transitions_if_necessary(NextId),
1030 out_degree(NextId,HeurVal).
1031 %compute_h2(out_degree,NextId,HeurVal) :-
1032
1033 % only keep the maximal value
1034 keep_min_heuristic([heurval(HeurVal,Id,Action,ActTerm,NextId)|HT],
1035 [(Id,Action,ActTerm,NextId)|T]) :- keep_min2(HT,HeurVal,T).
1036 keep_min2([heurval(HeurVal,Id,Action,ActTerm,NextId)|HT],HeurVal,
1037 [(Id,Action,ActTerm,NextId)|T]) :- !, keep_min2(HT,HeurVal,T).
1038 keep_min2(_,_,[]).
1039
1040
1041 tcltk_get_line_col(Nr,list(StartLine),list(StartCol),list(EndLine),list(EndCol)) :- /* just get the location in the source code */
1042 current_options(Options),
1043 nth1(Nr,Options,(_Id,_Action,ActionAsTerm,_NewID)),
1044 %print(get_source_text(ActionAsTerm)),nl,
1045 time_out_call(get_source_text_positions(ActionAsTerm,StartLine,StartCol,EndLine,EndCol),
1046 add_error_and_fail(tcltk_get_line_col,'Timeout determining source code position: ',ActionAsTerm)),
1047 StartLine \= []. % otherwise fail
1048 % print(startlines(StartLine)),nl,print(startcols(StartCol)),nl,
1049 % print(endlines(EndLine)),nl, print(endcol(EndCol)),nl.
1050
1051 tcltk_is_sync_event(Nr) :-
1052 current_options(Options),
1053 nth1(Nr,Options,(_Id,_Action,ActionAsTerm,_NewID)),
1054 extract_span_from_event(ActionAsTerm,SPAN,_,_),
1055 extract_span_info(SPAN,Info),
1056 % print(extracted_span_info_for_sync(Info,SPAN)),nl,
1057 member(sharing,Info).
1058
1059 % get textual description of nth option in current options
1060 % is derived from description pragma attached to operations
1061 tcltk_get_options_nr_description(Nr,Desc) :-
1062 current_state_id(CurID),
1063 current_options(Options),
1064 nth1(Nr,Options,(_ActionId,_Action,ActionAsTerm,NewID)),
1065 tcltk_get_op_desc_for_trans(CurID,ActionAsTerm,NewID,Desc).
1066
1067 :- use_module(probsrc(bmachine),[source_code_for_identifier/6]).
1068 % get textual description for entry Nr in the Tk history view
1069 tcltk_get_history_nr_description(Nr,Desc) :-
1070 get_history_trans(Nr, CurID,ActionAsTerm,DestID),
1071 tcltk_get_op_desc_for_trans(CurID,ActionAsTerm,DestID,Desc).
1072
1073 get_history_trans(Nr, CurID,ActionAsTerm,DestID) :-
1074 op_trace_ids(OpTrace),
1075 nth0(Nr,OpTrace,TransId),
1076 history(StateIds),
1077 nth0(Nr,StateIds,CurID),
1078 transition(CurID,ActionAsTerm,TransId,DestID).
1079
1080 :- use_module(probsrc(bmachine),[source_code_for_identifier/6]).
1081 % show source code origin of entry number Nr in the Tk history view
1082 tcltk_get_history_nr_origin_str(Nr,Desc) :-
1083 get_history_trans(Nr, _CurID,ActionAsTerm,_DestID),
1084 get_operation_name(ActionAsTerm,OpID),
1085 source_code_for_identifier(OpID,operation,subst,OriginStr,_,_),
1086 Desc=OriginStr. %ajoin([OpID,' ', OriginStr],Desc).
1087
1088
1089 :- use_module(probsrc(tools_commands),[edit_file/2]).
1090 :- use_module(probsrc(error_manager),[extract_file_line_col/6]).
1091 % open source code in external editor for origin of entry number Nr in the history view
1092 tcltk_edit_history_nr_origin_str(Nr) :-
1093 get_history_trans(Nr, _CurID,ActionAsTerm,_DestID),
1094 get_operation_name(ActionAsTerm,OpID),
1095 source_code_for_identifier(OpID,operation,subst,_OriginStr,OriginTerm,_),
1096 extract_file_line_col(OriginTerm,FILE,LINE,_COL,_Erow,_Ecol),
1097 edit_file(FILE,LINE).
1098
1099 :- use_module(probsrc(state_space_exploration_modes),
1100 [compute_heuristic_function_for_state_id/2]).
1101 tcltk_get_op_desc_for_trans(CurID,ActionAsTerm,DestID,Desc) :-
1102 (b_or_z_mode,
1103 get_operation_description_for_transition(CurID,ActionAsTerm,DestID,Desc) -> true
1104 ; compute_heuristic_function_for_state_id(DestID,int(HeuristicVal)),
1105 ajoin(['Heuristic=',HeuristicVal],Desc)). % TODO: more infos, like deadlock, GOAL, ...
1106
1107 % counter-part to tcltk_get_options, to execute the option/operation number Nr in that list
1108 tcltk_perform_nr(Nr) :-
1109 current_options(Options),
1110 tcltk_perform_nr_option(Nr,Options,_).
1111
1112 tcltk_perform_nr_option(Nr,Options,ActionId) :-
1113 (nth1(Nr,Options,(ActionId,_Action,ActionAsTerm,NewID))
1114 -> (forward_history([forward(NewID,ActionId)|_FwdHist])
1115 -> tcltk_forward
1116 ; tcltk_perform_action_term(ActionAsTerm,NewID),
1117 retractall(forward_history(_))
1118 )
1119 ; tcltk_backtrack /* interpret as backtrack */
1120 ).
1121
1122
1123 tcltk_can_backtrack :- history([_|_]).
1124 tcltk_can_backtrack(Len) :- history(His), length(His,Len),Len>0.
1125
1126 tcltk_backtrack :- \+ tcltk_can_backtrack,!,
1127 print_message('Cannot backtrack'),fail.
1128 tcltk_backtrack :-
1129 remove_from_op_trace_ids(LastTraceH), % remove last operation id from op_id trace
1130 retract(history(History)),
1131 retract(current_state_id(CurID)),!,
1132 History= [LastID|EHist],
1133 assertz(history(EHist)),
1134 %visited_expression(LastID,LastExpr,LastBody),
1135 assertz(current_state_id(LastID)),
1136 (retract(forward_history(FwdHist)) -> true ; FwdHist=[]),
1137 assertz(forward_history([forward(CurID,LastTraceH)|FwdHist])).
1138
1139 % used for right-clicks in history
1140 tcltk_backtrack(N) :- N =< 0, !.
1141 tcltk_backtrack(N) :- % TO DO: more efficient version
1142 tcltk_backtrack, N1 is N-1, tcltk_backtrack(N1).
1143
1144 :- dynamic saved_forward_history/2.
1145 :- volatile saved_forward_history/2.
1146
1147
1148 % save certain information to restore when reload is completed:
1149 tcltk_prepare_for_reload :-
1150 saved_forward_history([_|_],Mode), % tcltk_try_reload not executed; probably reloading failed
1151 animation_mode(Mode),
1152 current_state_id(root), %user has not performed another trace
1153 get_action_trace([]),!,
1154 format('Keeping saved forward history~n',[]). % so that user can fix error and re-load again
1155 tcltk_prepare_for_reload :-
1156 retractall(saved_forward_history(_,_)),
1157 get_action_term_trace(TrA),reverse(TrA,Tr),
1158 %print(prepare_reloading(Tr)),nl,
1159 maplist(gen_unknown_forward,Tr,SavedForwardHistory),
1160 animation_mode(Mode),
1161 % TO DO: add current forward history as well and restore when doing a reload with fastforward
1162 % forward_history(ForwHis), maplist(remove_forward_id,ForwHis,SavedPrevForwHis),
1163 assertz(saved_forward_history(SavedForwardHistory,Mode)).
1164
1165 %remove_forward_id(forward(_,Step),forward('$UNKNOWN',Step)).
1166 gen_unknown_forward(Step,forward('$UNKNOWN',Step)). % the forward ID is unknown
1167
1168 % try reloading certain information from previous load of same model
1169 tcltk_try_reload :-
1170 retract(saved_forward_history(SavedForwardHistory,Mode)),
1171 animation_mode(Mode), % we are in the same mode as when saved
1172 !,
1173 % TO DO: also retractall in other places
1174 %print(reloading(SavedForwardHistory)),nl,
1175 retractall(forward_history(_)),
1176 assertz(forward_history(SavedForwardHistory)).
1177 tcltk_try_reload.
1178
1179
1180 % go forward while possible
1181 tcltk_fast_forward :- tcltk_can_forward,!, tcltk_forward,
1182 current_state_id(CurID),
1183 compute_state_information_if_necessary(CurID),
1184 tcltk_fast_forward.
1185 tcltk_fast_forward.
1186
1187 tcltk_can_forward :- forward_history([_|_]).
1188 tcltk_can_forward(Len) :- forward_history(His), length(His,Len), Len>0.
1189
1190
1191 tcltk_forward(N) :- N =< 0, !.
1192 tcltk_forward(N) :- % TO DO: more efficient version
1193 tcltk_forward, N1 is N-1, tcltk_forward(N1).
1194
1195
1196 tcltk_forward :- \+ tcltk_can_forward,!,
1197 print_message('Cannot go forward'),fail.
1198 tcltk_forward :-
1199 retract(forward_history([forward(FwdID,LastTraceH)|FwdHist])),
1200 retract(history(EHist)),
1201 retract(current_state_id(CurID)),!,
1202 go_forward(FwdID,LastTraceH,FwdHist,CurID,EHist).
1203 go_forward('$UNKNOWN',ActionAsTerm,FwdHist,CurID,EHist) :-
1204 transition(CurID,ActionAsTerm,TransitionID,FwdID),!,
1205 %print(found(CurID,ActionAsTerm,TransitionID,FwdID)),nl,
1206 go_forward(FwdID,TransitionID,FwdHist,CurID,EHist).
1207 % TO DO: try and execute by predicate in case max_reached is true !
1208 go_forward('$UNKNOWN',ActionAsTerm,FwdHist,CurID,EHist) :-
1209 is_initialisation_op(ActionAsTerm),
1210 % maybe PROPERTIES/INITIALISATION has changed; try and replay with other values
1211 transition(CurID,ActionAsTerm2,TransitionID,FwdID),
1212 is_initialisation_op(ActionAsTerm2),
1213 !,
1214 %print(found(CurID,ActionAsTerm,TransitionID,FwdID)),nl,
1215 translate_event(ActionAsTerm,Action),
1216 format('Could not replay ~w.~nUsing other possible transition instead.~n',[Action]),
1217 go_forward(FwdID,TransitionID,FwdHist,CurID,EHist).
1218 go_forward('$UNKNOWN',ActionAsTerm,_FwdHist,CurID,EHist) :- !,
1219 assertz(forward_history([])),
1220 assertz(history(EHist)),
1221 assertz(current_state_id(CurID)),
1222 translate_event(ActionAsTerm,Action),
1223 add_error(tcltk_forward,'Cannot replay step after reload: ',Action).
1224 go_forward(FwdID,LastTraceH,FwdHist,CurID,EHist) :-
1225 assertz(forward_history(FwdHist)),
1226 assertz(history([CurID|EHist])),
1227 add_to_op_trace_ids(LastTraceH),
1228 assertz(current_state_id(FwdID)),
1229 re_execute_transition_if_necessary(CurID,LastTraceH,FwdID).
1230 %visited_expression(FwdID,FwdExpr,FwdBody).
1231
1232 is_initialisation_op(Op) :-
1233 (functor(Op,'$setup_constants',_) ;functor(Op,'$initialise_machine',_)).
1234
1235 % re-execute operation with side-effects if necessary and if preference set
1236 % TO DO: tie into tcltk_perform so that not only the forward button but also double click
1237 % in operations pane works
1238 re_execute_transition_if_necessary(FromID,TransitionID,ToID) :-
1239 b_or_z_mode,
1240 get_preference(re_execute_operations_with_side_effects,true),
1241 bmachine_construction:external_procedure_used(_), % TO DO: check if operation itself has side-effects
1242 !,
1243 (re_execute_transition(FromID,TransitionID,ToID)
1244 -> true
1245 ; add_error(tcltk_forward,'Could not re-execute operation: ',TransitionID)).
1246 re_execute_transition_if_necessary(_,_,_).
1247
1248 re_execute_transition(FromID,TransitionID,ToID) :-
1249 transition(FromID,ActionTerm,TransitionID,ToID),
1250 %%print(trans(ActionTerm)),nl,
1251 get_operation_name(ActionTerm,OpName),
1252 debug_println(9,re_executing_operation(OpName,FromID,TransitionID,ToID)),
1253 visited_expression(FromID,InState),
1254 specfile:b_trans(InState,OpName,ActionTerm,_NewState,_TransInfo),
1255 debug_println(9,re_executed(OpName)).
1256
1257 % a version of tcltk_perform_action_term which can be given only the String (e.g., for trace checking)
1258 tcltk_perform_action_string(ActionString,ActionAsTerm,NewID) :-
1259 current_state_id(CurID),
1260 ? transition(CurID,ActionAsTerm,_,NewID),
1261 translate_event_with_src_and_target_id(ActionAsTerm,CurID,NewID,ActionString),
1262 tcltk_goto_state(ActionAsTerm,NewID).
1263 % translate_event_with_limit(ActionAsTerm,5000,ActionString). % should use same limit as below; otherwise trace checking will fail; ideally we should check ActionString is prefix
1264 %translate_event(ActionAsTerm,ActionString).
1265
1266 % perform the Action with term ActionAsTerm leading to new state NewID
1267 tcltk_perform_action_term(ActionAsTerm,NewID) :- %print(tcltk_perform_action_term(Action,ActionAsTerm,NewID)),nl,
1268 (var(ActionAsTerm)
1269 -> add_internal_error('Illegal call: ',tcltk_perform_action_term(ActionAsTerm,NewID)) ; true),
1270 tcltk_goto_state(ActionAsTerm,NewID).
1271
1272 /* allows one to execute an action in term form, from the current state: */
1273 %tcltk_perform_action(T,Cur) :- print_message(perf(T,Cur)),fail.
1274
1275 tcltk_perform_action(ActionAsTerm,NewID) :-
1276 current_state_id(CurID),
1277 tcltk_perform_action(CurID,ActionAsTerm,NewID).
1278 tcltk_perform_action(CurID,ActionAsTerm,NewID) :-
1279 tcltk_perform_action(CurID,ActionAsTerm,NewID,_).
1280 tcltk_perform_action(CurID,ActionAsTerm,TransitionID,NewStateID) :-
1281 transition(CurID,ActionAsTerm,TransitionID,NewStateID),
1282 tcltk_goto_state(ActionAsTerm,NewStateID).
1283
1284 tcltk_no_constants_or_no_inititalisation_found :-
1285 (current_expression(root,_) ; current_expression(_,concrete_constants(_))),
1286 current_options([]).
1287
1288 /* ------------ */
1289 /* tcltk_open/1 */
1290 /* ------------ */
1291
1292
1293 %prolog_check_load_errors :-
1294 % (tcltk_find_untyped_consts(ErrRes)
1295 % -> add_error(prolog_open,'These constants were not given a proper type:', ErrRes)
1296 % ; true),
1297 % (tcltk_find_untyped_vars(ErrRes)
1298 % -> add_error(prolog_open,'These variables were not given a proper type:', ErrRes)
1299 % ; true).
1300
1301 tcltk_open_b_file_for_minor_mode(File,Minor) :- tcltk_open_b_file(File),
1302 set_animation_minor_mode(Minor).
1303
1304 tcltk_open_b_file(File) :-
1305 tcltk_clear_machine,
1306 set_animation_mode(b),
1307 print_message(loading_b_file(File)),flush_output,
1308 set_currently_opening_file(File),
1309 % to do: b_load_machine_probfile
1310 (b_load_aux(File)
1311 -> print_message(loaded),
1312 set_currently_opened_b_file(File)
1313 ; tcltk_set_failed_to_open_file(File),
1314 fail
1315 ).
1316
1317 tcltk_set_failed_to_open_file(File) :-
1318 set_failed_to_open_file(File),
1319 copy_current_errors_to_state(root,loading_context(File)).
1320
1321 :- use_module(probsrc(bmachine), [b_load_machine_from_file/1,b_load_machine_probfile/1]).
1322 :- use_module(tools,[get_filename_extension/2]).
1323 b_load_aux(File) :- get_filename_extension(File,'prob'),!,
1324 b_load_machine_probfile(File).
1325 b_load_aux(File) :-
1326 b_load_machine_from_file(File).
1327
1328 :- use_module(xtl_interface,[open_xtl_file/1]).
1329 tcltk_open_xtl_file(File) :- % TODO: redundant wrt load_xtl_spec_from_prolog_file
1330 tcltk_clear_machine,
1331 set_animation_mode(xtl),
1332 set_currently_opening_file(File),
1333 (open_xtl_file(File)
1334 -> set_currently_opened_file(File)
1335 ; tcltk_set_failed_to_open_file(File), fail).
1336
1337
1338 tcltk_open_cspm_file(File) :-
1339 tcltk_clear_machine,
1340 set_animation_mode(cspm),
1341 set_currently_opening_file(File),
1342 (xtl_interface:open_cspm_file(File)
1343 -> set_currently_opened_file(File)
1344 ; tcltk_set_failed_to_open_file(File), fail).
1345
1346 :- use_module(xtl_interface).
1347 %tcltk_open_promela_file(File) :-
1348 % tcltk_clear_machine,
1349 % set_animation_mode(promela), set_currently_opening_file(File),
1350 % xtl_interface:open_promela_file(File), set_currently_opened_file(File).
1351
1352 % disabled because Java parser seems broken
1353 %tcltk_open_smv_file(File) :-
1354 % tcltk_clear_machine,
1355 % set_animation_mode(smv), set_currently_opening_file(File),
1356 % xtl_interface:open_smv_file(File), set_currently_opened_file(File).
1357
1358 :- use_module(specfile,[type_check_csp_and_b/0]).
1359 :- use_module(library(file_systems),[file_exists/1,delete_file/1]).
1360
1361 tcltk_add_csp_file(File) :-
1362 \+ file_exists(File),!,
1363 add_error(csp_guide,'CSP guide file does not exist:',File).
1364 tcltk_add_csp_file(File) :-
1365 unset_animation_minor_modes(L), % we could be in z or tla or eventb mode
1366 set_animation_mode(csp_and_b),
1367 reset_animation_minor_modes(L),
1368 xtl_interface:open_cspm_file(File),
1369 notify_change_of_animation_mode,
1370 type_check_csp_and_b.
1371
1372 notify_change_of_animation_mode :-
1373 announce_event(change_of_animation_mode).
1374 % clear_applicable_flag. % no done via event handling
1375
1376
1377 tcltk_open_z_file(File) :-
1378 tcltk_clear_machine,
1379 tcltk_open_z_file2(File).
1380 tcltk_open_z_file2(File) :-
1381 set_currently_opening_file(File),
1382 ? open_proz_file(File,BMachine),
1383 set_animation_mode(b), set_animation_minor_mode(z),
1384 b_set_typed_machine(BMachine,File),
1385 !,
1386 set_currently_opened_b_file(File).
1387 tcltk_open_z_file2(File) :- tcltk_set_failed_to_open_file(File),fail.
1388
1389 :- use_module(parsercall,[call_fuzz_parser/2]).
1390 tcltk_open_z_tex_file(TexFile) :-
1391 tcltk_clear_machine,
1392 ? call_fuzz_parser(TexFile,FuzzFile),
1393 tcltk_open_z_file2(FuzzFile).
1394
1395
1396 :- use_module(eclipse_interface,[load_eventb_file/1]).
1397 tcltk_load_packaged_eventb_file(File) :-
1398 tcltk_clear_machine,
1399 load_eventb_file(File).
1400
1401 :- use_module(parsercall,[call_alloy2pl_parser/2]).
1402 :- use_module(probsrc('alloy2b/alloy2b')).
1403 tcltk_open_alloy_file(AlloyFile) :-
1404 tcltk_clear_machine,
1405 start_ms_timer(T1),
1406 formatsilent('Parsing Alloy file: ~w~n',[AlloyFile]),
1407 set_currently_opening_file(AlloyFile),
1408 call_alloy2pl_parser(AlloyFile,PrologFile),
1409 (silent_mode(off) -> stop_ms_walltimer_with_msg(T1,'parsing and type checking: ') ; true),
1410 %printsilent(generated_prolog_ast(PrologFile)),nls,
1411 start_ms_timer(T2),
1412 ( load_alloy_ast_prolog_file(PrologFile)
1413 -> true
1414 ; delete_file(PrologFile), % delete parsed Prolog file if model couldn't be loaded
1415 fail % since it's potentially empty due to the failure
1416 ),
1417 !,
1418 (silent_mode(off) -> stop_ms_walltimer_with_msg(T2,'loading and translation to B: ') ; true),
1419 set_currently_opened_b_file(AlloyFile).
1420 tcltk_open_alloy_file(AlloyFile) :- tcltk_set_failed_to_open_file(AlloyFile),fail.
1421
1422
1423 tcltk_open_alloy_prolog_ast_file(AlloyPrologFile) :-
1424 tcltk_clear_machine,
1425 start_ms_timer(T2),
1426 load_alloy_ast_prolog_file(AlloyPrologFile),
1427 !,
1428 (silent_mode(off) -> stop_ms_walltimer_with_msg(T2,'loading B translation of Alloy: ') ; true),
1429 set_currently_opened_b_file(AlloyPrologFile).
1430
1431 %% tcltk_load_alloy_cmd_in_current_translation(+CmdName).
1432 tcltk_load_alloy_cmd_in_current_translation(CmdName) :-
1433 alloy2b:load_command_in_current_translation(CmdName).
1434
1435 %% tcltk_get_alloy_cmd_names(-CmdNames).
1436 tcltk_get_alloy_cmd_names(CmdNames) :-
1437 alloy2b:get_command_names(CmdNames).
1438
1439 %% tcltk_verify_alloy_cmd(+CmdName, +SolverName, -CmdIsValid, -IsCheckCmd).
1440 tcltk_verify_alloy_cmd(CmdName, SolverName, CmdIsValid, IsCheckCmd) :-
1441 verify_alloy_command(CmdName, SolverName, CmdIsValid, IsCheckCmd, Res),
1442 ( Res = solution(Bindings)
1443 -> bindings_to_state(Bindings, State),
1444 tcltk_add_cbc_state(State, CmdName)
1445 ; true
1446 ).
1447
1448 bindings_to_state([], []).
1449 bindings_to_state([Binding|T], [Bind|NT]) :-
1450 (Binding = binding(Id,Val,_); Binding = bind(Id,Val)),
1451 Bind = bind(Id,Val),
1452 bindings_to_state(T, NT).
1453
1454 /* --------------------------------------------------------------------- */
1455
1456 tcltk_exists_an_open_node :-
1457 not_all_transitions_added(_) ; not_interesting(_).
1458 tcltk_goto_an_open_node :-
1459 (not_all_transitions_added(ID) ; not_interesting(ID)),!,
1460 tcltk_goto_state(find_open_node,ID).
1461 tcltk_goto_max_reached_node :-
1462 (max_reached_for_node(ID) ; time_out_for_node(ID)),!,
1463 tcltk_execute_trace_to_node(ID).
1464 tcltk_goto_timeout_node :-
1465 time_out_for_node(ID),!,
1466 tcltk_execute_trace_to_node(ID).
1467 % tcltk_goto_state(find_max_reached_node,ID).
1468
1469 tcltk_goto_an_invariant_violation :-
1470 invariant_violated(ID),!,
1471 tcltk_goto_state(find_inv_violation,ID).
1472
1473
1474 tcltk_goto_node_with_id(ToID) :-
1475 current_state_id(ToID),!.
1476 tcltk_goto_node_with_id(ID) :-
1477 visited_expression_id(ID),
1478 tcltk_execute_trace_to_node(ID).
1479
1480 tcltk_try_goto_node_with_id(ID) :-
1481 (tcltk_goto_node_with_id(ID) -> true
1482 ; add_internal_error('Call failed:',tcltk_goto_node_with_id(ID))).
1483
1484 /* --------------------------------------------------------------------- */
1485
1486 % TO DO: clean up and move into model_checker module
1487
1488 ?tcltk_state_space_only_has_root_node :- transition(root,_,ID),
1489 \+ not_all_transitions_added(ID),!,fail.
1490 tcltk_state_space_only_has_root_node.
1491
1492 tcltk_search_among_existing_nodes(TclTkRes,FindDeadlocks,FindInvViolations,
1493 FindGoal,FindAssViolations,FindStateErrors) :-
1494 search_among_existing_nodes(Res,FindDeadlocks,FindInvViolations,
1495 FindGoal,FindAssViolations,FindStateErrors),
1496 translate_error_for_tclk(Res,TclTkRes).
1497
1498 % if tcltk_state_space_only_has_root_node is true: then we should call search_among_existing_nodes before doing open_search to ensure that we uncover state_errors in the root node
1499 % TODO: process mc_continue_after_error preference
1500 search_among_existing_nodes(invariant_violation,_FindDeadlocks,FindInvViolations,
1501 _FindGoal,_FindAssViolations,_FindStateErrors) :-
1502 (get_state_space_stats(_,_,PrN), PrN>100
1503 -> print_message('Search Among Processed Nodes'), print_message(number_of_nodes(PrN)) ; true),
1504 FindInvViolations=1,
1505 ? (invariant_violated(ResID) -> true
1506 ; find_invariant_violation_among_not_checked_nodes(ResID)),
1507 tcltk_execute_trace_to_node(ResID).
1508 search_among_existing_nodes(Error,_FindDeadlocks,FindInvViolations,
1509 _FindGoal,_FindAssViolations,_FindStateErrors) :-
1510 FindInvViolations=1,
1511 find_xtl_csp_invariant_violation_among_all_existing_nodes(ResID,Error), % could be xtl_error
1512 tcltk_execute_trace_to_node(ResID).
1513 search_among_existing_nodes(DEADLOCK,FindDeadlocks,_,_,_,_) :-
1514 FindDeadlocks=1,
1515 ? visited_expression_id(ResID),
1516 transitions_computed_for_node(ResID),
1517 is_deadlocked(ResID),
1518 (time_out_for_node(ResID)
1519 -> DEADLOCK = possible_deadlock_timeout
1520 ; get_preference(store_only_one_incoming_transition,true) -> DEADLOCK = possible_deadlock
1521 ; DEADLOCK = deadlock),
1522 print_message(deadlock_among_existing_nodes(ResID)),
1523 tcltk_execute_trace_to_node(ResID).
1524 search_among_existing_nodes(goal_found,_,_,FindGoal,_,_) :-
1525 FindGoal=1,
1526 %visited_expression(ResID,_CurState),
1527 %\+(not_all_transitions_added(ResID)), % if commented out: will also look at open nodes
1528 node_satisfies_goal(ResID),
1529 tcltk_execute_trace_to_node(ResID).
1530 search_among_existing_nodes(assertion_violation,_,_,_,FindAssViolations,_) :-
1531 FindAssViolations=1,
1532 b_machine_has_assertions,
1533 ? visited_expression(ResID,CurState),
1534 transitions_computed_for_node(ResID),
1535 state_violates_assertions(ResID,CurState),
1536 tcltk_execute_trace_to_node(ResID).
1537 search_among_existing_nodes(ERR,_,_,_,_,FindStateErrors) :- FindStateErrors=1,
1538 ? state_space:state_error(ResID,_,Error), Error \== invariant_violated,
1539 (Error = abort_error(ERR,_,_,_) -> true ; ERR = state_error(Error)),
1540 tcltk_execute_trace_to_node(ResID).
1541 search_among_existing_nodes(all,_,_,_,_,_).
1542
1543
1544 compute_all_transitions_if_necessary :-
1545 current_state_id(CurID),
1546 compute_all_transitions_if_necessary(CurID,false).
1547 :- public compute_all_transitions_if_necessary/1.
1548 compute_all_transitions_if_necessary(CurID) :-
1549 compute_all_transitions_if_necessary(CurID,false).
1550
1551 compute_all_transitions_if_necessary(CurID,CheckInvariant) :-
1552 (retract_open_node(CurID) % will assert not_invariant_checked
1553 -> set_context_state(CurID),
1554 % first check invariant, relevant if we want to use specialized_inv proof information
1555 visited_expression(CurID,State),
1556 % TO DO: this does not expand concrete_constants: the expansion may be done twice below:
1557 % once for compute_invariant (corresponds_to_b...) and once for compute_all_transitions (prepare_state_for_specfile_trans)
1558 prepare_state_for_specfile_trans(State,CurID,PreparedState),
1559 (CheckInvariant==true
1560 -> compute_invariant_if_necessary_and_requested(CurID,PreparedState) ; true),
1561 compute_all_transitions(CurID,PreparedState),
1562 clear_context_state
1563 ; true).
1564 %compute_all_transitions_if_necessary(CurID,CurState) :-
1565 % ((not_all_transitions_added(CurID);not_interesting(CurID))
1566 % -> compute_all_transitions(CurID,CurState) ; true).
1567
1568
1569 compute_invariant_if_necessary_and_requested(ID,State) :-
1570 enter_new_error_scope(ErrScID,compute_invariant_if_necessary_and_requested), % here we setup a new error scope; see comment for force_check_invariantKO below
1571 compute_invariant_if_necessary(ID,State),
1572 exit_error_scope(ErrScID,_ErrOcc,compute_invariant_if_necessary_and_requested). % should we do something with error occured result ?
1573
1574 compute_invariant_if_necessary(ID,State) :-
1575 animation_mode(MODE),compute_invariant_if_necessary(ID,State,MODE).
1576 compute_invariant_if_necessary(ID,State,MODE) :-
1577 ( check_invariantKO(MODE,ID,State) -> true ; true).
1578
1579 check_invariantKO(ID,State) :-
1580 animation_mode(MODE),check_invariantKO(MODE,ID,State).
1581 check_invariantKO(b,ID,State) :-
1582 check_invariantKO2(ID,State).
1583 check_invariantKO(csp_and_b,ID,State) :-
1584 check_invariantKO2(ID,State).
1585 % for XTL we do not use not_invariant_checked/1 facts; one should call xtl_invariant_violated/1
1586
1587 % check invariant for B state
1588 check_invariantKO2(ID,_) :- invariant_violated(ID),!.
1589 check_invariantKO2(ID,CurState) :-
1590 ? set_invariant_checked(ID), % only succeeds if we haven't checked invariant for ID yet
1591 % print(check_inv(ID)),nl,
1592 state_corresponds_to_initialised_b_machine(CurState),
1593 ( preferences:preference(do_invariant_checking,false) -> assertz(not_invariant_checked(ID))
1594 ; force_check_invariantKO(ID,CurState)).
1595
1596
1597 force_check_invariantKO(ID,CurBState) :-
1598 % Note: this checks the invariant without setting up a new error scope
1599 % (Reason: in the model checker it would be relatively expensive to set up an error scope for each state
1600 % the model checker stops anyway when the first error is found and then exits its error scope)
1601 catch_clpfd_overflow_call_for_state(ID, 'checking invariants',
1602 b_state_violates_invariant(ID,CurBState),true) ->
1603 %(b_state_violates_invariant(ID,CurBState) ->
1604 set_invariant_violated(ID).
1605 % TO DO ?: call state_satisfies_negation_of_invariant if double_evaluation_when_analysing is true ?
1606
1607 % try and find an invariant violation among those nodes that have not yet been checked
1608 find_invariant_violation_among_not_checked_nodes(ID) :-
1609 ? retract(not_invariant_checked(ID)), %print(checking_invariant(ID)),nl,
1610 visited_expression(ID,State),
1611 state_corresponds_to_initialised_b_machine(State),
1612 prepare_state_for_specfile_trans(State,ID,CurBState),
1613 force_check_invariantKO(ID,CurBState).
1614
1615 find_xtl_csp_invariant_violation_among_all_existing_nodes(ID,Error) :-
1616 animation_mode(MODE),
1617 (MODE=xtl ; MODE=csp), % invariant violations not stored, hence we need to re-check every node
1618 ? visited_expression(ID,State),
1619 find_invariant_error(MODE,ID,State,Error). % csp_error or xtl_error
1620
1621 :- use_module(probporsrc(ample_sets),[compute_ample_set2/3]).
1622 % computing ample sets (model_checker.pl)
1623 compute_ample_set(CurID,CurState,POROptions) :-
1624 catch_clpfd_overflow_call_for_state(CurID,'computing ample sets for POR',
1625 compute_ample_set2(CurID,CurState,POROptions),clear_context_state).
1626
1627
1628 %compute_all_transitions(CurID,CurState) :- get_preference(use_clpfd_solver,false),!,
1629 % compute_all_transitions2(CurID,CurState). % in principle this overflow cannot/should not happen with CLPFD FALSE
1630 % but no performance benefit can be measured by removing the catch
1631 compute_all_transitions(CurID,CurState) :-
1632 catch_clpfd_overflow_call_for_state(CurID,'computing all enabled transitions',
1633 compute_all_transitions2(CurID,CurState),clear_context_state).
1634
1635
1636 %catch_clpfd_overflow_call_for_state(_CurID, Call,_ExtraCleanUpCode) :-
1637 % preferences:preference(use_clpfd_solver,false),!, % Overflow should not occur
1638 % call(Call).
1639 :- use_module(clpfd_interface,[catch_clpfd_overflow_call2/2]).
1640 catch_clpfd_overflow_call_for_state(CurID, Context, Call,ExtraCleanUpCode) :-
1641 catch_clpfd_overflow_call2(Call,
1642 ( store_state_error(CurID,clpfd_overflow_error(Context),_),
1643 call(ExtraCleanUpCode)) ).
1644
1645
1646
1647
1648 :- use_module(probsrc(succeed_max),[reset_max_reached/0,max_reached/0, max_reached/1]).
1649 compute_all_transitions2(CurID,CurState) :- /* compute all outgoing transitions for a given node */
1650 % set_context_state(CurID), % error_context is set for each operation below anyway.
1651 reset_max_reached,
1652 prepare_state_for_specfile_trans(CurState,CurID,PreparedCurState), % will perform unpacking of constants just once, for example
1653 ((time_out_preference_disabled % e.g., when using probcli -disable_time_out
1654 ; use_no_timeout(CurID))
1655 -> add_transitions_fail_loop(CurID,PreparedCurState)
1656 ; preferences:preference(time_out,CurTO),
1657 add_transitions__with_timeout_fail_loop(CurID,PreparedCurState,CurTO)
1658 ),
1659 add_partial_transitions(CurID,PreparedCurState), % also copies unsat component infos
1660 (max_reached -> assert_max_reached_for_node(CurID),MaxReached=true ; MaxReached=false),
1661 % TO DO: use max_reached(OpID)
1662 (CurID==root -> save_constants(MaxReached) ; add_new_transitions_to_cache(CurID))
1663 . %,clear_context_state.
1664
1665 :- use_module(error_manager,[get_virtual_time_out_from_exception/2]). % used by time_out_with_enum_warning_for_findall
1666 % loop to compute successor states without a time_out
1667 add_transitions_fail_loop(CurID,CurState) :-
1668 catch(
1669 add_transitions_fail_loop2(CurID,CurState,TimeOutRes),
1670 Exc,
1671 get_virtual_time_out_from_exception(Exc,TimeOutRes)),
1672 (nonvar(TimeOutRes),
1673 (TimeOutRes=operation_time_out(Op,TimeOutRes2)
1674 -> assert_time_out_for_node(CurID,Op,TimeOutRes2)
1675 ; assert_time_out_for_node(CurID,'unspecified_operation',TimeOutRes))
1676 ; true).
1677
1678 add_transitions_fail_loop2(CurID,CurState,_) :-
1679 ? possible_trans_name_for_successors(CurState,ActionName),
1680 % we could check pge info here (e.g., store one Predecessor ID and look if ActionName can be enabled after)
1681 set_error_context(operation(ActionName,CurID)),
1682 ? add_transition(CurID,CurState,ActionName,_NewId), % TO DO: transmit animation_mode value?
1683 fail.
1684 add_transitions_fail_loop2(_,_,OpTimeOutRes) :-
1685 (enumeration_warning_occured_in_error_scope
1686 -> (virtual_time_out_occured_in_error_scope(TimeOutRes)
1687 -> % i.e., critical enumeration warning occurred
1688 (get_error_context(operation(ActionName,_))
1689 -> OpTimeOutRes = operation_time_out(ActionName,TimeOutRes)
1690 ; OpTimeOutRes = operation_time_out('unspecified_operation',TimeOutRes))
1691 ; true),
1692 clear_enumeration_warnings
1693 ; true % no warnings: sunshine case
1694 ),
1695 clear_error_context.
1696
1697 possible_trans_name_for_successors(CurState,ActionName) :-
1698 ? specfile_possible_trans_name_for_successors(CurState,ActionName),
1699 (preference(store_only_one_incoming_transition,true), % SAFETY_MODEL_CHECK
1700 nonvar(ActionName),
1701 b_or_z_mode,
1702 b_operation_cannot_modify_state(ActionName) % we have a skip operation
1703 -> operation_not_yet_covered(ActionName)
1704 % if operation covered: all we could is create a self-loop, which would not be added to the state space anyway
1705 ; true).
1706
1707
1708 :- use_module(library(timeout),[time_out/3]).
1709 my_timeout_test(1000000) :- write('.'), !, my_timeout_test(0).
1710 my_timeout_test(X) :- X1 is X+1, my_timeout_test(X1).
1711 :- public my_timeout_test/0.
1712 my_timeout_test :- time_out(my_timeout_test(0),500,TO), nl,
1713 print(time_out_result(TO)),nl, TO==time_out.
1714 :- assert_must_succeed(tcltk_interface:my_timeout_test).
1715
1716 add_transitions__with_timeout_fail_loop(CurID,CurState,CurTO) :-
1717 enter_new_error_scope(Level,add_transitions__with_timeout_fail_loop),
1718 call_cleanup(add_transitions__with_timeout_fail_loop2(Level,CurID,CurState,CurTO),
1719 exit_error_scope(Level,_,add_transitions__with_timeout_fail_loop)).
1720
1721 % old profiler
1722 :- use_module(runtime_profiler,[profile_failure_driven_loop/2]).
1723
1724 % the loop to compute all successors of state CurID with a time-out
1725 add_transitions__with_timeout_fail_loop2(Level,CurID,CurState,CurTO) :- % statistics(runtime,_),
1726 % TO DO: prepare computing the state: expanding const and vars, unpacking, ...
1727 ? possible_trans_name_for_successors(CurState,ActionName),
1728 profile_failure_driven_loop(ActionName,CurID),
1729 % Note: we enumerate possible transition names so that we can catch the time-out per name !
1730 % statistics(runtime,[T1,DeltaT]), print(delta_time(ActionName,DeltaT)),nl, %%
1731 % first enumerate possible Operations/... to obtain timeout per operation/...
1732 % TO DO: divide CurTO by number of transitions ???
1733 % We could also decide to have one time-out per state, only if that one is triggered move to
1734 % finer-grained timeouts
1735 % For probcli ../prob_examples/public_examples/B/Benchmarks/Cruise_finite1.mch --model-check, there are 35360 calls to timeout/3 (one per state the model checker reached and per transition group), with -disable-timeout none
1736 % In SICS 4.3.5 the runtime increased from 1.480 to 2.270 seconds = 0.022 ms per timeout call
1737 % In SICS 4.4.1 the runtime increased from 1.494 to 3.033 seconds. = 0.044 ms per timeout call.
1738 %% statistics(runtime,[T1,_]), print(try(ActionName,T1)),nl,%%
1739 set_error_context(operation(ActionName,CurID)),
1740 ? time_out_with_enum_warning_for_findall_in_current_error_scope(Level,
1741 add_transition(CurID,CurState,ActionName,_NewId),CurTO,TimeOutRes),
1742 %% statistics(runtime,[T2,_]), TDiff is T2-T1, print(added_transition(CurID,ActionName,TDiff,TimeOutRes)),nl, %%
1743 %% add_transition(CurID,CurState,ActionName,_NewId) ,
1744 ((TimeOutRes==time_out ; nonvar(TimeOutRes),TimeOutRes=virtual_time_out(_), \+ max_reached(ActionName))
1745 % virtual time outs not relevant if we have already stopped earlier anyway; TO DO: does not seem to work for INITIALISATION
1746 -> (TimeOutRes=virtual_time_out(_) -> true
1747 ; print_message('TIME OUT: '),print_message(CurID),
1748 print_message(CurTO),print_message(ActionName)
1749 ),
1750 (var(ActionName)
1751 -> assert_time_out_for_node(CurID,'unspecified_operation',TimeOutRes)
1752 ; assert_time_out_for_node(CurID,ActionName,TimeOutRes)) % TO DO: assert info per ActionSkeleton ?
1753 ; true
1754 ),fail.
1755 add_transitions__with_timeout_fail_loop2(_,_,_,_) :- clear_error_context.
1756 % statistics(runtime,[_,DeltaT]), print(delta_time(end,DeltaT)),nl.
1757
1758 % compute and add transition to next states
1759 add_transition(CurID,CurState,ActionName,NewId) :-
1760 /* ActionName maybe pre-instantiated */
1761 extract_infos_from_prepared_state(CurState,PrecomputedInfos),
1762 ? specfile_trans(CurState,ActionName,Act,NewExpression,TransInfo,Residue),
1763 %% print_bt_message(specfile_trans(CurState,ActionName,Act,NewExpression,TransInfo,Residue)), %%
1764 add_trans_id_with_infos(CurID,PrecomputedInfos,Act,NewExpression,Residue,NewId,TransInfo,_).
1765
1766
1767 % after being computed, add a new transition in the state space; adding the destination state if required
1768 add_trans_id_with_infos(CurID,PrecomputedInfos,Act,NewExpression,Residue,NewID,TransInfo,TransId) :-
1769 (Residue=[] -> true
1770 ; add_error(add_trans_id,'Residue: ',CurID:Act:Residue),
1771 tools_printing:print_goal(Residue),nl
1772 ),
1773 add_new_transition_transid_with_infos(CurID,PrecomputedInfos,Act,NewID,NewExpression,TransInfo,TransId).
1774
1775 add_trans_id(CurID,Act,NewExpression,NewID,TransId) :-
1776 add_trans_id_with_infos(CurID,[],Act,NewExpression,[],NewID,[],TransId).
1777
1778 add_partial_transitions(root,CurState) :-
1779 /* for the moment the only state where partial transitions are computed */
1780 ? \+ any_transition(root,_,_), /* adding normal transitions was not successful */
1781 partial_trans(CurState,Act,NewExpression,Residue),
1782 add_trans_id_with_infos(root,[],Act,NewExpression,Residue,_NewID,[],_),fail.
1783 add_partial_transitions(_CurID,_).
1784
1785 /* --------------------------------------------------------------------- */
1786
1787 /* A bit like AO* algorithm: expands open nodes (i.e., states whose transitions
1788 have not yet been computed */
1789
1790 :- use_module(model_checker).
1791
1792 tcltk_model_check(Nr,TclTkRes,FindDeadlocks,FindInvViolations,FindGoal,FindAssViolations,
1793 FindStateErrors,StopFullCoverage,PartialOrderReduction,PartialGuardsEvaluation,TIMELIMIT,TotalTime) :-
1794 statistics(walltime,[CurTime,_]), /* get current time in ms */
1795 LimitTime is CurTime+TIMELIMIT,
1796 %debug_println(10,start_tcltk_model_check(Nr,TIMELIMIT)),
1797 InspectExistingNodes = 0,
1798 (do_model_check(Nr,_A,LimitTime,Res,FindDeadlocks,FindInvViolations,FindGoal,
1799 FindAssViolations,FindStateErrors,StopFullCoverage,
1800 PartialOrderReduction,PartialGuardsEvaluation,InspectExistingNodes)
1801 -> translate_error_for_tclk(Res,TclTkRes)
1802 ; add_internal_error('Call failed: ',do_model_check(Nr,_A,LimitTime,Res,FindDeadlocks,FindInvViolations,FindGoal,
1803 FindAssViolations,FindStateErrors,StopFullCoverage,
1804 PartialOrderReduction,PartialGuardsEvaluation,InspectExistingNodes)),
1805 TclTkRes=error),
1806 statistics(walltime,[CurTime2,_]),
1807 TotalTime is CurTime2-CurTime,
1808 debug_println(10,tcltk_model_check(Nr,TotalTime,Res)).
1809
1810 translate_error_for_tclk([timeout,Nr],Res) :- !, Res=[timeout,Nr].
1811 translate_error_for_tclk(state_error(S),String) :- !, translate_state_err_for_tcltk(S,String).
1812 translate_error_for_tclk(S,R) :- atomic(S),!,R=S.
1813 translate_error_for_tclk(S,R) :- nonvar(S), add_error(translate_error_for_tclk,'Unknown Model Check result: ',S), R=unknown.
1814
1815 translate_state_err_for_tcltk(abort_error(TYPE,_,_,_),ERR) :- !, ERR = TYPE.
1816 translate_state_err_for_tcltk(eventerror(Event,Error,_),ERR) :- !,
1817 functor(Error,F,_),
1818 ajoin(['event_error:',Event,':',F],ERR).
1819 translate_state_err_for_tcltk(Error,ERR) :-
1820 functor(Error, StateError, _), atom_concat('state_error:',StateError,ERR).
1821
1822
1823
1824 do_model_check(_Nr,NodesAnalysed,_LimitTime,Res,FindDeadlocks,FindInvViolations,FindGoal,
1825 FindAssViolations,FindStateErrors,_StopFullCoverage,
1826 _PartialOrderReduction,_PartialGuardsEvaluation,ForceInspectExistingNodes) :-
1827 (tcltk_state_space_only_has_root_node -> true % Then also look at the root node
1828 ; ForceInspectExistingNodes == 1),
1829 ? search_among_existing_nodes(Res,FindDeadlocks,FindInvViolations,FindGoal,
1830 FindAssViolations,FindStateErrors),
1831 Res \=all, NodesAnalysed=0.
1832 do_model_check(LimitNr,NodesAnalysed,LimitTime,Res,FindDeadlocks,FindInvViolations,FindGoal,
1833 FindAssViolations,FindStateErrors,StopFullCoverage,PartialOrderReduction,PartialGuardsEvaluation,_) :-
1834 update_ass(FindAssViolations,FindAssViolations2),
1835 open_search(LimitNr,NodesAnalysed,LimitTime,Res,FindDeadlocks,FindInvViolations,FindGoal,
1836 FindAssViolations2,FindStateErrors,StopFullCoverage,PartialOrderReduction,PartialGuardsEvaluation).
1837
1838 update_ass(1,FindAssViol) :- \+ b_machine_has_assertions,!, % no need to check assertions
1839 FindAssViol=0.
1840 update_ass(X,X).
1841
1842 /* --------------------------------------------------- */
1843
1844 /* constraint-based checking of refinements */
1845 :- use_module(symbolic_model_checker(cbc_refinement_checks), [cbc_refinement_check/2]).
1846 tcltk_cbc_refinement_check(list(List),ErrorOccured) :-
1847 ? cbc_refinement_check(List,ErrorOccured).
1848
1849 /* constraint-based/model search for invariant violations */
1850
1851 :- dynamic cbc_inv_error_found/2.
1852
1853 tcltk_constraint_based_check(L) :- tcltk_constraint_based_check(L,_).
1854 tcltk_constraint_based_check(list(List),ErrorsOrTimeoutWereFound) :-
1855 retractall(cbc_inv_error_found(_,_)),
1856 findall(Res, (tcltk_constraint_based_check_with_timeout(OpName,ErrorDesc),
1857 (ErrorDesc=ok -> true ; assertz(cbc_inv_error_found(OpName,ErrorDesc))),
1858 string_concatenate(' == ',ErrorDesc,Res1),
1859 string_concatenate(OpName,Res1,Res)), List),
1860 %%print(list(List)),nl, %%
1861 ? (cbc_inv_error_found(_,_) ->
1862 ? (cbc_inv_error_found(_,X),X\=time_out
1863 -> ErrorsOrTimeoutWereFound=true ; ErrorsOrTimeoutWereFound=time_out
1864 )
1865 ; ErrorsOrTimeoutWereFound = false).
1866
1867 % can also be called with uninstantiated OpName
1868 tcltk_constraint_based_check_with_timeout(OpName,ErrorDesc) :-
1869 preferences:get_computed_preference(debug_time_out,DebugTimeOut),
1870 ? valid_operation_or_init(OpName,IOpName),
1871 (time_out_with_enum_warning_one_solution(tcltk_constraint_based_check_op(IOpName,ErrorDesc),DebugTimeOut,TimeOutRes)
1872 -> (is_time_out_result(TimeOutRes)
1873 -> print_message('TIME OUT: '), print_message(OpName), print_message(DebugTimeOut),
1874 ErrorDesc = timeout
1875 ; true
1876 )).
1877 valid_operation_or_init(OpName,R) :- OpName=='@INITIALISATION',!,R='$initialise_machine'.
1878 ?valid_operation_or_init(OpName,OpName) :- b_get_machine_operation(OpName,_,_,_).
1879 valid_operation_or_init('INITIALISATION','$initialise_machine'). % used e.g. in test 1821: -cbc INITIALISATION
1880
1881 tcltk_constraint_based_check_op(OpName,ErrorDesc) :-
1882 tcltk_constraint_based_check_op(OpName,invariant,ErrorDesc).
1883
1884 tcltk_constraint_based_check_op(TclOpName,InvOrAssertion,ErrorDesc) :-
1885 adapt_tcl_operation_name(TclOpName,OpName),
1886 tcltk_constraint_based_check_op2(OpName,InvOrAssertion,ErrorDesc).
1887
1888 % code below because names with $ cause problems in Tcl with eval
1889 adapt_tcl_operation_name(X,R) :- var(X),!,R=X.
1890 adapt_tcl_operation_name('@PROPERTIES','$setup_constants') :- !.
1891 adapt_tcl_operation_name('@INITIALISATION','$initialise_machine') :- !.
1892 adapt_tcl_operation_name(X,X).
1893
1894 % a version that allows either invariant or assertions check after an Operation OpName
1895 tcltk_constraint_based_check_op2(OpName,InvOrAssertion,ErrorDesc) :-
1896 call_cbc_command(state_model_check(OpName,InvOrAssertion,State,Operation,NewState)),!,
1897 %fd_copy_term(NewState,ResTempl,ResBody), print(ResTempl),print(ResBody),nl,
1898 %fd_copy_term(State,PriorTempl,PriorBody),
1899 tcltk_add_new_transition_transid(root,'$JUMP'(constraint_based_check),PriorID,State,[],TransId1),
1900 translate_event(Operation,Action),
1901 tcltk_add_new_transition_transid(PriorID,Operation,NewID,NewState,[],TransId2),
1902 set_current_state_id(NewID),
1903 reset_op_trace_ids,
1904 add_to_op_trace_ids(TransId1), add_to_op_trace_ids(TransId2),
1905 retractall(history(_)),
1906 retractall(forward_history(_)),
1907 assertz(history([PriorID,root])),
1908 ajoin([InvOrAssertion,'_violated_after(',Action,')'],ErrorDesc).
1909 tcltk_constraint_based_check_op2(_,_,'ok').
1910
1911
1912 % try to find constants, parameters that make a given trace feasible
1913 tcltk_cbc_find_trace(TraceToBeFound,Res) :-
1914 tcltk_cbc_find_trace(TraceToBeFound,'',first_solution,Res).
1915
1916 %:- public tcltk_cbc_find_invariant_violation/2.
1917 %tcltk_cbc_find_invariant_violation(TraceToBeFound,Res) :-
1918 % tcltk_cbc_find_trace(TraceToBeFound,'#not_invariant',first_solution,Res).
1919 % could also call tcltk_constraint_based_check_op('$initialise_machine',invariant,Res)
1920
1921 tcltk_cbc_find_trace(TraceToBeFound,TargetPredString,FindAll,Res) :-
1922 b_parse_optional_machine_predicate(TargetPredString,TargetPred),
1923 formatsilent('Looking for solution for trace ~w~n',[TraceToBeFound]),
1924 split_atom(TraceToBeFound,[',',';',' '],TraceAsList),
1925 (maplist(check_valid_operation,TraceAsList)
1926 -> start_ms_timer(Timer),
1927 tcltk_cbc_find_trace_aux(Timer,TraceAsList,TargetPred,FindAll,Res)
1928 ; Res = error).
1929 tcltk_cbc_find_trace_aux(Timer,TraceAsList,TargetPred,FindAll,Res) :-
1930 preferences:get_computed_preference(debug_time_out,DebugTimeOut),
1931 reset_nr_cbc_sols,
1932 time_out_with_enum_warning_one_solution(
1933 cbc_path_solver:create_testcase_path_nondet(init,TraceAsList,TargetPred,Transitions),DebugTimeOut,TimeOutRes),
1934 stop_ms_timer(Timer),
1935 (is_time_out_result(TimeOutRes)
1936 -> !,
1937 print_message('*** TIME OUT: '), print_message(DebugTimeOut), Res = time_out
1938 ; FindAll = findall -> inc_nr_cbc_sols,
1939 print('% *** FOUND PATH: '), maplist(print_trans,Transitions),nl,
1940 fail % backtrack to find further solutions
1941 ; !,Res = ok,
1942 print('% *** FOUND PATH: '), maplist(print_trans,Transitions),nl,
1943 maplist(extract_trans_id,Transitions,TransIds),
1944 set_trace_by_transition_ids(TransIds)
1945 ).
1946 tcltk_cbc_find_trace_aux(Timer,_TraceToBeFound,_TargetPred,findall,R) :- !, stop_ms_timer(Timer),
1947 R=nr_cbc_sols(Res),
1948 nr_cbc_sols(Res),
1949 print_message('*** ALL SOLUTIONS FOUND ').
1950 tcltk_cbc_find_trace_aux(Timer,_TraceToBeFound,_TargetPred,_FindAll,no_solution_found) :-
1951 stop_ms_timer(Timer),
1952 print_message('*** NO SOLUTION FOUND'),nl.
1953
1954 :- dynamic nr_cbc_sols/1.
1955 nr_cbc_sols(0).
1956 reset_nr_cbc_sols :- retractall(nr_cbc_sols(_)), assertz(nr_cbc_sols(0)).
1957 inc_nr_cbc_sols :-
1958 retract(nr_cbc_sols(N)), N1 is N+1, assertz(nr_cbc_sols(N1)).
1959 extract_trans_id( (TransId,_,_,_), TransId).
1960 print_trans( (_,Event,_,_)) :- translate_event(Event,S), print(S), print(' ').
1961
1962 :- use_module(probsrc(tools_matching), [get_possible_top_level_event_matches_msg/2]).
1963 check_valid_operation(Op) :-
1964 (get_possible_language_specific_top_level_event(Op,_,_) -> true
1965 ; (get_possible_top_level_event_matches_msg(Op,FMsg)
1966 -> ajoin(['Unknown operation/event (did you mean ',FMsg,' ?):'],Msg)
1967 ; Msg='Unknown operation/event:'
1968 ),
1969 add_error(cbc_find_sequence,Msg,Op),
1970 fail
1971 ).
1972
1973
1974
1975 % ------------
1976
1977 :- use_module(bsyntaxtree).
1978 tcltk_constraint_find_valid_state_with_pred(ParameterBindList,RestPreCond,UseConstantsFromStateID) :-
1979 parse_tclk_parameter_values_and_pred('$initialise_machine',ParameterBindList,RestPreCond,CustomPredicate),
1980 UseInvariant=true,
1981 call_cbc_command(
1982 b_state_model_check:b_set_up_valid_state_with_pred(State,CustomPredicate,
1983 UseInvariant,UseConstantsFromStateID)),
1984 tcltk_add_cbc_state(State,find_valid_state).
1985 tcltk_constraint_find_valid_state :-
1986 call_cbc_command(b_set_up_valid_state(State)),
1987 tcltk_add_cbc_state(State,find_valid_state).
1988
1989 :- use_module(extrasrc(optimizing_solver),[b_set_up_maximally_valid_state/2]).
1990 tcltk_constraint_find_maximal_valid_state :-
1991 current_state_id(ID),
1992 call_cbc_command(b_set_up_maximally_valid_state(ID,State)),
1993 tcltk_add_cbc_state(State,find_maximal_valid_state).
1994
1995
1996 tcltk_constraint_find_dynamic_assertion_violation :-
1997 call_cbc_command(b_find_dynamic_assertion_violation(State)),
1998 tcltk_add_cbc_state(State,cbc_dynamic_assertions_check).
1999
2000 :- use_module(clpfd_interface,[catch_clpfd_overflow_call1/1]).
2001 :- use_module(error_manager,[call_in_fresh_error_scope_for_one_solution/1]).
2002 % catch CLPFD overflows and catch other errors
2003 call_cbc_command(Command) :-
2004 call_in_fresh_error_scope_for_one_solution(
2005 (catch_clpfd_overflow_call1(Command) -> true
2006 ; translate_events_in_current_scope_to_warnings(cbc,'Warning: '),fail
2007 % Maybe we should raise error when Command fails and enumeration warnings are there ?
2008 )).
2009
2010
2011 tcltk_constraint_find_deadlock_state(Res) :-
2012 check_we_are_in_b_mode(cbc_deadlock_freedom_check),
2013 create_texpr(truth,pred,[],True),
2014 call_cbc_command(cbc_deadlock_freedom_check(State,True,0)),
2015 (State == time_out -> Res = time_out
2016 ; tcltk_add_cbc_state(State,cbc_deadlock), Res=deadlock).
2017
2018 % if Filter=1 we remove guards which are inconsitent with goal
2019 tcltk_constraint_find_deadlock_state_with_goal(Filter,Res) :-
2020 check_we_are_in_b_mode(cbc_deadlock_freedom_check),
2021 (b_get_machine_goal(Goal) -> true ; create_texpr(truth,pred,[],Goal)),
2022 call_cbc_command(cbc_deadlock_freedom_check(State,Goal,Filter)),
2023 (State == time_out -> Res = time_out
2024 ; tcltk_add_cbc_state(State,cbc_deadlock), Res=deadlock).
2025
2026 check_we_are_in_b_mode(_) :- b_or_z_mode,!.
2027 check_we_are_in_b_mode(Cmd) :- add_error(check_we_are_in_b_mode,'This command can only be performed in B,Z or TLA+ mode: ',Cmd),fail.
2028
2029 tcltk_constraint_find_deadlock_state_with_goal(true,_Filter,Res) :-
2030 !,tcltk_constraint_find_deadlock_state(Res).
2031 tcltk_constraint_find_deadlock_state_with_goal(GoalPred,Filter,Res) :-
2032 bmachine:b_set_machine_goal(GoalPred),
2033 tcltk_constraint_find_deadlock_state_with_goal(Filter,Res).
2034
2035 :- use_module(cbcsrc(enabling_analysis),[check_if_feasible_operation/5]).
2036 tcltk_check_if_feasible_operation(OpName,UseInvariant,TimeOutFactor,Result) :- % UseInvariant currently always 1 from Tcl
2037 check_if_feasible_operation(OpName,UseInvariant,TimeOutFactor,Result,ResultState),
2038 tcltk_add_cbc_state(ResultState,feasibility_check(OpName)).
2039
2040 % add a state found by constraint-based verification or other method that tries to jump to a state without all intermediate steps
2041 % it will add a separate concrete_constants state if necessary
2042 tcltk_add_cbc_state(State,OpName) :-
2043 tcltk_add_cbc_state(State,'$JUMP'(OpName),_ToID).
2044
2045 tcltk_add_cbc_state('$UNKNOWN_STATE',_,To) :- !,To=none.
2046 tcltk_add_cbc_state(State,OpNameTerm,NewID) :-
2047 seperate_state_into_const_and_vars(State,Constants,Variables),
2048 !,
2049 % store the constants separately: important for memory consumption when continuing animation/model checking
2050 tcltk_add_new_transition_transid(root,'$setup_constants',CstID,concrete_constants(Constants),[],TransId1),
2051 FullState = const_and_vars(CstID,Variables),
2052 % if Variables are [] we simply create an initialisation transition
2053 (Variables=[] -> Op='$initialise_machine' ; Op = OpNameTerm),
2054 tcltk_add_new_transition_transid(CstID,Op,NewID,FullState,[],TransId2),
2055 set_cbc_state(NewID,[TransId1,TransId2],[CstID,root]).
2056 tcltk_add_cbc_state(State,OpNameTerm,NewID) :-
2057 tcltk_add_new_transition_transid(root,OpNameTerm,NewID,State,[],TransId),
2058 set_cbc_state(NewID,[TransId],[root]).
2059
2060 set_cbc_state(NewID,TransIds,His) :-
2061 set_current_state_id(NewID),
2062 reset_op_trace_ids,
2063 maplist(add_to_op_trace_ids,TransIds),
2064 retractall(history(_)),
2065 retractall(forward_history(_)),
2066 assertz(history(His)). %, print(State),nl.
2067
2068 is_constant_binding(SortedCsts,bind(ID,_)) :-
2069 ord_member(ID,SortedCsts).
2070
2071 :- use_module(bsyntaxtree, [get_texpr_ids/2]).
2072 seperate_state_into_const_and_vars(concrete_constants(C),Constants,Variables) :- !,
2073 Constants=C, Variables=[].
2074 seperate_state_into_const_and_vars(State,Constants,Variables) :-
2075 b_get_machine_constants(TCs), get_texpr_ids(TCs,Cs),
2076 sort(Cs,SortedCsts),
2077 include(is_constant_binding(SortedCsts),State,Constants),
2078 Constants \= [],
2079 exclude(is_constant_binding(SortedCsts),State,Variables).
2080
2081
2082
2083 tcltk_constraint_find_static_assertion_violation(TclResult) :-
2084 cbc_constraint_find_static_assertion_violation(Result,[]),
2085 functor(Result,TclResult,_).
2086 cbc_constraint_find_static_assertion_violation(Result,Options) :-
2087 call_cbc_command(cbc_static_assertions_check(State,Options)),
2088 ( State = counterexample_found(CE) ->
2089 Result = counterexample_found,
2090 tcltk_add_cbc_state(CE,static_assertion_check)
2091 ;
2092 Result = State).
2093
2094 /* --------------------------------------------------- */
2095
2096
2097 :- use_module(error_manager,[extract_all_line_col/5]).
2098 :- use_module(probcspsrc(haskell_csp),[extract_span_from_event/4,extract_span_info/2]).
2099
2100 get_source_text_positions(Event,Line,Col,EndLine,EndCol) :-
2101 extract_span_from_action(Event,SPAN),
2102 extract_all_line_col(SPAN,Line,Col,EndLine,EndCol).
2103
2104 extract_span_from_action(Event,Span) :- csp_mode,
2105 extract_span_from_event(Event,Span,_,_).
2106 extract_span_from_action(Event,Pos) :- b_or_z_mode,
2107 get_operation_name(Event,ID),
2108 b_get_machine_operation(ID,_Res,_TParas,_Body,_OType,Pos).
2109
2110
2111 /* -------------------------------------------------------------------- */
2112
2113 get_current_option_eventtrace(OptionNum,TraceInfo) :-
2114 % the option number starts with 0 (coming from a TK listbox)
2115 current_options(ActionsAndIDs),
2116 nth0(OptionNum,ActionsAndIDs,(Id,_,_,_)),
2117 transition_info(Id,TraceInfo),
2118 transition_info_can_be_shown(TraceInfo),!.
2119
2120 transition_info_can_be_shown(eventtrace(_)).
2121 transition_info_can_be_shown(path(_)).
2122
2123
2124 tcltk_has_eventtrace(OptionNum) :-
2125 get_current_option_eventtrace(OptionNum,_Trace).
2126
2127 tcltk_show_eventtrace(OptionNum,Desc) :-
2128 get_current_option_eventtrace(OptionNum,Trace),
2129 explain_transition_info(Trace,Desc).
2130
2131
2132
2133 /* --------------------------------------------------- */
2134
2135 :- use_module(prob2_interface,[execute_model/5]).
2136
2137 tcltk_execute_model(MaxNrSteps,ExecutedSteps,Result) :-
2138 current_state_id(CurID),
2139 execute_model(CurID,MaxNrSteps,_TransitionInfo,ExecutedSteps,Result).
2140
2141
2142 tcltk_find_shortest_trace_to_current_node(list(StringList)) :-
2143 find_trace_to_current_node(OpL),
2144 translate_events(OpL,StringList).
2145
2146
2147 tcltk_execute_trace_to_current_node :-
2148 current_state_id(CurID),
2149 tcltk_execute_trace_to_node(CurID).
2150
2151 tcltk_execute_trace_to_node(ToID) :- /* can be useful for TestCase Generation */
2152 set_target_id(ToID),
2153 tcltk_execute_trace_from_to_found_predicate(root,_,_).
2154
2155 % execcute longest loop-free trace (no repeated state)
2156 tcltk_execute_longest_trace_from(From) :-
2157 set_longest_trace_target,
2158 tcltk_execute_trace_from_to_found_predicate(From,_,_).
2159
2160 % OpL is list of operation ids, IDList is list of state ids
2161 tcltk_execute_trace_from_to_found_predicate(From,OpL,IDList) :-
2162 debug_println(19,finding_trace_from_to(From)), flush_output(user),
2163 find_shortest_path_from_to_found_predicate(From,OpL,IDList,ToID), !,
2164 (current_state_id(From) -> true ; state_space_reset),
2165 debug_println(9,executing_trace(From,OpL,ToID)), flush_output(user),
2166 execute_id_trace_from_current(ToID,OpL,IDList).
2167
2168
2169 find_trace_to_current_node(Trace) :-
2170 current_state_id(CurID),
2171 find_shortest_path_from_to(root,CurID,L,_),
2172 extract_term_trace_from_transition_ids(L,Trace).
2173
2174 :- use_module(state_space_dijkstra).
2175
2176 find_shortest_trace_to_node(FromID,ToID,OpIDListe,StateIDList) :-
2177 find_shortest_path_from_to(FromID,ToID,OpIDListe,StateIDList).
2178
2179
2180 /* --------------------------------------------------- */
2181
2182
2183
2184 tcltk_goto_a_non_deterministic_node(Msg) :- /* same transition leads to different resulting state */
2185 visited_expression_id(ID),
2186 external_functions:non_det_transition(ID,_OpName,TID1,TID2),
2187 tcltk_execute_trace_to_node(ID),
2188 transition(ID,Op1,TID1,ID1),
2189 transition(ID,_Op2,TID2,ID2),
2190 translate_event_with_src_and_target_id(Op1,ID,ID1,OpStr),
2191 ajoin(['Operation leads to at least two different states (ids ', ID1,', ',ID2,
2192 ') for same arguments: ', OpStr], Msg).
2193
2194 tcltk_goto_a_non_deterministic_output_node(Msg) :- /* same transition leads to different outputs */
2195 visited_expression_id(ID),
2196 external_functions:non_det_output_transition(ID,_OpName,TID1,TID2),
2197 tcltk_execute_trace_to_node(ID),
2198 transition(ID,Op1,TID1,ID1),
2199 transition(ID,Op2,TID2,ID2),
2200 translate_event_with_src_and_target_id(Op1,ID,ID1,OpStr1),
2201 translate_event_with_src_and_target_id(Op2,ID,ID2,OpStr2),
2202 ajoin(['Operation has at least two different results for same arguments: ', OpStr1,
2203 '\n and ',OpStr2], Msg).
2204
2205 dif_ID(ID1,ID2) :- (number(ID1),number(ID2) -> ID2>ID1 ; ID1 \= ID2).
2206
2207 tcltk_goto_a_branching_node :- /* two different events/operations enabled */
2208 transition(ID,X,ID2), get_operation_name(X,NX),
2209 transition(ID,Y,ID3), dif_ID(ID2,ID3), get_operation_name(Y,NY), NX\=NY,
2210 print_message(found_branching_op(ID,NX,NY)),
2211 %tcltk_goto_state(find_branching_node,ID),
2212 tcltk_execute_trace_to_node(ID).
2213
2214 tcltk_goto_a_non_resetable_node :-
2215 find_resetable_nodes,
2216 visited_expression_id(ID),
2217 \+(resetable_node(ID)),
2218 \+(not_all_transitions_added(ID)), !,
2219 %tcltk_goto_state(find_non_resetable_node,ID).
2220 tcltk_execute_trace_to_node(ID).
2221
2222 :- use_module(bmachine,[b_get_machine_operation_for_animation/4]).
2223 operation_name_covered(OpName) :- operation_name_covered(OpName,_).
2224 operation_name_covered(OpName,Template) :-
2225 b_get_machine_operation_for_animation(OpName,Results,Par,_),
2226 \+ operation_not_yet_covered(OpName),
2227 length(Par,Arity),
2228 functor(Op,OpName,Arity),
2229 (Results\=[] -> Template = '-->'(Op,_) ; Template = Op).
2230
2231 tcltk_goto_event_list_property_violation(Property,EventSelection,list(OperationList)) :-
2232 % first translate Tk EventSelection Number list into Events
2233 sap:get_selected_events(EventSelection,_AllEvents,OperationList),
2234 include(operation_name_covered,OperationList,_,EnabledOpList), % only keep operations that can be enabled anyway
2235 maplist(operation_name_covered,EnabledOpList,TemplateList), % replace by template
2236 print(find_property_violation_for_template(Property,TemplateList)),nl,
2237 visited_expression(ID,S), ID \= root, S\= concrete_constants(_),
2238 \+(not_all_transitions_added(ID)),
2239 \+( check_event_list_property(Property,ID,TemplateList) ),
2240 print(found_event_list_property_violation(Property,ID)),nl,
2241 tcltk_execute_trace_to_node(ID).
2242
2243 check_event_list_property(relative_deadlock_freedom,ID,TemplateList) :-
2244 relative_deadlock_freedom(ID,TemplateList).
2245 check_event_list_property(valid_controller,ID,TemplateList) :-
2246 is_valid_controller_state(ID,TemplateList).
2247 check_event_list_property(det_controller,ID,TemplateList) :-
2248 is_det_controller_state(ID,TemplateList).
2249
2250 relative_deadlock_freedom(ID,TemplateList) :- member(Template,TemplateList),
2251 transition(ID,Template,_).
2252 is_valid_controller_state(ID,TemplateList) :- % check that exactly one event from TemplateList is enabled
2253 append(_,[LiveEvent|RestTemplate],TemplateList),
2254 transition(ID,LiveEvent,_),!, % we found one enabled event
2255 \+ relative_deadlock_freedom(ID,RestTemplate). % all other events from list must be disabled
2256 is_det_controller_state(ID,TemplateList) :- % check that *at most* one event from TemplateList is enabled
2257 append(_,[LiveEvent|RestTemplate],TemplateList),
2258 transition(ID,LiveEvent,_),!, % we found one enabled event from list
2259 \+ relative_deadlock_freedom(ID,RestTemplate). % all other events from list must be disabled
2260 is_det_controller_state(_,_) :- true. % no event enabled is also ok
2261
2262
2263 tcltk_goto_state_enabling_operation(TclOpName,FromCurrent) :-
2264 adapt_tcl_operation_name(TclOpName,OpName),
2265 operation_name_covered(OpName,Template), % does cater for Event-B any vars
2266 set_found_predicate(ID, transition(ID,Template,_)),
2267 print_message('Computing trace to node'),
2268 (FromCurrent=1
2269 -> current_state_id(FromID) % inefficient: better to do one dijkstra from FromID !
2270 ; FromID = root
2271 ),
2272 tcltk_execute_trace_from_to_found_predicate(FromID,_,_).
2273 % tcltk_goto_state(find_enabled(OpName),ID).
2274
2275
2276 :- use_module(tools_lists,[count_occurences/2]).
2277 % quickly compute which operations have already been covered and which ones not
2278 tcltk_operations_covered_info(list([list(['Operation','Covered'])|OpCov]),list(Occurences),Precise) :-
2279 findall(list([OpName,Cov]),
2280 (specfile:get_possible_event(OpName),
2281 (operation_name_not_yet_covered(OpName)
2282 -> not_yet_covered_info(Precise,OpName,Cov)
2283 ; Cov = 'yes')),OpCov),
2284 (maplist(get_cov,OpCov,Cov2),
2285 count_occurences(Cov2,Occ2),
2286 maplist(construct_list,Occ2,Occurences) -> true ; Occurences=[]).
2287
2288 get_cov(list([_,Cov|_]),Cov).
2289 construct_list(Kind-Nr,list([Kind,Nr])).
2290
2291 :- use_module(cbcsrc(enabling_analysis),[feasible_operation/2]).
2292 not_yet_covered_info(precise,OpName,Cov) :-
2293 feasible_operation(OpName,Res),!, Res=Cov.
2294 not_yet_covered_info(precise,_,R) :- !, R='unknown'.
2295 not_yet_covered_info(_,_,'uncovered').
2296
2297 :- dynamic resetable_node/1.
2298
2299 resetable_node(a).
2300
2301 :- public find_resetable_nodes/0.
2302 :- dynamic find_flag/2.
2303 find_resetable_nodes :-
2304 retractall(find_flag(_,_)),
2305 retractall(resetable_node(_)),
2306 any_transition(root,_,ID), /* add nodes reachable from root */
2307 assertz(find_flag(ID,0)),
2308 fail.
2309 find_resetable_nodes :-
2310 visited_expression(CID,concrete_constants(_C)),
2311 any_transition(CID,_,ID), /* add nodes reachable after a setup_constants */
2312 assertz(find_flag(ID,0)),
2313 fail.
2314 find_resetable_nodes :- find_resetable_nodes_loop,
2315 print_message('Not resetable:'),
2316 visited_expression_id(ID),
2317 \+(resetable_node(ID)),
2318 print_message(ID),
2319 fail.
2320 find_resetable_nodes :-
2321 print_message('Done').
2322
2323
2324 find_resetable_nodes_loop :-
2325 retract(find_flag(ID,N)), !, find_resetable_nodes_loop(ID,N).
2326 find_resetable_nodes_loop.
2327
2328 find_resetable_nodes_loop(ID,N) :- N1 is N+1,
2329 assertz(resetable_node(ID)),
2330 any_transition(NewID,_,ID),
2331 \+(resetable_node(NewID)),
2332 \+(find_flag(NewID,_)),
2333 assertz(find_flag(NewID,N1)),
2334 fail.
2335 find_resetable_nodes_loop(_,_) :- find_resetable_nodes_loop.
2336
2337
2338 :- use_module(specfile, [get_current_state_for_b_formula/2]).
2339
2340 tcltk_show_expression_as_dot(VorE,File) :-
2341 parse_machine_expression(VorE,TypedExpr),
2342 tcltk_show_typed_expression_as_dot_graph(TypedExpr,File).
2343 tcltk_show_expression_as_dot(_VorE,File) :-
2344 add_error(tcltk_show_expression_as_dot,'Computing Value Dot Representation Failed for: ',File),
2345 fail.
2346
2347 :- use_module(dotsrc(state_as_dot_graph),[print_cstate_graph/2]).
2348 :- use_module(dotsrc(state_custom_dot_graph),[tcltk_generate_state_custom_dot_graph_for_expr/2, is_valid_custom_dot_graph_record/1]).
2349
2350 tcltk_show_typed_expression_as_dot_graph(TypedExpr,File) :-
2351 is_valid_custom_dot_graph_record(TypedExpr),
2352 !, % use the more powerful custom_dot_graph mechanism
2353 tcltk_generate_state_custom_dot_graph_for_expr(TypedExpr,File).
2354 tcltk_show_typed_expression_as_dot_graph(TypedExpr,File) :-
2355 get_current_state_for_b_formula(TypedExpr,BState),
2356 extend_state_with_probids_and_lets(BState,BState1),
2357 decompose_expression_for_dot(TypedExpr,ExprList,[]), % decompose pairs so that user can provide multiple values/graphs
2358 compute_for_dot(ExprList,BState1,GraphState), % compute value for each sub-component
2359 format('Writing value to DOT file: ~w~n',[File]),
2360 print_cstate_graph(GraphState,File),
2361 format('Finished writing value to DOT file: ~w~n',[File]).
2362
2363
2364 :- use_module(eval_let_store,[extend_typing_scope_for_stored_lets/2]).
2365 :- use_module(bmachine, [b_parse_machine_expression_from_codes_with_prob_ids/2, type_with_errors/4]).
2366 parse_machine_expression(RawAST,TypedExpr) :- compound(RawAST),!, % allow to pass raw AST as well
2367 extend_typing_scope_for_stored_lets([prob_ids(visible),variables,external_library(safe_available_libraries)],Scope),
2368 type_with_errors(RawAST,Scope,Type,TypedExpr),
2369 % TODO: get_stored_let_typing_scope and add values to state returned by get_current_state_for_b_formula
2370 ((Type=pred ; Type=subst)
2371 -> add_error(parse_machine_expression,'Expected expression formula but obtained: ',Type),fail
2372 ; true ).
2373 parse_machine_expression(VorE,TypedExpr) :-
2374 atom_codes(VorE,VorECodes),
2375 b_parse_machine_expression_from_codes_with_prob_ids(VorECodes,TypedExpr).
2376
2377 compute_for_dot([],_,[]).
2378 compute_for_dot([String,TypedExpr|Tail],BState,[bind(Str,Value)|TS]) :-
2379 % allow user to specify labels for graphs ("lbl1", e1, "lbl2", e2, ...)
2380 get_texpr_expr(String,string(Str)),!,
2381 translate:translate_bexpression_with_limit(TypedExpr,100,EStr),
2382 format('Computing value for expression: ~w~n',[EStr]),
2383 b_compute_expression_with_prob_ids(TypedExpr,BState,Value),
2384 compute_for_dot(Tail,BState,TS).
2385 compute_for_dot([TypedExpr|Tail],BState,[bind(Str,Value)|TS]) :-
2386 translate:translate_bexpression_with_limit(TypedExpr,100,Str),
2387 format('Computing value for expression: ~w~n',[Str]),
2388 b_compute_expression_with_prob_ids(TypedExpr,BState,Value),
2389 compute_for_dot(Tail,BState,TS).
2390
2391 :- use_module(bsyntaxtree, [replace_ids_by_exprs/4]).
2392
2393 % decompose_expression_for_dot ensures that
2394 % ("label1",graph1,"lbl2",graph2) or rec(label:graph) is decomposed and we can associate labels with multiple graphs
2395 decompose_expression_for_dot(b(couple(A,B),_,_)) --> !,
2396 decompose_expression_for_dot(A), decompose_expression_for_dot(B).
2397 decompose_expression_for_dot(b(rec(Fields),_,_)) --> !,decompose_fields_for_dot(Fields).
2398 decompose_expression_for_dot(b(let_expression(Ids,Exprs,Body),couple(_,_),_)) --> !,
2399 % this can happen when OPTIMIZE_AST is set to FALSE and the Jupyter kernel adds LETs; lift string out of let
2400 % :dot expr_as_graph ("h",h,"hh",(h;h))
2401 {replace_ids_by_exprs(Body,Ids,Exprs,Body2)},
2402 decompose_expression_for_dot(Body2).
2403 decompose_expression_for_dot(X) --> [X].
2404
2405
2406 decompose_fields_for_dot([]) --> [].
2407 decompose_fields_for_dot([field(Name,Val)|T]) --> [b(string(Name),string,[]),Val], decompose_fields_for_dot(T).
2408
2409 /* ------------------------------------------------------------------ */
2410
2411 % aka Execute by Predicate
2412 tcltk_add_user_executed_operation(TclOpName,CustomPredicate) :-
2413 tcltk_add_user_executed_operation(TclOpName,[],CustomPredicate).
2414
2415 tcltk_add_user_executed_operation(TclOpName,ParameterBindList,RestPreCond) :-
2416 adapt_tcl_operation_name(TclOpName,OpName),
2417 parse_tclk_parameter_values_and_pred(OpName,ParameterBindList,RestPreCond,CustomPredicate),
2418 current_state_id(CurID),
2419 get_computed_preference(debug_time_out,DTO),
2420 time_out_with_enum_warning_one_solution(b_trans_one_solution_with_pred(OpName,CustomPredicate,CurID,_,_,_),
2421 DTO,TimeOutRes),
2422 (is_time_out_result(TimeOutRes)
2423 -> add_warning(execute_by_predicate,'Timeout occured trying to execute operation with predicate: ',TclOpName),fail
2424 ; true).
2425
2426 parse_tclk_parameter_values_and_pred(OpName,ParameterBindList,RestPreCond,CustomPredicate) :-
2427 GenParseErrors=true, ExtraScope=[],
2428 b_parse_machine_operation_pre_post_predicate(RestPreCond,ExtraScope,RestTypedPred,OpName,GenParseErrors),
2429 get_animation_operation_parameters(OpName,Parameters),
2430 % print(tcltk_add_user_executed_operation(OpName,ParameterBindList,Parameters)),nl,
2431 parse_parameter_values(ParameterBindList,OpName,Parameters,List),
2432 conjunct_predicates([RestTypedPred|List],CustomPredicate).
2433
2434 :- use_module(bmachine,[b_get_machine_operation_for_animation/7]).
2435 get_animation_operation_parameters('$setup_constants',Parameters) :-
2436 b_get_machine_operation_typed_parameters('$setup_constants',Parameters).
2437 get_animation_operation_parameters(OpName,FullParameters) :-
2438 TopLevel=true, % otherwise ANY parameters not added when show_eventb_any_arguments is true
2439 b_get_machine_operation_for_animation(OpName,_Results,Parameters,_Body,_OType,TopLevel,_OpPos),
2440 b_get_operation_non_det_modifies(OpName,NonDetVars), % also allow setting non-deterministically assigned vars
2441 b_get_machine_variables(Vars),
2442 include(non_det_modified(NonDetVars),Vars,ParaVars),
2443 append(ParaVars,Parameters,FullParameters).
2444
2445 non_det_modified(NonDetVars,TID) :- get_texpr_id(TID,ID), ord_member(ID,NonDetVars).
2446
2447 % parse a list of variable names and expressions and turn into equal predicates
2448 % Motivation: this can also deal with Z-style identifiers like in?, ... which cannot be parsed
2449 :- use_module(btypechecker, [unify_types_strict/2, coerce_type/4]).
2450 :- use_module(extrasrc(before_after_predicates),[prime_dollar0_bexpr_for_ids/3]).
2451 :- use_module(probsrc(b_read_write_info), [b_get_read_write/3]).
2452
2453 parse_parameter_values([],_,_,Res) :- !,Res=[].
2454 parse_parameter_values(['='(ParameterID,ExpressionStr)|T],OpName,Parameters,[Pred|PT]) :-
2455 atom_codes(ExpressionStr,Codes),
2456 format('Parsing for parameter ~w : ~w~n',[ParameterID,ExpressionStr]),
2457 !,
2458 b_parse_machine_expression_from_codes_with_prob_ids(Codes,TypedExpr),
2459 get_texpr_type(TypedExpr,Type),
2460 TID = b(identifier(ParameterID),ExpectedType,[]),
2461 % if we reference a modified variable in the expression, we replace id by id$0 :
2462 b_get_read_write(OpName,_,Written),
2463 prime_dollar0_bexpr_for_ids(TypedExpr,Written,PrimedTypedExpr),
2464 write(primed(PrimedTypedExpr)),nl,
2465 (member(b(identifier(ParameterID),ExpectedType,_),Parameters)
2466 -> (unify_types_strict(Type,ExpectedType)
2467 -> safe_create_texpr(equal(TID,PrimedTypedExpr),pred,Pred),
2468 parse_parameter_values(T,OpName,Parameters,PT)
2469 ; coerce_type(Type,ExpectedType,PrimedTypedExpr,NewTypedExpr)
2470 -> safe_create_texpr(equal(TID,NewTypedExpr),pred,Pred),
2471 add_message(parse_parameter_values,'Coercion of provided parameter value: ',NewTypedExpr),
2472 parse_parameter_values(T,OpName,Parameters,PT)
2473 ;
2474 pretty_type(Type,String1), pretty_type(ExpectedType,String2),
2475 ajoin(['Value for parameter ',ParameterID,' has unexpected type ',String1,', expected: '],Msg),
2476 add_error(parse_parameter_values,Msg,String2),
2477 fail
2478 )
2479 ; add_error(parse_parameter_values,'Unknown operation parameter: ',ParameterID),
2480 fail).
2481 parse_parameter_values(PB,OpName,P,_) :-
2482 add_internal_error('Illegal parameter binding: ',parse_parameter_values(PB,OpName,P,_)),fail.
2483
2484
2485 % just as above but with typed predicate
2486 tcltk_add_user_executed_operation_typed(OpName,Operation,TypedCustomPredicate,NewID) :-
2487 current_state_id(CurID),
2488 tcltk_add_user_executed_operation_typed(OpName,CurID,Operation,TypedCustomPredicate,_,NewID).
2489 tcltk_add_user_executed_operation_typed(OpName,CurID,Operation,TypedCustomPredicate,TransID,NewID) :-
2490 b_trans_one_solution_with_pred(OpName,TypedCustomPredicate,CurID,Operation,TransID,NewID).
2491
2492 % allows the user to arbitrarily change variable values
2493 % Attention: this can of course violate the invariant
2494 tcltk_add_user_modify_variable_transition(VarID,ValueStr) :-
2495 current_state_id(CurID),
2496 tcltk_add_user_modify_variable_transition(CurID,VarID,ValueStr,_).
2497 tcltk_add_user_modify_variable_transition(CurID,VarID,ValueStr,NewID) :-
2498 get_id_type(VarID,Kind,Type),!,
2499 format('Trying to update ~w ~w to new value: ~w~n',[Kind,VarID,ValueStr]),
2500 eval_string_in_cur_state(ValueStr,ValTyped,Value),
2501 get_texpr_type(ValTyped,ValType),
2502 check_types(Kind,VarID,Type,ValType),
2503 visited_expression(CurID,CurState),
2504 update_variable(CurState,VarID,Value,NewState),
2505 Residue=[], TransInfo=[],
2506 Operation = '$modify'(string(VarID),string(ValueStr)),
2507 add_trans_id_with_infos(CurID,[],Operation,NewState,Residue,NewID,TransInfo,_),
2508 tcltk_goto_state(Operation,NewID).
2509
2510 check_types(_,_,Type,ValType) :-
2511 unify_types_strict(Type,ValType),!.
2512 check_types(Kind,VarID,Type,ValType) :-
2513 pretty_type(ValType,VTS), pretty_type(Type,TS),
2514 ajoin(['Unexpected type of value (', VTS, ' instead of ',TS,') for ',Kind,' :'],Msg),
2515 add_error(check_types,Msg,VarID),
2516 fail.
2517
2518 :- use_module(bmachine,[b_is_variable/2, b_is_constant/2]).
2519 get_id_type(ID,variable,Type) :- b_is_variable(ID,Type).
2520 get_id_type(ID,constant,Type) :- b_is_constant(ID,Type).
2521 % update variable value or constant value in concrete_constants state
2522 update_variable([],VarID,_,[]) :- add_error(update_variable,'Identifier does not exist in state:',VarID),fail.
2523 update_variable([bind(VarID,_)|T],VarID,NewVal,Res) :- !, Res = [bind(VarID,NewVal)|T].
2524 update_variable([H|T],VarID,NewVal,[H|UT]) :- !, update_variable(T,VarID,NewVal,UT).
2525 update_variable(const_and_vars(ConstID,Old),VarID,NewVal,const_and_vars(ConstID,New)) :- !,
2526 update_variable(Old,VarID,NewVal,New).
2527 update_variable(concrete_constants(Old),VarID,NewVal,concrete_constants(New)) :- !,
2528 update_variable(Old,VarID,NewVal,New). % here we allow updating constants
2529
2530 % execute operation by predicate finding just one solution
2531 b_trans_one_solution_with_pred(OpName,TypedCustomPredicate,CurID,Operation,TransId,NewID) :-
2532 catch(
2533 (
2534 call_cleanup(b_trans_one_solution_with_pred2(OpName,TypedCustomPredicate,CurID,Operation,TransId,NewID),
2535 bmachine:reset_temp_predicate)
2536 ),
2537 enumeration_warning(Cause,_,_,_,_),
2538 (
2539 add_warning(b_trans_one_solution_with_pred,
2540 'Enumeration warning prevented finding solution for operation: ',Cause),
2541 fail
2542 )
2543 ).
2544
2545 % find one solution from current state using OpName and respecting temp_predicate
2546 % Note: the predicate is evaluated in post-state, use $0 to access values in current state
2547 b_trans_one_solution_with_pred2(OpName,TypedCustomPredicate,CurID,Operation,TransId,NewID) :-
2548 (b_or_z_mode -> b_top_level_operation(OpName) ; true),
2549 !,
2550 visited_expression(CurID,InState),
2551 set_context_state(CurID,b_trans_one_solution_with_pred),
2552 debug_format(19,'Executing ~w in state ~w by predicate~n',[OpName,CurID]),
2553 ? call_cleanup(execute_operation_by_predicate_in_state(InState,OpName,TypedCustomPredicate,Operation,NewState),
2554 clear_context_state),
2555 !,
2556 debug_format(19,'Executed by predicate: ~w~n',[OpName]),
2557 %debug_format(19,'Executed ~w: ~w~nOut=~w~n',[OpName,Operation,NewState]),
2558 add_trans_id(CurID,Operation,NewState,NewID,TransId),
2559 tcltk_goto_state(Operation,NewID).
2560 b_trans_one_solution_with_pred2(OpName,TypedCustomPredicate,CurID,Operation,TransId,NewID) :-
2561 assert_temp_predicate_with_prob_def_set_elements(TypedCustomPredicate),
2562 visited_expression(CurID,InState),
2563 set_context_state(CurID,b_trans_one_solution_with_pred),
2564 temporary_set_preference(maxNrOfEnablingsPerOperation,1,Max),
2565 temporary_set_preference(maxNrOfInitialisations,1,MaxI),
2566 start_ms_timer(Timer),
2567 call_cleanup((specfile:b_trans(InState,OpName,Operation,NewState,TransInfo) -> true),
2568 (stop_ms_timer(Timer),
2569 reset_temporary_preference(maxNrOfEnablingsPerOperation,Max),
2570 reset_temporary_preference(maxNrOfInitialisations,MaxI),
2571 clear_context_state)
2572 ),
2573 debug_println(9,found_solution(NewState)),nl,
2574 % now add a transition to the state space:
2575 Residue=[],
2576 add_trans_id_with_infos(CurID,[],Operation,NewState,Residue,NewID,TransInfo,TransId),
2577 tcltk_goto_state(Operation,NewID).
2578
2579 :- use_module(b_global_sets,[inline_prob_deferred_set_elements_into_bexpr/2]).
2580 assert_temp_predicate_with_prob_def_set_elements(CustomPredicate) :-
2581 inline_prob_deferred_set_elements_into_bexpr(CustomPredicate,CompiledPred),
2582 bmachine:assert_temp_typed_predicate(CompiledPred).
2583
2584
2585 % allow user to execute any statement
2586 % TO DO: catch operation_calls and route them differently
2587 % translate operation_call arguments into predicate and call tcltk_add_user_executed_operation_typed(OpName,Operation,TypedCustomPredicate,NewID)
2588 tcltk_add_user_executed_statement(Statement,Updates,NewID) :-
2589 current_expression(CurID,InState),
2590 state_corresponds_to_initialised_b_machine(InState,BState),
2591 set_context_state(CurID,tcltk_add_user_executed_statement),
2592 %start_ms_timer(Timer),
2593 call_cleanup((tcltk_interface:b_full_execute_top_level_statement_with_probids(Statement,BState,Updates,NewState)->true),
2594 clear_context_state),
2595 % TO DO: do we need to catch enumeration warnings ?
2596 %stop_ms_timer(Timer),
2597 Residue=[], TransInfo = [],
2598 debug_println(4,executed(Updates,NewState)),
2599 compute_all_transitions_if_necessary(CurID), % first ensure we have already computed outgoing transitions as usual, so that we can detect if a new state is added
2600 (get_id_of_node_and_add_if_required(NewState,NewID,Exists,CurID,'$unknown_operation',[]),
2601 Exists=exists,
2602 transition(CurID,Action,TransId,NewID)
2603 -> debug_println(4,transition_exists_already(Action,TransId))
2604 ; translate:translate_substitution(Statement,OpLabel),
2605 add_trans_id_with_infos(CurID,[],'$USER'(OpLabel),NewState,Residue,NewID,TransInfo,_),
2606 format('Added new user-initiated transition to ~w via: ~w~n',[NewID,OpLabel])
2607 ),
2608 tcltk_goto_state(OpLabel,NewID).
2609
2610 :- use_module(eval_let_store,[extend_state_with_probids_and_lets/2]).
2611 :- use_module(kernel_waitflags,[init_wait_flags_with_call_stack/2, ground_wait_flags/1]).
2612 %% allows one to execute any statement (not just operations).
2613 b_full_execute_top_level_statement_with_probids(Body,InState,Updates,NewState) :-
2614 extend_state_with_probids_and_lets(InState,InState1),
2615 init_wait_flags_with_call_stack(WF,[prob_command_context(user_executed_statement,unknown)]),
2616 b_execute_top_level_statement(Body,[],InState1,Updates,WF,_Path1,output_not_required),
2617 ground_wait_flags(WF),
2618 store:store_updates_and_normalise(Updates,InState,NewState).
2619
2620 % --------------------------------------------------------------------------------------
2621
2622
2623 :- use_module(bmachine).
2624 :- use_module(specfile).
2625 :- use_module(tools).
2626 :- use_module(library(lists)).
2627 :- use_module(store).
2628 :- use_module(self_check).
2629 :- use_module(b_global_sets).
2630 :- use_module(translate).
2631
2632
2633 /* --------------------------------------------------------- */
2634 /* --------------------------------------------------------- */
2635
2636
2637 /* ----------------------------------*/
2638 /* b_analyse_conjunction */
2639 /* ----------------------------------*/
2640
2641
2642 /* provide list of possible options for analysis */
2643 tcltk_analyse_option(invariant,'INVARIANT') :- b_or_z_mode.
2644 tcltk_analyse_option(properties,S) :- b_or_z_mode,
2645 get_specification_description(properties,S).
2646 tcltk_analyse_option(assertions,S) :- (b_or_z_mode ; csp_mode),
2647 get_specification_description(assertions,S).
2648 tcltk_analyse_option(deadlock,'DEADLOCKED') :- b_or_z_mode.
2649
2650
2651 :- use_module(predicate_evaluator).
2652 /* perform the various analysis */
2653 tcltk_analyse(Mode,Type,ListWithResults,Total,False,Unknown) :-
2654 (Mode == unicode
2655 -> set_unicode_mode,
2656 call_cleanup(tcltk_analyse2(Type,ListWithResults,Summary),unset_unicode_mode)
2657 ; tcltk_analyse2(Type,ListWithResults,Summary)),
2658 (member(total/Total,Summary) -> true ; Total=0),
2659 (member(false/False,Summary) -> true ; False=0),
2660 (member(unknown/Unknown,Summary) -> true ; Unknown=0).
2661 tcltk_analyse2(invariant,L,Summary) :- !,tcltk_analyse_invariant(L,Summary).
2662 tcltk_analyse2(properties,L,Summary) :- !,tcltk_analyse_properties(L,Summary).
2663 tcltk_analyse2(assertions,L,Summary) :- !,tcltk_analyse_assertions(L,Summary).
2664 tcltk_analyse2(deadlock,L,Summary) :- !,tcltk_analyse_deadlock(L,Summary).
2665 tcltk_analyse2(X,L,Summary) :- add_error(tcltk_analyse, 'Unknown type of formula: ', X),
2666 L=[], Summary=[].
2667
2668
2669 /* --------------------------------- */
2670
2671 tcltk_show_current_state(TransBState) :-
2672 current_b_expression(B),
2673 translate_bstate(B,TransBState).
2674
2675
2676 tcltk_show_typing_of_variables_and_constants(list(List)) :-
2677 b_get_machine_variables(TypedVarList),
2678 convert_typed_varlist(TypedVarList,VarList,Types),
2679 generate_typing_list(VarList,Types,VList,VarCard),
2680 length(VarList,NrVars),
2681 format_to_codes(' VARIABLES [nr=~w,card=~w]',[NrVars,VarCard],Codes1),atom_codes(VARAtom,Codes1),
2682
2683 b_get_machine_all_constants(TypedCstList),
2684 convert_typed_varlist(TypedCstList,CVarList,CTypes),
2685 find_non_det_constants,
2686 generate_typing_list(CVarList,CTypes,CList,CCard),
2687 ( CList = []
2688 -> List = [VARAtom|VList]
2689 ; length(CVarList,NrCsts),
2690 format_to_codes(' CONSTANTS [nr=~w,card=~w]',[NrCsts,CCard],Codes2),atom_codes(CstAtom,Codes2),
2691 append([CstAtom|CList],[VARAtom|VList],List)
2692 ),!.
2693 tcltk_show_typing_of_variables_and_constants(list(['TYPE ERROR in MACHINE'])).
2694
2695
2696 %%% Used to get the constant values for the currently loaded B machine in form of a B predicate.
2697 %%% In case that the constants in the model has not been set up then all possible constants'
2698 %%% evaluations will be provided in form of a predicate in Disjunctive Normal Form.
2699 %%% Predicate used for setting up constants when model checking with TLC. (TLA)
2700
2701 tcltk_get_constants_predicate(Pred) :-
2702 tcltk_get_constants_predicate(root,Pred,_PredComplete).
2703 tcltk_get_constants_predicate(CurID,Pred,PredComplete) :-
2704 (CurID=root
2705 -> get_constants_as_disjoint_predicate(Pred),
2706 (max_reached_or_timeout_for_node(root) -> PredComplete = incomplete ; PredComplete = complete)
2707 ; PredComplete=complete,
2708 prob2_interface:get_state(CurID,EState),
2709 filter_constants_bindings(EState,X), % this will only get current constants values
2710 translate_bstate_to_pred(X,Pred)
2711 ).
2712
2713 get_constants_as_disjoint_predicate(Pred) :-
2714 findall(R,get_set_up_constants_solution(R),PredList),
2715 add_or_between_constant_predicates(PredList,Pred).
2716
2717 %get_a_part_of_the_found_solutions(L,N,Part,PredComplete) :-
2718 % length(L,Length),
2719 % (N>=Length
2720 % -> Part=L, PredComplete=complete
2721 % ; sublist(L,Part,_B,N,_A), PredComplete=incomplete
2722 % ).
2723
2724 translate_bstate_to_pred(State,P) :-
2725 temporary_set_preference(expand_avl_upto,-1,CHNG2),
2726 translate: translate_bstate(State,P),
2727 reset_temporary_preference(expand_avl_upto,CHNG2).
2728
2729 get_set_up_constants_solution(R) :-
2730 compute_transitions_if_necessary(root),
2731 %\+ max_reached_or_timeout_for_node(root),!, % then lookup constants rather than computing them
2732 transition(root,_,Dst),
2733 visited_expression(Dst,concrete_constants(X)),
2734 translate_bstate_to_pred(X,R).
2735 %get_set_up_constants_solution(R) :-
2736 % b_interpreter: b_set_up_concrete_constants(X,_),
2737 % translate:translate_bstate(X,R).
2738
2739 add_or_between_constant_predicates([],'1=1').
2740 add_or_between_constant_predicates(L,Res) :-
2741 tools: ajoin_with_sep(L,' or ',Res).
2742
2743 filter_constants_bindings(EState,R) :-
2744 b_get_machine_all_constants(C),
2745 convert_typed_varlist(C,CVarList,_CTypes),
2746 filter_constants_bindings1(EState,CVarList,R).
2747
2748 filter_constants_bindings1([],_,[]).
2749 filter_constants_bindings1([bind(Ident,Val)|T],CVarList,Res) :-
2750 (member(Ident,CVarList) -> Res = [bind(Ident,Val)|Rest]; Res = Rest),
2751 filter_constants_bindings1(T,CVarList,Rest).
2752
2753 convert_typed_varlist([],[],[]).
2754 convert_typed_varlist([b(identifier(ID),Type,_)|T],[ID|IT],[Type|TT]) :-
2755 %print(ID), print(' : '), print(Type),nl,
2756 % db : set(couple(global(Name),global(Code))) a : set(integer) boolean
2757 convert_typed_varlist(T,IT,TT).
2758 %--------------------------------------
2759
2760
2761 :- use_module(symsrc(symmetry_marker),[type_allows_for_precise_marker/1]).
2762 :- use_module(bmachine,[b_is_unused_constant/1]).
2763 :- use_module(library(codesio),[format_to_codes/3]).
2764 :- use_module(kernel_card_arithmetic,[safe_mul/3]).
2765 generate_typing_list([],[],[],1).
2766 generate_typing_list([Var|VT],[BasicType|TT],[Translation|Rest],TotCard) :-
2767 pretty_type(BasicType,PrettyType),
2768 (kernel_objects:max_cardinality(BasicType,Card) -> true ; Card='??'),
2769 (b_get_constant_represented_inside_global_set(Var,BasicType)
2770 -> Imp='(treated as enumerated) '
2771 ; (preference(symmetry_mode,hash),
2772 \+type_allows_for_precise_marker(BasicType))
2773 -> Imp = '(IMPRECISE for HASH) '
2774 ; Imp = ''
2775 ),
2776 (non_det_constant(Var)
2777 -> MulSol ='[multiple solutions in SETUP_CONSTANTS]'
2778 ; MulSol=''),
2779 (b_is_unused_constant(Var) -> Unused=' (unused)' ; Unused=''),
2780 % translate:translate_bexpression(b(member(identifier(Var),BasicType),pred,[]),Translation),
2781 format_to_codes('~w:~w [card=~w]~w~w~w',[Var,PrettyType,Card,MulSol,Imp,Unused],Codes),
2782 atom_codes(Translation,Codes),
2783 generate_typing_list(VT,TT,Rest,RestCard),
2784 safe_mul(RestCard,Card,TotCard).
2785
2786 :- use_module(symsrc(symmetry_marker),[hash_model_checking_imprecise/2]).
2787 :- use_module(translate,[pretty_type/2]).
2788
2789 tcltk_hash_model_checking_imprecise :-
2790 get_preference(symmetry_mode,hash),
2791 hash_model_checking_imprecise(ID,BasicType),!,
2792 print(' * Note: Hashing may be imprecise for: '),
2793 print(ID), print(' : '),translate:pretty_type(BasicType,S),print(S), print(' !'),nl.
2794
2795
2796 /* find constants which are assigned multiple values */
2797 :- dynamic non_det_constant/1.
2798 find_non_det_constants :-
2799 retractall(non_det_constant(_)),
2800 findall(Csts,visited_expression(_,concrete_constants(Csts),_),CL),
2801 (CL=[Valuation1|O],O=[_|_] -> find_non_det_constants1(Valuation1,O)
2802 ; true /* 0 or 1 valuation only */
2803 ).
2804
2805 find_non_det_constants1([],_).
2806 find_non_det_constants1([bind(C,Value)|T],Other) :- check_cst(Other, C, Value, PeeledOther),
2807 find_non_det_constants1(T,PeeledOther).
2808
2809 check_cst([],_,_,[]).
2810 check_cst([ [bind(C,OtherVal)|T1] | TT], C, Value, [ T1 | PTT]) :-
2811 (Value=OtherVal -> check_cst(TT,C,Value,PTT)
2812 ; assertz(non_det_constant(C)), peel2(TT,PTT)).
2813 peel2([],[]).
2814 peel2([ [_|T1] | TT], [ T1 | PTT]) :- peel2(TT,PTT).
2815
2816
2817 /* --------------------------------- */
2818
2819
2820 /* --------------------------------- */
2821
2822 %%
2823 % Visualize Invariant...
2824 %
2825 % Siehe bvisual.pl
2826
2827 :- use_module(dotsrc(bvisual),[get_tree_from_expr/4, write_dot_graph_to_file/2]).
2828
2829
2830 generate_dot_from_invariant(FileName):-
2831 bmachine:b_get_invariant_from_machine(BExpr),
2832 write_dot_file_for_pred_expr(BExpr,FileName).
2833
2834
2835 :- use_module(b_operation_guards,[get_quantified_operation_enabling_condition/5]).
2836 generate_dot_from_operation(TclOpName,FileName) :-
2837 adapt_tcl_operation_name(TclOpName,OpName),
2838 Simplify=false,
2839 get_quantified_operation_enabling_condition(OpName, BExpr, _BecomesSuchVars, _Precise, Simplify),
2840 write_dot_file_for_pred_expr(BExpr,FileName).
2841 %generate_tree_from_boolean_expression(BExpr, Tree,BecomesSuchVars),
2842 %write_dot_graph_to_file(Tree,FileName).
2843
2844 % a version with additional parameters and additional pre condition / guard predicate
2845 generate_dot_from_operation_with_params(TclOpName,ParameterBindList,RestPreCond, FileName) :-
2846 adapt_tcl_operation_name(TclOpName,OpName),
2847 Simplify=false,
2848 get_quantified_operation_enabling_condition(OpName, BExpr, BecomesSuchVars,_Precise,Simplify),
2849 parse_tclk_parameter_values_and_pred(OpName,ParameterBindList,RestPreCond,CustomPredicate),
2850 insert_custom_predicate_into_guard(BExpr,CustomPredicate,FullPred),
2851 %translate:nested_print_bexpr(FullPred),nl,
2852 % TODO: probably allow all variables to be primed in CustomPredicate:
2853 b_ast_cleanup:annotate_becomes_such_vars(BecomesSuchVars,CustomPredicate,BSV2),
2854 write_dot_file_for_pred_expr(FullPred,FileName,BSV2).
2855
2856 insert_custom_predicate_into_guard(b(exists(Para,Body),pred,Info),Pred,Res) :- !,
2857 Res = b(exists(Para,BodyRes),pred,Info), % TODO: update wd infos
2858 insert_custom_predicate_into_guard(Body,Pred,BodyRes).
2859 insert_custom_predicate_into_guard(Guard,CustomPred,FullPred) :-
2860 % put CustomPred first so that bvisual prioritises solutions coming from user values/predicate
2861 % TODO: we could try and force equalities in CustomPred before calling bvisual
2862 conjunct_predicates([CustomPred,Guard],FullPred).
2863
2864 :- use_module(bmachine, [
2865 b_get_properties_from_machine/1,
2866 b_get_machine_constants/1,
2867 b_machine_has_constants_or_properties/0 ]).
2868 :- use_module(bsyntaxtree,[create_or_merge_exists/3]).
2869 get_properties(BExpr,CreateExists):-
2870 b_get_properties_from_machine(Condition),
2871 ( (CreateExists=true,b_machine_has_constants_or_properties) ->
2872 b_get_machine_constants(IDs),
2873 create_or_merge_exists(IDs, Condition, BExpr)
2874 ;
2875 BExpr = Condition
2876 ).
2877
2878 generate_dot_from_properties(FileName) :-
2879 (current_state_corresponds_to_fully_setup_b_machine -> CreateExists=false; CreateExists=true),
2880 get_properties(BExpr,CreateExists),
2881 write_dot_file_for_pred_expr(BExpr,FileName).
2882
2883 :- use_module(bsyntaxtree,[conjunct_predicates/2]).
2884
2885 generate_dot_from_assertions(FileName) :-
2886 (current_state_corresponds_to_setup_constants_b_machine,
2887 bmachine:b_get_dynamic_assertions_from_machine(BExpr), BExpr \=[]
2888 -> true
2889 ; bmachine:b_get_static_assertions_from_machine(BExpr)
2890 ),
2891 conjunct_predicates(BExpr,BE),
2892 write_dot_file_for_pred_expr(BE,FileName).
2893
2894 generate_dot_from_goal(FileName) :-
2895 b_get_machine_goal(BExpr),!,
2896 write_dot_file_for_pred_expr(BExpr,FileName,all_primed_vars).
2897 generate_dot_from_goal(FileName) :-
2898 write_dot_file_for_pred_expr_and_state(b(string('No GOAL DEFINITION available'),string,[]),[],[],FileName).
2899
2900 generate_dot_from_deadlock_po(FileName) :-
2901 b_state_model_check:get_unsorted_all_guards_false_pred(BExpr),
2902 %print('% CHECKING: '),translate_bexpression(BExpr,PT), print(PT),nl,
2903 write_dot_file_for_pred_expr(BExpr,FileName). % we do not check it is a predicate anymore
2904
2905
2906 generate_dot_from_formula(Pred,FileName) :-
2907 debug_format(19,'Parsing formula ~w~n',[Pred]),
2908 parse_machine_formula(Pred,TypedExpr),
2909 debug_format(19,'Writing dot formula ~w~n',[Pred]),
2910 ? write_dot_file_for_pred_expr(TypedExpr,FileName,all_primed_vars).
2911
2912
2913 :- use_module(bmachine, [b_parse_machine_formula/3, type_with_errors/4, get_primed_machine_variables/1]).
2914 parse_machine_formula(RawAST,TypedPred) :- compound(RawAST),!, % allow to pass raw AST as well
2915 get_primed_machine_variables(PV),
2916 type_with_errors(RawAST,[prob_ids(visible),identifier(PV),variables],_Type,TypedPred).
2917 parse_machine_formula(PredStr,TypedExpr) :-
2918 get_primed_machine_variables(PV),
2919 b_parse_machine_formula(PredStr,[prob_ids(visible),identifier(PV),variables],TypedExpr).
2920
2921
2922 write_dot_file_for_pred_expr(BExpr,FileName) :-
2923 write_dot_file_for_pred_expr(BExpr,FileName,[]).
2924 write_dot_file_for_pred_expr(BExpr,FileName,BecomesSuchVars) :-
2925 ? generate_tree_in_cur_state(BExpr, Tree,BecomesSuchVars),
2926 printsilent('% Writing to: '), printsilent(FileName),nls,
2927 write_dot_graph_to_file(Tree,FileName).
2928 write_dot_file_for_pred_expr_and_state(BExpr, LocalState, State,FileName) :-
2929 get_tree_from_expr(Tree, BExpr, LocalState, State),
2930 printsilent('% Writing to: '), printsilent(FileName),nls,
2931 write_dot_graph_to_file(Tree,FileName).
2932
2933 :- use_module(probsrc(state_space),[get_current_predecessor_state_id/1]).
2934 :- use_module(probsrc(specfile),[extract_variables_from_state_as_primed/2]).
2935
2936 generate_tree_in_cur_state(BExpr,Tree,all_primed_vars) :-
2937 (get_current_predecessor_state_id(PredID),
2938 visited_expression(PredID,SrcState),
2939 extract_variables_from_state_as_primed(SrcState,PrimedVarBindings)
2940 -> true
2941 ; PrimedVarBindings=[]
2942 ),
2943 get_current_state_for_b_formula(BExpr,CurState0),
2944 extend_state_with_probids_and_lets(CurState0,CurState1),
2945 append(PrimedVarBindings,CurState1,CurState),
2946 get_tree_from_expr(Tree, BExpr, [], CurState).
2947 generate_tree_in_cur_state(BExpr,Tree,BecomesSuchVars) :-
2948 get_current_state_for_b_formula(BExpr,CurState0),
2949 extend_state_with_probids_and_lets(CurState0,CurState1),
2950 % print(cur(CurState1)),nl,
2951 insert_before_substitution_variables(BecomesSuchVars,[],CurState1,CurState1,CurState),
2952 !,
2953 get_tree_from_expr(Tree, BExpr, [], CurState).
2954
2955 % generate a dot tree representation for a value; mostly useful for symbolic values
2956 write_dot_file_for_value_as_tree(Value,FileName) :-
2957 transform_value_to_expr(Value,BExpr),
2958 temporary_set_preference(formula_tree_minimal_timeout,5,Prev1),
2959 temporary_set_preference(formula_tree_maximal_timeout,30,Prev2),
2960 call_cleanup(generate_tree_in_cur_state(BExpr, Tree,[]),
2961 (reset_temporary_preference(formula_tree_minimal_timeout,Prev1),
2962 reset_temporary_preference(formula_tree_maximal_timeout,Prev2))),
2963 printsilent('% Writing to: '), printsilent(FileName),nls,
2964 write_dot_graph_to_file(Tree,FileName).
2965
2966 :- use_module(probsrc(bsyntaxtree),[create_typed_ids/3]).
2967 :- use_module(library(lists),[maplist/4]).
2968 transform_value_to_expr(closure(P,T,B),E) :-
2969 create_typed_ids(P,T,Parameters),!,
2970 E=b(comprehension_set(Parameters,B),set(any),[]). % TO DO: we could create typing
2971 transform_value_to_expr(Val,b(value(Val),any,[])).
2972
2973 :- use_module(tools,[maplist5/5]).
2974 tcltk_bv_get_tops(Tops) :-
2975 bv_get_top_level(Tops).
2976 tcltk_bv_get_structure(Id,Label,list(Subs)) :-
2977 bv_expand_formula(Id,Label,Subs).
2978 tcltk_bv_is_leaf(Id,Label) :-
2979 bv_expand_formula(Id,Label,[]).
2980 tcltk_bv_get_values(Ids,list(RTexts),list(Tags)) :-
2981 current_state_id(StateId),
2982 bv_get_values(Ids,StateId,Values),
2983 maplist5(tcltk_interface:retrieve_tag_adapted_text_for_id,Ids,Values,Tags,RTexts).
2984 tcltk_bv_get_value(Id,RText,Tag) :-
2985 tcltk_bv_get_values([Id],list([RText]),list([Tag])).
2986 tcltk_bv_show_formula_as_dot_tree(Id,File) :-
2987 bv_get_stored_formula_expr(Id,TExpr),
2988 write_dot_file_for_pred_expr(TExpr,File).
2989 tcltk_bv_get_pp_formula_string(Id,PPFormula) :-
2990 bv_get_stored_formula_expr(Id,TExpr),
2991 translate:translate_bexpression(TExpr,PPFormula).
2992
2993 tcltk_bv_show_formula_as_dot_graph(Id,File) :-
2994 bv_get_stored_formula_expr(Id,TExpr),
2995 get_texpr_type(TExpr,Type),
2996 Type \= pred, Type \= subst,
2997 % tcltk_show_typed_expression_as_dot_graph decomposes expressions and shows value as graph: could be useful for pre-configured DEFINITIONS
2998 tcltk_show_typed_expression_as_dot_graph(TExpr,File).
2999
3000 tcltk_bv_show_value_as_dot_tree(Id,File) :- % useful for symbolic values
3001 current_state_id(StateId),
3002 bv_get_btvalue(Id,StateId,_E,Value),
3003 write_dot_file_for_value_as_tree(Value,File).
3004
3005 % a variation of tcltk_bv_show_value_as_dot_tree without dependence on bvisual2
3006 tcltk_show_identifier_value_as_dot_tree(RawId,File) :- % this also works if bvisual2 is not set up and entry active
3007 get_identifier(RawId,Id),
3008 current_expression(_ID,CurState),
3009 expand_const_and_vars_to_full_store(CurState,EState),
3010 (EState=[] -> add_error(tcltk_show_identifier_value_as_dot_tree,'Initialise machine first, cannot retrieve value for identifier:',Id)
3011 ; lookup_value_for_existing_id(Id,EState,Value)
3012 -> write_dot_file_for_value_as_tree(Value,File)
3013 ; add_error(tcltk_show_identifier_value_as_dot_tree,'Cannot retrieve value for identifier:',Id)).
3014
3015 get_identifier(AtomicID,Res) :- atom(AtomicID), valid_id(AtomicID), !,Res=AtomicID.
3016 get_identifier(identifier(_,ID),Res) :- valid_id(ID),!, Res=ID. % raw ID from prob2_interface
3017 get_identifier(RawFormula,_) :-
3018 add_error(tcltk_show_identifier_value_as_dot_tree,'Please provide valid identifier of constant or variable:',RawFormula),
3019 fail.
3020 valid_id(ID) :- b_is_variable(ID).
3021 valid_id(ID) :- b_is_constant(ID).
3022
3023 retrieve_tag_adapted_text_for_id(Id,Value,Tag,RText) :-
3024 retrieve_tag_text_for_id(Id,Value,Tag,Text),
3025 (Text = '[]' -> RText = '[ ]' ; RText=Text). % for some reason the empty sequence translation [] gets transformed into '' by the tcltk library
3026
3027 retrieve_tag_text_for_id(Id,Value,FullTag,Text) :-
3028 retrieve_tag_text(Value,Tag,Text),
3029 (bv_is_explanation_node(Id) -> convert_explain_tag(Tag,FullTag) ; FullTag=Tag).
3030 retrieve_tag_text(i, inac, '').
3031 retrieve_tag_text(e(Text), error, Text).
3032 retrieve_tag_text(v(Text), value, Text).
3033 retrieve_tag_text(p(true), ptrue, true).
3034 retrieve_tag_text(p(false),pfalse, false).
3035 retrieve_tag_text(bv_info(Text), inac, Text).
3036
3037
3038 tcltk_bv_get_unlimited_value(Id,Text,Tag) :-
3039 current_state_id(StateId),
3040 bv_get_value_unlimited(Id,StateId,Value),
3041 retrieve_tag_text_for_id(Id,Value,Tag,Text1),
3042 atom_codes(Text1,Text). % TODO: In the end, the result was converted from codes to atom and back
3043
3044 % a version which returns just the value as an atom:
3045 tcltk_bv_get_unlimited_value_atom(Id,AtomText) :-
3046 current_state_id(StateId),
3047 bv_get_value_unlimited(Id,StateId,Value),
3048 retrieve_tag_text_for_id(Id,Value,_Tag,AtomText).
3049
3050 convert_explain_tag(ptrue,explaintrue).
3051 convert_explain_tag(pfalse,explainfalse).
3052 convert_explain_tag(X,X).
3053
3054 % -----------------------------------------
3055
3056 % STILL TO DO: refactor eval from here and probcli into separate module
3057
3058 :- dynamic eval_elapsed_time/1.
3059 tcltk_time_call(Call) :-
3060 cputime(T1),Call,cputime(T2),ElapsedTime is T2-T1,
3061 retractall(eval_elapsed_time(_)),assertz(eval_elapsed_time(ElapsedTime)).
3062
3063 :- use_module(eval_strings).
3064
3065
3066 tcltk_eval(String,StringResult,EnumWarning,Solution) :-
3067 get_computed_preference(debug_time_out,DTO),
3068 %print(debug_time_out(DTO)),nl,
3069 time_out_with_enum_warning_one_solution(eval_string(String,StringResult,EnumWarning,LocalState),DTO,TimeOutRes),
3070 (LocalState=[] -> Solution='' ; translate_bstate(LocalState,Solution)),
3071 (is_time_out_result(TimeOutRes) ->
3072 StringResult = '**** TIME-OUT ****', print(StringResult), print(' ('),print(DTO), print('ms)'),nl,
3073 EnumWarning = no
3074 ; print_last_info).
3075
3076 :- public tcltk_eval_string_in_cur_state/2.
3077 tcltk_eval_string_in_cur_state(String,TclValue) :-
3078 eval_string_in_cur_state(String,_,Value),
3079 convert_value_to_tcl(Value,TclValue).
3080 convert_value_to_tcl(int(X),R) :- !, R=X.
3081 convert_value_to_tcl(pred_true,R) :- !, R=1.
3082 convert_value_to_tcl(pred_false,R) :- !, R=0.
3083 convert_value_to_tcl(string(X),R) :- !, R=X.
3084 % TO DO: add sets,...
3085 convert_value_to_tcl(R,R) :- print(cannot_convert_to_tcl(R,R)),nl.
3086
3087 eval_string_in_cur_state(String,Typed,Value) :-
3088 %format('Parsing : "~w"~n',[String]),
3089 bmachine:parse_expression_raw_or_atom_with_prob_ids(String,Typed),
3090 current_state_id(CurID), prob2_interface:get_state(CurID,EState),
3091 %print(evaluating_in_state(CurID)),nl,
3092 b_compute_expression_with_prob_ids(Typed,EState,Value).
3093
3094 % code to translate an expression into a list of lists that can be displayed as a table in Tk
3095 % TO DO: make more robust and add more fancy translations
3096 :- use_module(extrasrc(table_tools),[expand_and_translate_to_table_for_expr/5]).
3097 tcltk_eval_as_table(String,Res) :-
3098 eval_string_in_cur_state(String,Typed,Value),
3099 Res = list([list(Header)|Table]),
3100 expand_and_translate_to_table_for_expr(Typed,Value,Header,Table,['no-row-numbers']).
3101
3102 :- use_module(user_interrupts,[interruptable_call/1]).
3103 interruptable_tcltk_eval(String,StringResult,EnumWarning,Solution) :-
3104 if(interruptable_call(tcltk_eval(String,StringResult,EnumWarning,Solution)),true,
3105 (StringResult = 'Error or User-Interrupt', EnumWarning=unknown, Solution='')).
3106
3107 % -----------------------------------------
3108
3109 tcltk_find_value_as_table(String,Options,list([Header|Matches])) :-
3110 eval_string_in_cur_state(String,Typed,GoalValue),
3111 Header = list(['ID','Kind','MatchPath']),
3112 get_texpr_type(Typed,Type),
3113 findall(list([ID,Kind,MatchMsg]),
3114 (find_value_in_cur_state(GoalValue,Type,Options,match(Kind,ID,Path)),
3115 format_to_codes('~w',[Path],MatchMsgC),
3116 format('* match inside ~w ~w @ path: ~w~n',[Kind,ID,Path]),
3117 atom_codes(MatchMsg,MatchMsgC)),Matches).
3118
3119 % find a given value somewhere in a constant or variable value
3120
3121 find_value_in_cur_state(GoalValue,Type,Options,match(Kind,ID,Path)) :-
3122 translate:translate_bvalue(GoalValue,VS),
3123 get_current_state_for_b_formula(requires_variables,State), % produce full state
3124 member(bind(ID,Value),State),
3125 ( bmachine:b_is_variable(ID,IDType), Kind=variable
3126 ; bmachine:b_is_constant(ID,IDType), Kind=constant),
3127 debug_format(19,'Searching id ~w for ~w~n',[ID,VS]),
3128 % TODO check if Type occurs in type of ID
3129 find_value(Value,IDType,GoalValue,Type,Options,Path).
3130
3131
3132 :- use_module(probsrc(kernel_freetypes),[registered_freetype/2]).
3133 :- use_module(bsyntaxtree,[is_set_type/2]).
3134 :- use_module(kernel_strings,[to_b_string/2]).
3135 find_value(Val,Type,GoalVal,Type,Options,Path) :- !, % target and goal type match; to do: unify_types
3136 (kernel_objects:equal_object(Val,GoalVal) -> Path = '*'
3137 ; fuzzy_find_value(Val,Type,GoalVal,Type,Options,Path)).
3138 find_value((A,B),couple(TA,TB),GoalVal,Type,Options,Path) :- !,
3139 ( find_value(A,TA,GoalVal,Type,Options,PA),
3140 Path=','(PA,BS), translate:translate_bvalue(B,BS)
3141 ; find_value(B,TB,GoalVal,Type,Options,PB),
3142 Path=','(AS,PB), translate:translate_bvalue(A,AS)).
3143 find_value(rec(Fields),record(FieldTypes),GoalVal,Type,Options,rec(Field,Path)) :- !,
3144 member(field(Field,Val),Fields),
3145 member(field(Field,TVal),FieldTypes),
3146 find_value(Val,TVal,GoalVal,Type,Options,Path).
3147 find_value(avl_set(AVL),AType,GoalVal,Type,Options,'{}'(Path)) :- !,
3148 is_set_type(AType,TA),
3149 custom_explicit_sets:avl_member_opt(Value,AVL), % TODO: provide a more proper interface predicate
3150 find_value(Value,TA,GoalVal,Type,Options,Path).
3151 find_value([H|T],set(TA),GoalVal,Type,Options,'{}'(Path)) :- !,
3152 member(Value,[H|T]),
3153 find_value(Value,TA,GoalVal,Type,Options,Path).
3154 find_value(freeval(ID,Case,Val),freetype(ID),GoalVal,Type,Options,freeval(Case,Path)) :- !,
3155 (registered_freetype(ID,Cases),
3156 member(case(Case,TVal),Cases) -> true
3157 ; add_error(find_value,'Illegal freeval:',freeval(ID,Case,Val)),fail
3158 ),
3159 find_value(Val,TVal,GoalVal,Type,Options,Path).
3160 find_value(Val,TypeVal,GoalVal,Type,Options,Path) :-
3161 fuzzy_find_value(Val,TypeVal,GoalVal,Type,Options,Path).
3162
3163 fuzzy_find_value(Val,_Type,string(GoalAtom),string,[Option],'**'(TargetAtom)) :-
3164 GoalAtom \= '',
3165 simple_value_to_match(Val),
3166 to_b_string(Val,string(TargetAtom)),
3167 find_match_string(Option,TargetAtom,GoalAtom).
3168
3169 simple_value_to_match(fd(_,_)).
3170 simple_value_to_match(string(_)).
3171 simple_value_to_match(int(_)).
3172 simple_value_to_match(term(_)).
3173 simple_value_to_match(freeval(_,_Case,Val)) :- ground(Val), Val=term(_).
3174
3175 :- use_module(tools_matching,[fuzzy_match_codes_lower_case/2]).
3176
3177 % check whether TargetAtom matches GoalAtom given match option
3178 find_match_string(exact,GoalAtom,GoalAtom).
3179 find_match_string(prefix,TargetAtom,GoalAtom) :-
3180 atom_concat(GoalAtom,_,TargetAtom). % use sub_atom ?
3181 find_match_string(suffix,TargetAtom,GoalAtom) :-
3182 atom_concat(_,GoalAtom,TargetAtom).
3183 find_match_string(infix,TargetAtom,GoalAtom) :-
3184 sub_atom(TargetAtom,_Before,Length,_After,GoalAtom), Length>0.
3185 find_match_string(fuzzy,TargetAtom,GoalAtom) :-
3186 atom_codes(TargetAtom,TC),
3187 atom_codes(GoalAtom,GC),
3188 fuzzy_match_codes_lower_case(TC,GC).
3189 % TODO: regex
3190
3191 % -----------------------------------------
3192 % B Simplifier
3193 :- use_module(probporsrc(b_simplifier),[tcltk_simplify_b_predicate/2]).
3194 tcltk_simplify_predicate(String,StringResult) :-
3195 tcltk_simplify_b_predicate(String,StringResult).
3196
3197
3198 % -----------------------------------------
3199 % CBC Check
3200
3201 get_cbc_data_base_id_checks(IDs) :-
3202 findall(ID,b_state_model_check: cbc_check(ID,_Text,_Call,_Res,_Ok),IDs).
3203 get_cbc_data_base_text_checks(Strings) :-
3204 findall(Text1,(b_state_model_check: cbc_check(_ID,Text,_Call,_Res,_Ok),tools: string_concatenate(Text,';',Text1)),Strings).
3205
3206
3207 % -----------------------------------------
3208
3209 % CSP Refinement Search
3210
3211 %:- dynamic tcltk_cspm_mode/0.
3212 %set_tcltk_cspm_mode :- assertz(tcltk_cspm_mode).
3213 %unset_tcltk_cspm_mode :- retractall(tcltk_cspm_mode).
3214
3215
3216 %get_new_csp_process_id(E,File,ID) :-
3217 % ( parse_single_csp_expression_file(E,File,Proc) ->
3218 % haskell_csp: check_compiled_term(Proc), add_csp_process_id1(Proc,ID,haskell_csp:animatable_process)
3219 % ; add_error(parse_single_csp_expression_file,'Invalid process expression: ',E),fail
3220 % ).
3221
3222 %parse_and_analyze_process_expression(ProcExp,File,Proc) :-
3223 % ( parse_single_csp_expression_file(ProcExp,File,Proc) -> true
3224 % ; add_error(parse_single_csp_expression_file,'Invalid process expression: ',ProcExp),fail
3225 % ).
3226
3227 get_csp_process_id(Process,ID) :- get_start_transition_term(Process,Trans),
3228 transition(root,Trans,ID).
3229
3230 :- use_module(probcspsrc(haskell_csp),[animatable_process_without_arguments/1,animatable_process_cli/1]).
3231 add_csp_process_id(Process,NewID) :-
3232 add_csp_process_id1(Process,NewID,animatable_process_cli).
3233
3234 add_csp_process_id1(Process,NewID,Pred) :-
3235 (call(Pred,Process)
3236 -> get_start_transition_term(Process,Trans),
3237 (transition(root,Trans,_,DestID) -> NewID=DestID % process already set up
3238 ; xtl_interface:get_start_expr(Process,NewState),
3239 add_trans_id(root,Trans,NewState,NewID,_)
3240 )
3241 ; add_error_fail(add_csp_process_id,'Not an animatable CSP Process: ',Process)).
3242
3243 get_start_transition_term('MAIN',R) :- !, R= start_cspm_MAIN.
3244 get_start_transition_term(agent_call(_Src,'MAIN',[]),R) :- !, R= start_cspm_MAIN.
3245 get_start_transition_term(P,start_cspm(P)).
3246
3247 add_csp_general_process_id(val_of(Process,_),ID) :- !,
3248 ( animatable_process_without_arguments(Process) % in case the called processes is one without arguments, then we don't have to parse the expression
3249 -> add_csp_process_id(Process,ID)
3250 % code below not covered; loaded_main_file only defined for probcli entry point !
3251 %; animation_mode(cspm),
3252 % loaded_main_file(CSPFile),
3253 % parse_and_analyze_process_expression(Process,CSPFile,Proc),
3254 % (transition(root,start_cspm(Proc),_TransID,ID) -> true
3255 % ; otherwise -> add_trans_id(root,start_cspm(Proc),Proc,ID,_)
3256 % )
3257 ).
3258 add_csp_general_process_id(GenProcExpr,ID) :-
3259 % stripping out the source-loc info
3260 haskell_csp_analyzer: clear_span(GenProcExpr,GenProcExpr1),
3261 get_start_transition_term(GenProcExpr1,Trans),
3262 ? (transition(root,Trans,_TransID,ID)
3263 -> true
3264 ; add_trans_id(root,Trans,GenProcExpr1,ID,_)
3265 ).
3266
3267 :- public tcltk_csp_in_situ_refinement/4.
3268 tcltk_csp_in_situ_refinement(ImplProcess,AbsProcess,ResTrace,Style) :-
3269 format('Checking ~w ~w ~w~n',[AbsProcess,Style,ImplProcess]),
3270 tcltk_csp_in_situ_refinement(ImplProcess,AbsProcess,ResTrace,Style,10000000).
3271 csp_ref_style('[T=',trace). % Trace Refinement
3272 csp_ref_style('T',trace). % Trace Refinement
3273 csp_ref_style('[SF=',singleton_failures). % Singleton Failures Refinement
3274 csp_ref_style('[F=',failures). % Failures Refinement
3275 csp_ref_style('[R=',refusals). % Refusals Refinement
3276 csp_ref_style('[RD=',refusals_div). % Refusals-Divergence Refinement
3277 csp_ref_style('F',failures). % Failures Refinement
3278 csp_ref_style('[FD=',X) :- csp_ref_style('FailureDivergence',X).
3279 csp_ref_style('FD',X) :- csp_ref_style('FailureDivergence',X).
3280 csp_ref_style('Trace',trace).
3281 csp_ref_style('Failure',failures).
3282 csp_ref_style('FailureDivergence',failure_divergences).
3283 csp_ref_style('RefusalTesting',refusals).
3284 csp_ref_style('RefusalTestingDiv',refusals_div).
3285 csp_ref_style('RevivalTesting',revival) :- add_error(unsupported_refinement_operator,'[V= refinement not yet supported.').
3286 csp_ref_style('RevivalTestingDiv',revival_div) :- add_error(unsupported_refinement_operator,'[VD= refinement not yet supported.').
3287
3288 translate_csp_ref_style(Style,RefStyle) :- (csp_ref_style(Style,RefStyle) -> true ;
3289 add_error_fail(csp,'Unknown refinement style: ',Style)).
3290
3291 :- use_module(extrasrc(refinement_checker),[in_situ_ref_search/5]).
3292
3293 % tcltk_csp_in_situ_refinement('P','Q',R,0,1000). tcltk_csp_in_situ_refinement('Q','P',R,1000).
3294 tcltk_csp_in_situ_refinement(ImplProcess,AbsProcess,ResTrace,Style,MaxNrOfNewNodes) :-
3295 add_csp_process_id(ImplProcess,ImplNodeID),
3296 add_csp_process_id(AbsProcess,SpecNodeID),
3297 translate_csp_ref_style(Style,RefStyle),
3298 in_situ_ref_search(ImplNodeID,SpecNodeID,ResTrace,RefStyle,MaxNrOfNewNodes).
3299
3300 :- use_module(probcspsrc(haskell_csp),[get_csp_assertions/1,translate_csp_assertion/2]).
3301
3302 tcltk_check_csp_assertions(List,Summary) :- get_csp_assertions(Assertions),
3303 treat_csp_ass(Assertions,List,0,0,0,Summary). % TO DO: display _List
3304
3305 treat_csp_ass([],[],T,F,U,[total/Tot, true/T, false/F, unknown/U]) :- Tot is T+F+U.
3306 treat_csp_ass([Assertion|T],['='(PP,Ok)|TPP],True,False,U,Summary) :- !,
3307 (checkAssertion(Assertion,PP,_,Ok,_)
3308 -> ( Ok=true -> T1 is True+1, F1=False, U1=U
3309 ; Ok=false -> T1=True, F1 is False+1, U1=U
3310 ; T1=True, F1=False, U1 is U+1)
3311 ; U1 is U+1, T1=True, PP = '??',
3312 F1=False,Ok=unknown
3313 ),
3314 treat_csp_ass(T,TPP,T1,F1,U1,Summary).
3315 treat_csp_ass([H|T],TP,T1,F1,U,Summary) :-
3316 add_error(treat_csp_ass,'Unknown CSP assertion: ',H),
3317 U1 is U+1, treat_csp_ass(T,TP,T1,F1,U1,Summary).
3318
3319 % assertModelCheckExt(False,val_of(P3,src_span(25,8,25,10,562,2)),DeadlockFree,F)
3320
3321 :- use_module(extrasrc(refinement_checker),[in_situ_model_check/5, reset_refinement_checker/0]).
3322
3323 run_assertion_check(assertModelCheckExt(Negated,Spec,Type,ModelStyle),Negated,ResTrace) :-
3324 ? haskell_csp_analyzer: compile_body(Spec,'assertModelCheck',[],[],CSpec),
3325 debug_println(9,assertModelCheckExt(Negated,CSpec,Type,ModelStyle)),
3326 add_csp_general_process_id(CSpec,SpecNodeID),
3327 translate_csp_ref_style(ModelStyle,RefStyle),
3328 in_situ_model_check(SpecNodeID,ResTrace,Type,RefStyle,10000000),
3329 formatsilent('Result trace for assertModelCheck: ~w~n',[ResTrace]).
3330 run_assertion_check(assertModelCheck(Negated,Spec,Style),Negated,ResTrace) :-
3331 ? run_assertion_check(assertModelCheckExt(Negated,Spec,Style,'FailureDivergence'),Negated,ResTrace).
3332 run_assertion_check(assertRef(Negated,Spec,Style,Impl,Span),Negated,ResTrace) :-
3333 ? haskell_csp_analyzer: compile_body(Spec,'assertRef',[],[],CSpec),
3334 ? haskell_csp_analyzer: compile_body(Impl,'assertRef',[],[],CImpl),
3335 debug_println(9,assertRef(Negated,CSpec,Style,CImpl,Span)),
3336 add_csp_general_process_id(CSpec,SpecNodeID),
3337 add_csp_general_process_id(CImpl,ImplNodeID),
3338 translate_csp_ref_style(Style,RefStyle),
3339 refinement_checker:in_situ_ref_search(ImplNodeID,SpecNodeID,ResTrace,RefStyle,10000000).
3340 run_assertion_check(assertLtl(Negated,Spec,FormulaAsAtom,_Span),Negated,ResTrace) :-
3341 add_csp_process_id_normalized(Spec,'assertLtl',CSpec,CSpecNodeID),
3342 %% print(add_csp_general_process_id(Spec,CSpec,SpecNodeID)),nl,
3343 tcltk_reset,
3344 ltl_model_check_with_ce1(CSpec,FormulaAsAtom,-1,specific_node(CSpecNodeID),Result),
3345 translate_ltl_result(Result,ResTrace),
3346 debug_println(9,ltl_result(Negated,CSpec,CSpecNodeID,FormulaAsAtom,Result)).
3347 run_assertion_check(assertCtl(Negated,Spec,FormulaAsAtom,_Span),Negated,ResTrace) :-
3348 add_csp_process_id_normalized(Spec,'assertCtl',CSpec,CSpecNodeID),
3349 tcltk_reset,
3350 ctl_model_check_with_ce(CSpec,FormulaAsAtom,-1,specific_node(CSpecNodeID),Result,Trace),
3351 debug_println(9,ctl_result(Negated,CSpec,CSpecNodeID,FormulaAsAtom,Result)),
3352 translate_ctl_result(Result,Trace,ResTrace).
3353
3354 checkAssertion(Assertion,PP,Negated,Ok,ResTrace) :-
3355 translate_csp_assertion(Assertion,PP),
3356 formatsilent('CHECKING ~w~n',[PP]),
3357 debug_println(9,checkAssertion(Assertion)),
3358 reset_refinement_checker,
3359 ? (run_assertion_check(Assertion,Negated,ResTrace)
3360 -> debug_println(9,result(ResTrace)),
3361 (ResTrace=no_counter_example
3362 -> (Negated = 'False' -> Ok=true ; Ok=false)
3363 ; ResTrace=no_counter_example_found
3364 -> Ok=interrupted
3365 ; ResTrace=[interrupted|_]
3366 -> Ok=interrupted, print('*** Execution interrupted by user ***'),nl
3367 ; Negated = 'False' -> Ok=false
3368 ; Ok=true
3369 ),
3370 (Ok=true -> printsilent('OK'),nls
3371 ; Ok=interrupted -> print('*** UNKNOWN ***'),nl
3372 ; print('*** FALSE ***'),nl
3373 )
3374 ; add_error_fail(checkAssertion,'Internal Error, Assertion Checking Failed for: ',PP)
3375 ).
3376
3377 add_csp_process_id_normalized(Spec,Functor,CSpec,CSpecNodeID) :-
3378 % stripping out the src_span info
3379 haskell_csp_analyzer: clear_span(Spec,SpecNoSpan),
3380 haskell_csp_analyzer: compile_body(SpecNoSpan,Functor,[],[],CSpec),
3381 add_csp_general_process_id(CSpec,CSpecNodeID).
3382
3383 translate_ltl_result(ok,Res) :- !,
3384 Res = no_counter_example.
3385 translate_ltl_result(no,Res) :- !,
3386 Res = no.
3387 translate_ltl_result(ce(Atom),Res) :-
3388 !, % we have a counter-example for the LTL formula
3389 Res=Atom.
3390 translate_ltl_result(interrupted,Res) :-
3391 !,
3392 Res=[interrupted].
3393 translate_ltl_result(Status,_Res) :-
3394 add_error_fail(ltl_assertions_result, 'Internal Error: unknown LTL assertion result ', Status).
3395
3396 translate_ctl_result(true,_Trace,ResTrace) :- !,
3397 ResTrace = no_counter_example.
3398 translate_ctl_result(false,ce(Atom),ResTrace) :- !,
3399 ResTrace = Atom.
3400 translate_ctl_result(interrupted,_TRace,ResTrace) :-
3401 !,
3402 ResTrace=[interrupted].
3403 translate_ctl_result(Status,_Trace,_ResTrace) :-
3404 add_error_fail(ctl_assertions_result, 'Internal Error: unknown CTL assertion result ', Status).
3405
3406
3407 tcltk_check_csp_assertion(Assertion,CSPFile,Negated,Result) :-
3408 tcltk_check_csp_assertion(Assertion,CSPFile,Negated,_PlTerm,Result).
3409
3410 tcltk_check_csp_assertion(Assertion,CSPFile,Negated,PlTerm,Result) :-
3411 parse_single_csp_declaration(Assertion,CSPFile,PlTerm),
3412 checkAssertion(PlTerm,_PP,Negated,_Ok,Result).
3413
3414 :- public tcltk_play_ltl_ctl_counterexample_trace/4.
3415 tcltk_play_ltl_ctl_counterexample_trace(Assertion,CSPFile,Type,FairnessChecked) :-
3416 announce_event(play_counterexample),
3417 ( Type == ltl -> Functor = assertLtl
3418 ; Type == ctl -> Functor = assertCtl
3419 ; add_error_fail(ltl_ctl_counterexample, 'Internal Error: Model checker type unknown: ',Type)),
3420 % constructing the prolog declaration term
3421 PlDeclTerm =.. [Functor,_Negated,Spec,FormulaAsAtom,_Span],
3422 parse_single_csp_declaration(Assertion,CSPFile,PlDeclTerm),
3423 haskell_csp_analyzer: clear_span(Spec,SpecNoSpan),
3424 haskell_csp_analyzer: compile_body(SpecNoSpan,'assertLtl',[],[],CSpec),
3425 % parsing and preprocessing the LTL/CTL formula
3426 parse_and_preprocess_formula(FormulaAsAtom,Type,PF),
3427 (is_fairness_implication(PF) -> FairnessChecked='yes'; FairnessChecked='no'),
3428 % need to reset history and current state before loading the counter-example
3429 tcltk_reset,
3430 tcltk_play_counterexample(Type,CSpec,PF).
3431
3432 tcltk_play_counterexample(ltl,Spec,Formula) :- !,
3433 tcltk_play_ltl_counterexample(Spec,Formula).
3434 tcltk_play_counterexample(ctl,Spec,Formula) :- !,
3435 tcltk_play_ctl_counterexample(Spec,Formula).
3436 tcltk_play_counterexample(Type,Spec,Formula) :-
3437 add_error_fail(ltl_ctl_counterexample, 'Internal Error: Unknown domain type: ', (Type,Spec,Formula)).
3438
3439 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
3440
3441
3442 %%%% Parse and get LTL formulas from LTL File %%%%
3443 get_ltl_formulas_from_file(Filename,Text) :-
3444 parse_ltlfile(Filename, Formulas), print(Formulas),nl,
3445 translate_ltl_formulas(Formulas,Text).
3446
3447 translate_ltl_formulas(Formulas,Text) :-
3448 maplist(translate_ltl_formula,Formulas,Strings),
3449 haskell_csp: concatenate_string_list(Strings,Text).
3450
3451 translate_ltl_formula(formula(_Name,Formula),Text) :- !,
3452 pp_ltl_formula(Formula,T),
3453 string_concatenate(T,'$',Text).
3454 translate_ltl_formula(F,'') :- add_error(get_ltl_formulas_from_file,'Illegal formula: ',F).
3455
3456
3457 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
3458
3459
3460 tcltk_explore_csp_process(ProcString,SpecNodeID) :-
3461 haskell_csp: parse_single_csp_expression(ltl,ProcString,Res),
3462 haskell_csp_analyzer: clear_span(Res,ResNoSpan),
3463 haskell_csp_analyzer: compile_body(ResNoSpan,'assertLtl',[],[],CRes),
3464 add_csp_general_process_id(CRes,SpecNodeID),
3465 refinement_checker:dfs_check(SpecNodeID,_ResTrace,false,false).
3466
3467 tcltk_visualize_csp_process(SpecNodeID,F) :-
3468 visualize_graph: tcltk_print_csp_process_states_for_dot(F,SpecNodeID).
3469
3470 :- dynamic nr_csp_process_state/1.
3471 get_csp_process_stats(NrNodes) :-
3472 assertz(nr_csp_process_state(0)),
3473 count_nodes,
3474 nr_csp_process_state(NrNodes),
3475 retractall(nr_csp_process_state(_)).
3476
3477 count_nodes :-
3478 refinement_checker: dvisited(_NodeID),
3479 nr_csp_process_state(NrNodes),
3480 NewNrNodes is NrNodes +1,
3481 retractall(nr_csp_process_state(_)),
3482 assertz(nr_csp_process_state(NewNrNodes)),
3483 fail.
3484 count_nodes.
3485
3486 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
3487
3488 tcltk_machine_has_assertions :-
3489 ( b_get_static_assertions_from_machine([_|_]); b_get_dynamic_assertions_from_machine([_|_]) ), !.
3490
3491 tcltk_unique_top_level_operation(Name) :- b_top_level_operation(Name),
3492 \+ (b_top_level_operation(N2), N2 \= Name).
3493
3494 tcltk_top_level_operations(list(Res)) :-
3495 findall(Name,b_top_level_operation(Name),Names),
3496 length(Names,L),
3497 (L>5 -> sort(Names,Res) ; Res=Names).
3498
3499 tcltk_get_vacuous_guards(list(R)) :-
3500 eclipse_interface:get_vacuous_guards(L), % to do: add source column
3501 (L=[] -> R = ['No vacuous guards']
3502 ; R=L).
3503
3504 tcltk_get_vacuous_invariants(list(L)) :-
3505 eclipse_interface:get_vacuous_invariants(LP),
3506 (LP=[] -> L = ['No vacuous invariants']
3507 ; maplist(translate:translate_bexpression,LP,L)).
3508
3509 tcltk_get_vacuous_invariants_table(list([list(['LHS','Op','RHS','Source'])|L])) :-
3510 eclipse_interface:get_vacuous_invariants(LP),
3511 LP \= [], !,
3512 maplist(get_expr_and_source,LP,L).
3513 tcltk_get_vacuous_invariants_table(list(['No vacuous invariants'])).
3514
3515 :- use_module(translate,[translate_bexpression_with_limit/3]).
3516 :- use_module(error_manager,[get_tk_table_position_info/2]).
3517 get_expr_and_source(P,list([TS1,Op,TS2,Src])) :-
3518 decompose(P,LHS,Op,RHS),
3519 translate_bexpression_with_limit(LHS,150,TS1),
3520 translate_bexpression_with_limit(RHS,60,TS2),
3521 get_tk_table_position_info(P,Src).
3522
3523 decompose(b(implication(LHS,RHS),pred,_),LHS,'=>',RHS) :- !.
3524 decompose(b(disjunction(LHS,RHS),pred,_),LHS,'or',RHS) :- !.
3525 decompose(LHS,LHS,'?',b(truth,pred,[])).
3526
3527
3528 % -------------------
3529
3530
3531 :- use_module(extrasrc(mcts_game_play), [mcts_auto_play/4, mcts_auto_play_available/0]).
3532
3533 tcltk_mcts_auto_play :- tcltk_mcts_auto_play(_).
3534 tcltk_mcts_auto_play(TransID) :-
3535 mcts_auto_play_available,
3536 current_state_id(CurID),
3537 mcts_auto_play(CurID,ActionAsTerm,TransID,State2),
3538 (tcltk_perform_action(CurID,ActionAsTerm,TransID,State2)
3539 -> true
3540 ; add_error(tcltk_mcts_auto_play,'Cannot perform chosen action:',ActionAsTerm),fail).