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