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
6		:- module(b_interpreter,
7		[b_test_boolean_expression/4, b_test_boolean_expression/6,
8		%b_test_boolean_expression_wf/3,
9		b_test_boolean_expression_cs/5,
10		b_test_boolean_expression_for_ground_state/4, b_test_boolean_expression_for_ground_state/5,
11		% b_det_test_boolean_expression/6,
12		b_not_test_boolean_expression/4, b_not_test_boolean_expression/6,
13		%b_not_test_boolean_expression_wf/3,
14		b_not_test_boolean_expression_cs/5,
15
16		b_convert_bool/5,
17		b_convert_bool_timeout/7,
18		b_compute_expression/5,
19
20		b_execute_top_level_statement/7,
21		b_execute_statement_nowf/5,
22
23		b_compute_expression_nowf/4, b_compute_expression_nowf/6, b_compute_expression_nowf/7,
24		b_compute_explicit_epression_no_wf/6, b_compute_explicit_epression_no_wf/7,
25
26		b_set_up_concrete_constants/2, b_partial_set_up_concrete_constants/1,
27		b_initialise_machine/4,
28
29		b_execute_top_level_operation_update/5, b_execute_top_level_operation_wf/8,
30
31		convert_list_of_expressions_into_set_wf/4,
32		%state_satisfies_negation_of_invariant/1,
33
34		b_state_violates_invariant/2,
35		state_violates_assertions/2,
36		analyse_invariant_for_state/1,
37
38		insert_before_substitution_variables/5, % add $0 values to a store
39
40		try_lookup_value_in_store_and_global_sets/3, lookup_value_in_store_and_global_sets_wf/7,
41		set_up_typed_localstate/6, set_up_typed_localstate2/8,
42		%set_up_localstate_for_let/7,
43
44		set_projection_on_static_assertions/1,
45
46		tcltk_unsatisfiable_components_exist/0,
47		tcltk_quick_describe_unsat_properties/2,
48
49		get_unsat_component_predicate/3,
50		properties_were_filtered/1, % true if PROPERTIES / axioms filtered due to prob-ignore pragmas
51		b_generate_for_all_list_domain_nolwf/8 % for predicate_evaluator
52		]).
53
54		:- meta_predicate not_with_enum_warning_and_possible_delay(0,-,?,?,?).
55		:- meta_predicate not_with_enum_warning_delay(0,-,?,?,?,?).
56
57		%:- use_module('../extensions/profiler/profiler.pl').
58		%:- use_module('../extensions/profiler/profiler_te.pl').
59		%:- enable_profiling(b_test_boolean_expression/4).
60		%:- enable_profiling(b_test_boolean_expression_cs/5).
61
62		:- use_module(kernel_objects).
63		:- use_module(bsets_clp).
64		:- use_module(delay).
65
66
67		:- use_module(kernel_mappings).
68		:- use_module(b_global_sets).
69		:- use_module(store).
70		:- use_module(library(lists)).
71		:- use_module(library(ordsets)).
72		:- use_module(library(avl)).
73
74		:- use_module(b_global_sets).
75		:- use_module(bmachine).
76		:- use_module(b_enumerate, [b_enumerate_values_in_store/5,
77		b_tighter_enumerate_all_values/2, b_tighter_enumerate_values_in_ctxt/3]).
78		:- use_module(debug).
79		:- use_module(performance_messages).
80		:- use_module(self_check).
81		:- use_module(tools).
82
83		:- use_module(module_information,[module_info/2]).
84		:- module_info(group,interpreter).
85		:- module_info(description,'This module provides the basic interpreter for expressions, predicates and substitutions.').
86
87		:- use_module(preferences).
88		:- use_module(error_manager).
89		:- use_module(typechecker).
90		:- use_module(specfile,[state_corresponds_to_initialised_b_machine/2
91		,state_corresponds_to_set_up_constants_only/2]).
92
93		:- use_module(bsyntaxtree).
94
95		:- use_module(translate).
96
97		:- use_module(kernel_waitflags).
98		:- use_module(kernel_reals).
99		:- use_module(kernel_records).
100
101		:- use_module(kodkodsrc(kodkod),[kodkod_request/5]).
102
103		:- use_module(custom_explicit_sets).
104		:- use_module(closures,[is_symbolic_closure/1,
105		mark_closure_as_symbolic/2, mark_closure_as_recursive/2, mark_closure/3]).
106
107		:- use_module(state_space).
108		:- use_module(b_interpreter_eventb).
109		:- use_module(tools_printing,[print_term_summary/1,print_functor/1]).
110		:- use_module(value_persistance,[load_partial_constants/3,lookup_cached_transitions/4]).
111		:- use_module(extrasrc(b_expression_sharing),[is_lazy_let_identifier/1]).
112		:- use_module(bool_pred,[negate/2]).
113		:- use_module(smt_solvers_interface(smt_solvers_interface),[smt_add_predicate/5]).
114
115		:- use_module(debug).
116		:- use_module(external_functions).
117
118		:- use_module(static_ordering,[sort_ids_by_usage/4,reorder_state/3]).
119		%:- use_module(bsyntaxtree,[predicate_has_ignore_pragma/1]).
120		:- use_module(tools_lists,[exclude_count/4, optimized_nth1/3]).
121		:- use_module(tools_meta, [safe_time_out/3]).
122
123		:- set_prolog_flag(double_quotes, codes).
124
125		/* ----------------------------------*/
126
127		/* For partial evaluation */
128
129		%:- use_module('~/cvs_root/cogen2/logen_source/runtime/logen_dispatcher.pl').
130
131		% new profiler
132		%:- use_module('../extensions/profiler/profiler.pl').
133		%:- use_module('../extensions/profiler/profiler_te.pl').
134		%:- enable_profiling_naming(b_interpreter:b_state_violates_invariant_aux/2,name).
135
136		%name(b_interpreter:b_state_violates_invariant_aux,_,INVERIANT).
137
138		%b_state_violates_invariant(ID,State) :-
139		% b_intepreter:b_state_violates_invariant_aux(ID,State).
140
141		% old profiler
142		:- use_module(runtime_profiler,[profile_single_call/3]).
143
144		% called by force_check_invariantKO and indirectly by model_checker (State was prepare_state_for_specfile_trans )
145		b_state_violates_invariant(ID,State) :-
146		b_state_violates_invariant_aux(ID,State).
147
148		b_state_violates_invariant_aux(ID,CurBState) :-
149		retract(specialized_inv(ID,BitSetMask)), % Note: when we assert this we checked that invariant holds in predecessor state
150		intersect_invs(BitSetMask,SPO), !,
151		(SPO = b(truth,_,_) -> fail
152		; profile_single_call('INVARIANT-Specialized',ID,b_interpreter:b_state_violates_spec_invariant(ID,SPO,CurBState))).
153		b_state_violates_invariant_aux(ID,CurBState) :-
154		profile_single_call('INVARIANT',ID,b_interpreter:state_violates_invariant(ID,CurBState)).
155
156		b_state_violates_spec_invariant(ID,SPO,CurBState) :-
157		\+ check_invariant_predicate_with_time_out(ID,SPO,CurBState).
158
159		:- use_module(probsrc(bit_sets),[member_bitset/2]).
160		intersect_invs(invariant_preserved,Inv) :- !, Inv= b(truth,pred,[]).
161		intersect_invs(Mask,InvList) :- integer(Mask), !,
162		findall(nth1_invariant(Nr), member_bitset(Nr,Mask), InvList).
163		intersect_invs(M,Inv) :- !, add_internal_error('Illegal empty specialized inv list:', intersect_invs(M,Inv)),
164		Inv = b(falsity,pred,[]).
165
166
167		/* ----------------------------------*/
168
169		:- load_files(library(system), [when(compile_time), imports([environ/2])]).
170
171
172		state_satisfies_invariant_aux(ID,State) :-
173		check_invariant_with_time_out(ID,State). % version without partial evaluation
174
175
176		:- use_module(library(timeout)).
177
178		:- use_module(tools_printing,[format_with_colour_nl/4]).
179		:- use_module(probsrc(specfile),[prepare_state_for_specfile_trans/3]).
180		% called by prob_cli when invariant violation found:
181		% we no longer have access to the specialized_inv facts
182		analyse_invariant_for_state(ID) :-
183		b_invariant_number_list(InvList),
184		visited_expression(ID,State),
185		prepare_state_for_specfile_trans(State,ID,PreparedCurState),
186		maplist(check_invariant(ID,PreparedCurState),InvList).
187		check_invariant(ID,State,InvariantNr) :-
188		enter_new_error_scope(L,check_invariant),
189		check_invariant_predicate_with_time_out_res(InvariantNr,State,TimeOutRes),
190		(TimeOutRes=success -> true
191		; InvariantNr = nth1_invariant(Nr),
192		b_nth1_invariant(Nr,Invariant,_UsedIds),
193		translate_bexpression_with_limit(Invariant,TS),
194		translate_span(Invariant,SpanStr),
195		(TimeOutRes=failure -> InvRes=false ; InvRes=unknown),
196		format_with_colour_nl(user_output,[red,bold],
197		'*** Invariant ~w ~w is ~w (in state with id ~w):~n ~w',[Nr,SpanStr,InvRes,ID,TS]),
198		% add_message(check_invariant,'Invariant false: ',Nr,TS),
199		(debug_mode(off) -> true
200		; translate:print_bstate(State),nl
201		)
202		% TODO: pass check dot_file_prefix or similar to analyse_invariant_for_state and call:
203		% bvisual:get_tree_from_expr(Tree, Invariant, [], State),
204		% bvisual:write_dot_graph_to_file(Tree,'invariant.dot')
205		), exit_error_scope(L,_ErrOcc,check_invariant).
206
207
208
209		check_invariant_with_time_out(ID,State) :-
210		%b_get_invariant_from_machine(Invariant),
211		b_invariant_number_list(InvList), % ensures operation caching can be applied
212		% TO DO: we could just get unproven invariants; unless we are in an initial state
213		check_invariant_predicate_with_time_out(ID,InvList,State).
214
215
216		check_invariant_predicate_with_time_out(ID,Invariant,State) :-
217		(check_invariant_predicate_with_time_out_res(Invariant,State,TimeOutRes)
218		-> check_time_out_res(TimeOutRes,ID)).
219
220		check_invariant_predicate_with_time_out_res(b(truth,_,_),_State,TimeOutRes) :- !, % only typing in invariant
221		TimeOutRes = success.
222		check_invariant_predicate_with_time_out_res(Invariant,State,TimeOutRes) :-
223		set_error_context(checking_invariant),
224		preferences:get_computed_preference(debug_time_out,DebugTimeOut),
225		call_cleanup(
226		(time_out_with_enum_warning_one_solution_no_new_error_scope(
227		b_interpreter:check_invariant_predicate_aux(Invariant,State ),
228		DebugTimeOut,TimeOutRes)
229		-> true
230		; TimeOutRes = failure),
231		clear_error_context).
232
233		% process typed predicates, lists and special invariant(Nr) terms
234		check_invariant_predicate_aux(nth1_invariant(Nr),State) :- !,
235		((get_preference(operation_reuse_setting,false) ;
236		get_preference(try_operation_reuse_for_invariants,false))
237	?	-> check_nth1_invariant(Nr,State)
238	?	; \+ b_operation_cache:check_invariant_violated_cache(Nr,State) % will call check_nth1_invariant if necessary
239		% note : for performance it is important that the State is prepared but not expanded
240		% (e.g. it should be expanded_const_and_vars with the info field containing the packed state)
241		).
242		check_invariant_predicate_aux([],_) :- !.
243		check_invariant_predicate_aux([H|T],State) :- !,
244	?	check_invariant_predicate_aux(H,State),
245	?	check_invariant_predicate_aux(T,State).
246		check_invariant_predicate_aux(Invariant,State) :-
247		b_test_boolean_expression_for_ground_state(Invariant,[],State,'INVARIANT',0).
248
249		% check the nth invariant
250		check_nth1_invariant(Nr,State) :-
251		if(b_nth1_invariant(Nr,Invariant,_UsedIds),
252	?	b_test_boolean_expression_for_ground_state(Invariant,[],State,'INVARIANT',Nr), % add Nr to call_stack
253		add_internal_error('Invariant does not exist:',Nr)).
254
255
256		check_time_out_res(time_out,ID) :- !,
257		format('**** TIMEOUT during invariant evaluation in state ~w!~n',[ID]),
258		assert_time_out_for_invariant(ID),
259		fail.
260		check_time_out_res(virtual_time_out(_WARNING),ID) :- !,
261		format('**** VIRTUAL TIMEOUT during invariant evaluation in state ~w!~n',[ID]),
262		assert_time_out_for_invariant(ID),
263		fail.
264		check_time_out_res(failure,_) :- !, fail.
265		check_time_out_res(_,_).
266
267		% b_test_boolean_expression_for_ground_state:
268		% idea: check each conjunct individually; avoids multiplication of choice points between conjuncts
269
270		:- use_module(specfile,[expand_const_and_vars_to_full_store/2]).
271		b_test_boolean_expression_for_ground_state(b(Expr,_,Infos),LS,S,PredKind) :-
272		b_test_boolean_expression_for_ground_state(b(Expr,_,Infos),LS,S,PredKind,0).
273		b_test_boolean_expression_for_ground_state(b(Expr,_,Infos),LS,S,PredKind,Nr) :-
274		expand_const_and_vars_to_full_store(S,FS), % ensure we have full store
275	?	b_test_boolean_expression_for_ground_state2(Expr,Infos,LS,FS,PredKind,Nr).
276
277		b_test_boolean_expression_for_ground_state1(b(Expr,_,Infos),LS,S,Kind,Nr) :- !,
278	?	b_test_boolean_expression_for_ground_state2(Expr,Infos,LS,S,Kind,Nr).
279
280		b_test_boolean_expression_for_ground_state2(conjunct(LHS,RHS),_,LocalState,State,Kind,Nr) :- !,
281		% usually LHS is the nested conjunct and RHS atomic:
282		%it would be better to swap LHS and RHS: but does not seem to buy anything
283	?	b_test_boolean_expression_for_ground_state1(LHS,LocalState,State,Kind,Nr),
284		!, % do we need this cut; it makes partial evaluation more tricky
285	?	b_test_boolean_expression_for_ground_state1(RHS,LocalState,State,Kind,Nr).
286		% TO DO: treate lazy_let_pred ?
287		b_test_boolean_expression_for_ground_state2(BE,Infos,LS,S,Kind,Nr) :-
288	?	b_test_boolean_expression_cs(b(BE,pred,Infos),LS,S,Kind,Nr).
289
290		state_violates_invariant(ID,State) :-
291		State \== root,
292		State \= concrete_constants(_), % machine not yet initialised (cf state_corresponds_to_initialised_b_machine)
293		\+(state_satisfies_invariant_aux(ID,State)).
294
295
296		% new profiler
297		%:- use_module('../extensions/profiler/profiler.pl').
298		%:- use_module('../extensions/profiler/profiler_te.pl').
299		%:- enable_profiling_naming(b_interpreter:state_violates_assertions_aux/2,name2).
300
301		%name2(b_interpreter:state_violates_assertions_aux,_,ASSERTIONS).
302
303		%state_violates_assertions(ID,State) :-
304		% b_interpreter:state_violates_assertions_aux(ID,State).
305
306		% old profiler
307		:- use_module(runtime_profiler,[profile_single_call/3]).
308		:- use_module(bmachine,[get_assertions_from_machine/2, b_machine_has_dynamic_assertions/0, b_machine_has_static_assertions/0]).
309		state_violates_assertions(ID,State) :-
310		profile_single_call('ASSERTIONS',ID,b_interpreter:state_violates_assertions_aux(ID,State)).
311		state_violates_assertions_aux(ID,State) :-
312		b_machine_has_dynamic_assertions,
313		state_corresponds_to_initialised_b_machine(State,BState), !,
314		\+(state_satisfies_assertions(ID,dynamic,BState)).
315		state_violates_assertions_aux(ID,State) :-
316		b_machine_has_static_assertions,
317		state_corresponds_to_set_up_constants_only(State,BState),
318		\+(state_satisfies_assertions(ID,static,BState)).
319		state_satisfies_assertions(ID,Type,State) :-
320		( get_assertions_from_machine(Type,Ass) ->
321		set_error_context(checking_assertions),
322		%enter_new_error_scope(Level,checking_assertions),
323		preferences:get_computed_preference(debug_time_out,DebugTimeOut),
324		%print(checking_assertions(ID)),nl,
325		time_out_with_enum_warning_one_solution(
326		b_test_list_of_boolean_expression_for_ground_state(Ass,'ASSERTION ',[],State),
327		DebugTimeOut,TimeOutRes, clear_errors),
328		% TO DO: in case of a virtual time-out (cf UML-B/drone_2_error.eventb) we could try and continue with the next assertion
329		clear_error_context,
330		(nonvar(TimeOutRes),
331		(TimeOutRes == time_out, Kind='TIMEOUT' ; TimeOutRes = virtual_time_out(_), Kind = 'Virtual TIMEOUT')
332		-> format('~n*** ~w during assertion checking for state id ~w!~n',[Kind,ID]),
333		assert_time_out_for_assertions(ID)
334		; true
335		)
336		; true
337		).
338
339
340
341		/* ----------------------------------*/
342		/* b_test_boolean_expression */
343		/* ----------------------------------*/
344
345
346		:- type variable_id_list +--> list(type(variable_id)).
347
348		:- type boolean_expression +--> call(bsyntaxtree:check_if_typed_predicate).
349
350		% used for testing ASSERTIONS on a fully ground state
351		b_test_list_of_boolean_expression_for_ground_state(List,PredKind,LS,S) :-
352		b_test_list_of_boolean_expression_aux(List,PredKind,1,LS,S).
353
354		b_test_list_of_boolean_expression_aux([],_,_,_,_).
355		b_test_list_of_boolean_expression_aux([B1|T],PredKind,Nr,LS,S) :- %nl,print(nr(PredKind,Nr)),nl,
356	?	(b_test_boolean_expression_for_ground_state1(B1,LS,S,PredKind,Nr)
357		-> N1 is Nr+1, b_test_list_of_boolean_expression_aux(T,PredKind,N1,LS,S)
358		; silent_mode(off),
359		(critical_enumeration_warning_occured_in_error_scope -> Res='UNKNOWN'
360		; abort_error_occured_in_error_scope -> Res ='NOT-WELL-DEFINED'
361		; Res='false'),
362		ajoin([PredKind, Nr, ' is ', Res,': '],Msg),
363		add_message(b_interpreter,Msg,B1,B1), % TO DO: get just label/location?
364		fail).
365
366
367		:- use_module(b_interpreter_components).
368
369
370		:- assert_pre(b_interpreter:b_test_boolean_expression_cs(E,LS,S,_,_),
371		(bsyntaxtree:check_if_typed_predicate(E),type_check(LS,store),type_check(S,store) )).
372		:- assert_post(b_interpreter:b_test_boolean_expression_cs(_,_,_,_,_), true ).
373
374
375		% --------------------- BOOLEAN EXPRESSIONS ----------------------------
376
377		:- use_module(b_interpreter_check).
378		:- use_module(kernel_propagation, [do_not_enumerate_binary_boolean_operator/3]).
379
380		% a version where we can provide an initial call stack entry for context
381		b_test_boolean_expression_cs(E,LS,S,PredKind,Nr) :-
382		init_wait_flags_cs(E,PredKind,Nr,b_test_boolean_expression_cs,WF),
383		% TO DO: call b_trace_test_components ?
384	?	b_test_boolean_expression(E,LS,S,WF),
385	?	ground_wait_flags(WF).
386
387		init_wait_flags_cs(E,PredKind,Nr,PP,WF) :-
388		(PredKind=none -> init_wait_flags(WF,[PP])
389		; get_texpr_pos(E,Pos),
390		CallStackEntry = prob_command_context(check_pred_command(PredKind,Nr),Pos),
391		init_wait_flags_and_push_call_stack(no_wf_available,CallStackEntry,WF)
392		).
393
394
395		b_test_boolean_expression(b(Expr,_,Infos),LS,S,WF) :- !,
396		(b_interpreter_check:composed(Expr) -> empty_avl(Ai)
397		; Ai = no_avl), % simple expression: no sharing is possible: no need to register expressions
398	?	b_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,_).
399		b_test_boolean_expression(E,LS,S,WF) :- % will generate error message
400		empty_avl(Ai), b_test_boolean_expression(E,LS,S,WF,Ai,_).
401
402		:- assert_pre(b_interpreter:b_test_boolean_expression(E,LS,S,WF),
403		(nonvar(E),bsyntaxtree:check_if_typed_predicate(E),type_check(LS,store),type_check(S,store),
404		type_check(WF,wait_flag))).
405		:- assert_post(b_interpreter:b_test_boolean_expression(_,_,_,WF), type_check(WF,wait_flag)).
406
407
408		%b_test_boolean_expression(Expr,_,_,_) :- print('test: '),translate:print_bexpr(Expr),nl,print(Expr),nl,fail. %%
409
410		:- load_files(library(system), [when(compile_time), imports([environ/2])]).
411		:- if(environ(prob_debug_watch_flag,true)).
412		b_test_boolean_expressiond(b(Expr,_,Infos),LS,S,WF,Ai,Ao) :- !,
413		b_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao).
414		b_test_boolean_expression(Expr,LS,S,WF,Ai,Ao) :- !,
415		(waitflag0_is_set(WF)
416		-> debug:watch(300,b_interpreter:b_test_boolean_expressiond(Expr,LS,S,WF,Ai,Ao))
417		; debug:watch_det(300,b_interpreter:b_test_boolean_expressiond(Expr,LS,S,WF,Ai,Ao)) ).
418		:- else.
419		b_test_boolean_expression(b(Expr,Type,Infos),LS,S,WF,Ai,Ao) :- !,
420		(preference(smt_supported_interpreter,true)
421		-> b_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao),
422		get_wait_flag1(smt_call,WF,BeforeEnumWF),
423		gensym:gensym(smt_assertion_name,Symbol),
424		smt_add_predicate(BeforeEnumWF,b(Expr,Type,Infos),LS,S,Symbol)
425		;
426	?	b_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao)).
427		:- endif.
428		b_test_boolean_expression(E,LS,S,WF,Ai,Ao) :-
429		add_internal_error('Boolean expression not properly wrapped: ',
430		b_test_boolean_expression(E,LS,S,WF,Ai,Ao)),
431		b_test_boolean_expression2(E,[],LS,S,WF,Ai,Ao).
432
433
434		b_test_boolean_expression2(truth,_,_,_,_WF,Ai,Ao) :- !,Ai=Ao.
435		b_test_boolean_expression2(falsity,_,_,_,_WF,_Ai,_Ao) :- !,fail.
436		b_test_boolean_expression2(negation(BExpr),_,LocalState,State,WF,Ai,Ao) :- !,
437	?	b_not_test_boolean_expression(BExpr,LocalState,State,WF,Ai,Ao).
438		b_test_boolean_expression2(conjunct(LHS,RHS),_,LocalState,State,WF,Ai,Ao) :- !,
439	?	b_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
440	?	b_test_boolean_expression(RHS,LocalState,State,WF,Aii,Ao).
441		b_test_boolean_expression2(implication(LHS,RHS),Info,LocalState,State,WF,Ai,Ao) :-
442		%b_compiler:b_compile(LHS,[],LocalState,State,CLHS), % this slows down Cruise benchmark from 3.75 s to 4.3
443		!,
444	?	b_test_implication(LHS,RHS,Info,LocalState,State,WF,Ai,Ao).
445		b_test_boolean_expression2(equivalence(LHS,RHS),_,LocalState,State,WF,Ai,Ao) :- !,
446	?	b_test_equivalence(LHS,RHS,LocalState,State,WF,Ai,Ao).
447		b_test_boolean_expression2(disjunct(LHS,RHS),Info,LocalState,State,WF,Ai,Ao) :- !,
448		% TO DO: normalise disjunct first ?
449		copy_wf_start(WF,disjunct,CWF),
450	?	if(b_check_boolean_expression(LHS,LocalState,State,CWF,PredRes,Ai,Aii),
451		% we can check lhs
452	?	if(b_interpreter_check:b_check_boolean_expression0(pred_false,PredRes,RHS,LocalState,State,CWF,RR,Aii,Ao),
453		( /* we can also check rhs */
454	?	b_interpreter_check:disjoin(PredRes,RR,pred_true,LHS,RHS,WF),
455		copy_wf_finish(WF,CWF)
456		),
457		(
458		Ao=Aii,
459		copy_wf_finish(WF,CWF),
460		imply_test_boolean_expression(PredRes,pred_false,RHS,LocalState,State,WF,Aii),
461		perfmessagecall(choice_point,reification_of_disjunction_rhs_failed,translate:print_bexpr(RHS),Info),
462		enumerate_bool(PredRes,15,WF)
463		)
464		),
465		% we cannot check lhs
466		if((always_well_defined(RHS),
467		b_check_boolean_expression(RHS,LocalState,State,CWF,PredRes,Ai,Aii)),
468		(
469		Ao=Aii,
470		copy_wf_finish(WF,CWF),
471		imply_test_boolean_expression(PredRes,pred_false,LHS,LocalState,State,WF,Aii),
472		perfmessagecall(choice_point,reification_of_disjunction_lhs_failed,translate:print_bexpr(LHS),Info),
473		enumerate_bool(PredRes,15,WF)
474		),
475		% we cannot check neither lhs nor rhs:
476		(Ai=Ao,
477		get_priority_of_boolean_expression2(disjunct(LHS,RHS),StartPrio),
478		%get_wait_flag(Prio,disjunct,WF,WF2),
479		get_binary_choice_wait_flag_exp_backoff(StartPrio,disjunct,WF,WF2),
480		% be sure that e.g. for (x=2 or x=3) both branches will be tested once deterministic propagation is over
481		%print(prio(Prio)), print(' : '),print_bexpr(LHS), print(' or '), print_bexpr(RHS),nl,
482		perfmessagecall(choice_point,reification_of_disjunction_failed,translate:print_bexpr(b(disjunct(LHS,RHS),pred,Info)),Info),
483		b_test_disjunction(LHS,RHS,LocalState,State,WF,WF2,Ai)
484		)
485		)
486		).
487		b_test_boolean_expression2(exists(Parameters,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,Ai=Ao,
488	?	b_test_exists(Parameters,RHS,Infos,LocalState,State,WF).
489		%b_test_boolean_expression2(forall(PARS,LHS,RHS),_Inf,LocalState,State,WF) :-
490		% PARS = [b(identifier(R1),integer,_),b(identifier(R2),integer,_)],
491		% LHS = b(conjunct(b(conjunct(MEM1,MEM2),pred,_I1),NEQ),pred,_I2),
492		% NEQ = b(not_equal(b(identifier(RR1),integer,_I3),b(identifier(RR2),integer,_I4)),pred,_I5),
493		% (RR1=R1, RR2=R2 ; RR1=R2, RR2=R1),
494		% MEM1 = b(member(b(identifier(RRR1),integer,_),b(SET,set(integer),_)),pred,_),
495		% MEM2 = b(member(b(identifier(RRR2),integer,_),b(SET,set(integer),_)),pred,_),
496		% (RRR1=R1, RRR2=R2 ; RRR1=R2, RRR2=R1),
497		% /* TO DO: check that RHS is symmetric ! */ /* TO DO : generalize symmetry breaking */
498		% !, % print(symmetry_breaking_forall(R1,R2)),nl,
499		% GT = b(less(b(identifier(R1),integer,_I3),b(identifier(R2),integer,_I4)),pred,_I5),
500		% NewLHS = b(conjunct(b(conjunct(MEM1,MEM2),pred,_I1),GT),pred,_I2),
501		% b_test_boolean_expression2(forall(PARS,NewLHS,RHS),_Inf,LocalState,State,WF).
502		b_test_boolean_expression2(forall(Parameters,LHS,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,Ai=Ao,
503		/* !ID.(LHS => RHS) */
504		% print_message(forall(Parameters,LHS,RHS)),
505		% get_wait_flag0(WF,WF0), when(nonvar(WF0),
506	?	b_for_all(Parameters,Infos,LHS,RHS,LocalState,State,WF). %).
507		b_test_boolean_expression2(let_predicate(Ids,AssignmentExprs,Pred),Infos,LocalState,State,WF,Ai,Ao) :- !,
508		Ai=Ao, % any expression inside the LET cannot be safely reused
509		(is_truth(Pred)
510		-> % useless let, only sense of computations below is in detecting WD errors
511		get_enumeration_starting_wait_flag(useless_let_predicate(Ids),WF,ESWF),
512		when(nonvar(ESWF),set_up_localstate_for_let(Ids,_,AssignmentExprs,LocalState,State,_LetState,WF))
513	?	; set_up_localstate_for_let(Ids,ParaValues,AssignmentExprs,LocalState,State,LetState,WF),
514		opt_push_wait_flag_call_stack_quantifier_info(WF,let_quantifier,Ids,ParaValues,Infos,WF2),
515	?	b_test_boolean_expression(Pred,LetState,State,WF2)). % we could pass Ai in if Ids fresh
516
517		b_test_boolean_expression2(lazy_let_pred(Id,AssignmentExpr,Expr),_I,LocalState,State,WF,Ai,Ao) :- !,
518		add_lazy_let_id_and_expression(Id,AssignmentExpr,LocalState,State,NewLocalState,WF,Ai),
519	?	b_test_boolean_expression(Expr,NewLocalState,State,WF,Ai,Ao). % we could use Ai,Ao version as lazy lets never interfere with each other and never invalidate existing expressions
520		b_test_boolean_expression2(lazy_lookup_pred(Id),_Info,LocalState,_State,WF,Ai,Ao) :- !, Ai=Ao,
521		lookup_value_for_existing_id_wf(Id,LocalState,(Trigger,Value),WF), % should normally only occur in LocalState; value introduced by lazy_let
522		(Trigger,Value) = (pred_true,pred_true). % force evaluation
523		b_test_boolean_expression2(value(PredVal),_Info,_LocalState,_State,_WF,Ai,Ao) :- !, % this can occur when lazy_lookup_pred gets compiled by b_compiler
524		is_pred_true(PredVal),Ai=Ao.
525		b_test_boolean_expression2(Pred,Info,LocalState,State,WF,Ai,Ao) :-
526		% TO DO: we could put some of the operators into the Ai store (comparison operators)
527	?	b_interpreter_check:register_predicate(Pred,Info,pred_true,Reused,Ai,Ao),
528		(Reused==true
529		-> %% print('REUSED: '), translate:print_bexpr(Pred),nl
530		true
531	?	; b_test_atomic_boolean_expression2(Pred,Info,LocalState,State,WF)).
532
533		:- block is_pred_true(-).
534		is_pred_true(X) :- (X=pred_true -> true ; X=pred_false -> fail ; add_internal_error('Illegal call: ',is_pred_true(X)),fail).
535		:- block is_pred_false(-).
536		is_pred_false(X) :- (X=pred_false -> true ; X=pred_true -> fail ; add_internal_error('Illegal call: ',is_pred_false(X)),fail).
537
538
539		% we could simply call disjunct(NegLHS,RHS) ?
540		% A => B has more of a feeling of a passive constraint than A or B
541		% hence we use a lower priority here for enumerate_bool below and do not
542		% try to reify rhs if lhs reification failed (but maybe we should)
543		b_test_implication(LHS,RHS,_Info,LocalState,State,WF,Ai,Ao) :-
544		copy_wf_start(WF,implication,CWF),
545	?	if(b_check_boolean_expression(LHS,LocalState,State,CWF,PredRes,Ai,Aii),
546		%% print('checking => '), print_bexpr(LHS), print(' '), print(PredRes),nl,
547		%% The following improves constraint propagation; but can be tricky with undefinedness
548		if((var(PredRes),always_well_defined(RHS),
549		b_check_boolean_expression(RHS,LocalState,State,CWF,RHSPredRes,Aii,Ao)),
550		(/* also propagate from right to left */
551	?	b_interpreter_check:imply_true(PredRes,RHSPredRes),
552		perfmessage_bexpr(good(reify),'Fully reified implication with LHS: ',LHS),
553	?	copy_wf_finish(WF,CWF)
554		),
555		( Aii=Ao,
556	?	copy_wf_finish(WF,CWF),
557	?	imply_test_boolean_expression(PredRes,pred_true,RHS,LocalState,State,WF,Aii),
558		(nonvar(PredRes) -> true
559		; performance_monitoring_on,
560		\+always_well_defined(RHS) -> perfmessage_bexpr(reify,'Cannot reify RHS of => due to WD condition, creating choice point:',RHS)
561		; perfmessage_bexpr(reify,'Cannot reify RHS of =>, creating choice point:',RHS)
562		),
563		enumerate_bool(PredRes,10000,WF) % lower priority than disjunction (15); we could use last_finite_priority ?
564		)
565		),
566		( Ai=Ao,
567		perfmessage_bexpr(reify,'Cannot reify LHS of =>, creating binary choice point:',LHS),
568		get_binary_choice_wait_flag(implication,WF,WF2),
569		block_test_implication(LHS,RHS,LocalState,State,WF,WF2)
570		)
571		).
572
573		% ------------
574
575		:- discontiguous b_test_atomic_boolean_expression2/5.
576		%b_test_atomic_boolean_expression2(Expr,T,LocalState,State,WF) :- print(eval(Expr,T)),nl,fail.
577		b_test_atomic_boolean_expression2(partition(LHS,RHS),_,LocalState,State,WF) :- !,
578		b_compute_expression(LHS,LocalState,State,SV1,WF), %print(lhs(SV1)),nl,
579		l_compute_expression(RHS,LocalState,State,SV2,WF), % RHS is Prolog list of expressions
580	?	kernel_call_predicate(partition_wf(SV1,SV2,WF),kernel_objects,WF,partition(LHS,RHS)).
581		b_test_atomic_boolean_expression2(member(TElem,TSet),_,LocalState,State,WF) :- !,
582	?	b_test_member_expression(TElem,TSet,LocalState,State,WF).
583		b_test_atomic_boolean_expression2(not_member(TElem,TSet),Info,LocalState,State,WF) :- !,
584		get_texpr_expr(TSet,Set),
585	?	b_test_notmember_expression(Set,TElem,TSet,Info,LocalState,State,WF).
586		b_test_atomic_boolean_expression2(freetype_case(Freetype,Case,Expr),_,LocalState,State,WF) :-
587		!,equal_object_wf(Value,freeval(Freetype,Case,_),b_test_atomic_boolean_expression2,WF),
588		b_compute_expression(Expr,LocalState,State,Value,WF). % NOT COVERED (16)
589		b_test_atomic_boolean_expression2(finite(SetExpr),_,LocalState,State,WF) :-
590		!, b_compute_expression(SetExpr,LocalState,State,Value,WF),
591		kernel_call_predicate(is_finite_set_wf(Value,WF),kernel_objects,WF,finite(SetExpr)).
592		/* Extension for Kodkod */
593		b_test_atomic_boolean_expression2(kodkod(ProblemId,_),_,LocalState,State,WF) :-
594		!,get_wait_flag1(kodkod_call,WF,WF0),
595		kodkod_request(ProblemId,pos,LocalState,State,WF0). % NOT COVERED (17)
596		%b_test_atomic_boolean_expression2(equal(Arg1,Arg2),_,LocalState,State,WF) :- get_texpr_type(Arg1,integer),!,
597		% b_compute_expression(Arg1,LocalState,State,ExprRes,WF),
598		% b_compute_expression(Arg2,LocalState,State,ExprRes,WF). /* avoids one extra variable compared to code below + could fail earlier ; but problem as b_compute_expression still uses = in some places */
599
600		:- include(b_arithmetic_expressions).
601		%The following clause improves Nqueens performance by about 50 %; by avoiding intermediate variables
602		% TO DO: do the same for >, <, >= ...
603		b_test_atomic_boolean_expression2(equal(Arg1,Arg2),Info,LocalState,State,WF) :- !,
604	?	b_test_atomic_equal_boolean_expression(Arg1,Arg2,Info,LocalState,State,WF).
605		b_test_atomic_boolean_expression2(not_equal(Arg1,Arg2),Info,LocalState,State,WF) :- !,
606	?	b_test_atomic_not_equal_boolean_expression(Arg1,Arg2,Info,LocalState,State,WF).
607		b_test_atomic_boolean_expression2(less_equal(Arg1,Arg2),_Info,LocalState,State,WF) :-
608		%get_texpr_type(Arg1,integer), % type checker already checks this
609		preferences:preference(use_clpfd_solver,true),
610		!,
611	?	b_compute_arith_expression(Arg1,LocalState,State,CLPFD_Expr1,WF),
612	?	b_compute_arith_expression(Arg2,LocalState,State,CLPFD_Expr2,WF),
613		clpfd_interface:clpfd_leq_expr(CLPFD_Expr1,CLPFD_Expr2).
614		b_test_atomic_boolean_expression2(greater_equal(Arg1,Arg2),_Info,LocalState,State,WF) :-
615		%get_texpr_type(Arg1,integer), % type checker already checks this
616		preferences:preference(use_clpfd_solver,true),
617		!,
618	?	b_compute_arith_expression(Arg1,LocalState,State,CLPFD_Expr1,WF),
619	?	b_compute_arith_expression(Arg2,LocalState,State,CLPFD_Expr2,WF),
620		clpfd_interface:clpfd_leq_expr(CLPFD_Expr2,CLPFD_Expr1).
621		b_test_atomic_boolean_expression2(less(Arg1,Arg2),_Info,LocalState,State,WF) :-
622		%get_texpr_type(Arg1,integer), % type checker already checks this
623		preferences:preference(use_clpfd_solver,true),
624		!,
625	?	b_compute_arith_expression(Arg1,LocalState,State,CLPFD_Expr1,WF),
626	?	b_compute_arith_expression(Arg2,LocalState,State,CLPFD_Expr2,WF),
627		clpfd_interface:clpfd_lt_expr(CLPFD_Expr1,CLPFD_Expr2).
628		b_test_atomic_boolean_expression2(greater(Arg1,Arg2),_Info,LocalState,State,WF) :-
629		%get_texpr_type(Arg1,integer), % type checker already checks this
630		preferences:preference(use_clpfd_solver,true),
631		!,
632	?	b_compute_arith_expression(Arg1,LocalState,State,CLPFD_Expr1,WF),
633		b_compute_arith_expression(Arg2,LocalState,State,CLPFD_Expr2,WF),
634		clpfd_interface:clpfd_lt_expr(CLPFD_Expr2,CLPFD_Expr1).
635		b_test_atomic_boolean_expression2(external_pred_call(FunName,Args),Info,LocalState,State,WF) :-
636		!,
637		(do_not_evaluate_args(FunName) -> EvaluatedArgs=[]
638	?	; b_compute_expressions(Args, LocalState,State, EvaluatedArgs, WF)),
639		push_wait_flag_call_stack_info(WF,external_call(FunName,EvaluatedArgs,Info),WF2),
640		call_external_predicate(FunName,Args,EvaluatedArgs,LocalState,State,pred_true,Info,WF2).
641		b_test_atomic_boolean_expression2(Expression,Info,LocalState,State,WF) :-
642		preferences:preference(use_clpfd_solver,false),
643		special_binary_predicate(Expression,Module:Kernel_predicate,Arg1,T1,Arg2,T2),
644		(nonmember(contains_wd_condition,Info) -> true ; preference(disprover_mode,true)),
645		!,
646		% print('Special call: '), print_bexpr(Expression),nl, print(Kernel_predicate),print(' : '),nl,
647		%(Arg1==list_of_expressions -> b_compute_expressions ... % no longer needed
648		b_compute_expression(Arg1,LocalState,State,SV1,WF),
649		b_compute_expression(Arg2,LocalState,State,SV2,WF),
650		KernelCall =.. [Kernel_predicate,SV1,T1,SV2,T2,WF],
651		kernel_call_predicate(KernelCall,Module,WF,Expression).
652		b_test_atomic_boolean_expression2(Expression,_,LocalState,State,WF) :-
653		functor(Expression,BOP,2),
654		kernel_mappings:binary_boolean_operator(BOP,Module:Kernel_predicate,WFEnabled),!,
655		arg(1,Expression,Arg1), arg(2,Expression,Arg2),
656	?	b_compute_expression(Arg1,LocalState,State,SV1,WF), % TODO: symbolic for some BOP: <:, <<: ?
657		(binary_boolean_operator_trivially_true(BOP,SV1)
658		-> check_well_defined(Arg2,LocalState,State,WF)
659	?	; b_compute_expression(Arg2,LocalState,State,SV2,WF),
660		( WFEnabled==yes ->
661		KernelCall =.. [Kernel_predicate,SV1,SV2,WF2],
662		(do_not_enumerate_binary_boolean_operator(BOP,Arg1,Arg2) % we assume: this is only true for WFEnabled predicates
663		-> add_wait_flag_info(WF,wfx_no_enumeration,WF2)
664		; WF2=WF)
665		; KernelCall =.. [Kernel_predicate,SV1,SV2], WF2=WF % note: WF2 still used in kernel_call_predicate
666		),
667	?	kernel_call_predicate(KernelCall,Module,WF2,Expression)
668		).
669		b_test_atomic_boolean_expression2(E,Info,_LS,_S,_WF) :-
670		add_internal_error('Uncovered boolean expression: ',b(E,pred,Info)),
671		print_functor(E),nl,
672		fail.
673
674
675		binary_boolean_operator_trivially_true(subset,X) :- X==[].
676
677		check_well_defined(Arg,_LocalState,_State,_WF) :-
678		always_well_defined(Arg),!.
679		check_well_defined(Arg,LocalState,State,WF) :-
680		b_compute_expression(Arg,LocalState,State,_,WF).
681
682		%:- use_module(specfile,[animation_minor_mode/1]).
683		:- use_module(b_machine_hierarchy,[abstract_constant/2, concrete_constant/2]).
684		b_test_atomic_equal_boolean_expression(Arg1,Arg2,_Info,LocalState,State,WF) :-
685		Arg1 = b(_,integer,_), %get_texpr_type(Arg1,integer),
686		preferences:preference(use_clpfd_solver,true),!,
687		(Arg2 = b(_,integer,_) -> true ; add_internal_error('Type error in AST, not wrapped integer: ',Arg2)),
688	?	b_test_arith_equal_boolean_expression(Arg1,Arg2,LocalState,State,WF).
689		b_test_atomic_equal_boolean_expression(Arg1,Arg2,Info,LocalState,State,WF) :-
690	?	member(prob_annotation('LAMBDA-EQUALITY'),Info),
691		\+ simple_expression(Arg2),
692		is_lambda_result_id(Arg1), %get_texpr_id(Arg1,'_lambda_result_'), % ensure we have not renamed it to was_lambda_result ?
693		!, % this is an equality for the result of a lambda abstraction; only evaluate at the end
694		b_compute_expression(Arg1,LocalState,State,SV1,WF), % this is the lambda result identifier _lambda_result_
695		%get_enumeration_finished_wait_flag(WF,EWF),
696		%get_wait_flag(10000,lambda_result,WF,EWF),
697		% compute deterministic parts of Arg2 in wf0 phase: avoid computing this stuff over again
698		%print('DELAY: '), translate:print_bexpr(Arg2),nl,
699	?	kernel_waitflags:copy_wf01e_wait_flags(WF,WF2), b_compute_expression(Arg2,LocalState,State,SV2,WF2),
700		get_last_wait_flag(lambda_result,WF,EWF),
701		ground_value_check(SV2,G2),
702		when((nonvar(G2);nonvar(SV1);nonvar(EWF)),b_lambda_result_equal_boolean_expression(SV1,SV2,WF,EWF,WF2)).
703		b_test_atomic_equal_boolean_expression(Arg1,Arg2,Info,LocalState,State,WF) :-
704		(LocalState = []
705		-> true % only check if we are at the outer level
706		% (not inside a quantifier,...) or if we have CSE introduzed lazy_lets:
707		; preferences:preference(use_common_subexpression_elimination,true)
708		% TO DO: check that we have only added @nr to local state from lazy_let; ADD INFO FIELD
709		),
710		get_texpr_type(Arg1,Type1), is_set_type(Type1,SetType1),
711		% previously we required SetType1 = couple(_,_)
712		get_texpr_id(Arg1,ID),
713		% we could check: \+ get_texpr_id(Arg2,_), we do not need to treat simple equations like ID=ID2; unless for memo?
714	?	(abstract_constant(ID,_) % check if ABSTRACT_CONSTANT
715		-> Kind=abstract,
716	?	kernel_objects:max_cardinality(Type1,MaxCard1),
717		(number(MaxCard1) % check that type is large enough to warrant recursive or symbolic treatment
718		-> (MaxCard1>100 -> true ; constant_variable_marked_as_memo(ID))
719		; true)
720		; %fail,
721	?	concrete_constant(ID,_)
722		-> Kind=concrete,
723		(constant_variable_marked_as_expand(ID)
724		-> true % note: we also check for expand annotation in store (expand_closure_value),
725		% but it is useful to expand ID already here to ease checking PROPERTIES
726		; constant_variable_marked_as_memo(ID))
727		%; b_is_unused_constant(ID) -> ABSTRACT=true % TO DO: check if ID not used somewhere else in Properties ??!!
728		),
729		% in future: we may do size change analysis, or something like that to check that we have properly defined
730		% recursive function
731		debug_format(19,'Equation defining ~w constant: ~w~n',[Kind,ID]),
732		!,
733		(constant_variable_marked_as_expand(ID) -> SymArg2 = Arg2 ; mark_bexpr_as_symbolic(Arg2,SymArg2)),
734	?	b_add_constant_definition(Kind,ID,Info,Arg1,SetType1,SymArg2,LocalState,State,WF).
735		b_test_atomic_equal_boolean_expression(Arg1,Arg2,Info,LocalState,State,WF) :-
736		constants_profiling_on,
737		get_texpr_id(Arg1,ID),b_is_constant(ID), !,
738		% Note: does not yet keep track of arithmetic equalities above
739		b_compute_expression(Arg1,LocalState,State,SV1,WF),
740		push_constant_def_equality_call_stack(WF,ID,Info,WF2),
741		start_profile(ID,T1),
742		b_compute_expression(Arg2,LocalState,State,SV2,WF2),
743		get_waitflags_phase(WF,Phase),
744		stop_constant_profile(SV2,Phase,ID,[],T1), % normal constant, not symbolic, memoized or recursive
745		start_propagation_profile(ID,T2,CstL1),
746		kernel_call_predicate_equal_object_optimized(SV1,SV2,WF),
747		stop_propagation_profile(SV2,ID,T2,CstL1).
748		b_test_atomic_equal_boolean_expression(Arg1,Arg2,_Info,LocalState,State,WF) :-
749	?	b_compute_expression(Arg1,LocalState,State,SV1,WF),
750	?	b_compute_expression(Arg2,LocalState,State,SV2,WF),
751	?	kernel_call_predicate_equal_object_optimized(SV1,SV2,WF).
752
753
754
755		% treat equality ID = Symbolic Function (or relation/set)
756		b_add_constant_definition(Kind,ID,Info,Arg1,SetType1,SymArg2,LocalState,State,WF) :-
757		% observe CTRL-C: e.g., in data validation models these abstract functions can be very large and costly to compute
758	?	observe_user_interrupt_signal(computing_value_for_abstract_constant(ID),SymArg2,
759		b_add_constant_definition_aux(Kind,ID,Info,Arg1,SetType1,SymArg2,LocalState,State,WF)).
760
761		:- use_module(runtime_profiler,[start_profile/2,
762		stop_constant_profile/5, constants_profiling_on/0]).
763		b_add_constant_definition_aux(Kind,ID,_Info,Arg1,SetType1,SymArg2,LocalState,State,WF) :-
764		preference(use_function_memoization,MemoPref), % true, false or default
765		MemoPref \= false, % turned off
766		( MemoPref = true, Kind=abstract ;
767		constant_variable_marked_as_memo(ID)), % description(memo) as info field using @desc memo pragma; see
768		!,
769		start_profile(ID,T1),
770		b_compute_expression(Arg1,LocalState,State,SV1,WF), % the identifier
771		(SymArg2 = b(recursive_let(TID,Body),_,_)
772		-> get_texpr_id(TID,RecID),
773		b_compute_expression(Body,[bind(RecID,RedIDVal)|LocalState],State,SV2,WF),
774		RecValue='$recursion_value'(RedIDVal), IDInfo = [recursive_memo]
775		; b_compute_expression(SymArg2,LocalState,State,SV2,WF),
776		RecValue='$no_recursion', IDInfo = [memoized]
777		),
778		get_waitflags_phase(WF,Phase), stop_constant_profile(SV2,Phase,ID,IDInfo,T1),
779		(nonvar(SV2), SV2 \= closure(_,_,_)
780		-> % value fully computed; no need to memoize
781		debug_println(19,not_memoizing(ID)),
782		kernel_call_predicate_equal_object_optimized(SV1,SV2,WF)
783		; (nonvar(SV2) -> mark_closure_as_symbolic(SV2,SV3) ; SV3=SV2),
784		memoization:register_memoization_function(ID,SV3,SetType1,RecValue,MEMOID,SV4),
785		debug_println(19,marking_for_memoization(ID,MEMOID)),
786		kernel_call_predicate_equal_object_optimized(SV1,SV4,WF)
787		).
788		b_add_constant_definition_aux(_Kind,ID,Info,Arg1,_,SymArg2,LocalState,State,WF) :-
789		start_profile(ID,T1),
790		b_compute_expression(Arg1,LocalState,State,SV1,WF), % the identifier ID
791		push_constant_def_equality_call_stack(WF,ID,Info,WF2),
792	?	b_compute_expression(SymArg2,LocalState,State,SV2,WF2),
793		(constant_variable_marked_as_expand(ID)
794		-> IDInfo = [marked_as_expand],
795		b_expand_compute_comprehension_set(SV2,Info,SV3,WF)
796		; definitely_expand_this_explicit_set(SV2) % check for a few patterns which should definitely be expanded;
797		% in case user puts a set accidentally into the ABSTRACT_CONSTANTS section
798		-> IDInfo = [automatic_expand],
799		b_expand_compute_comprehension_set(SV2,Info,SV3,WF)
800		; var(SV2) -> IDInfo = [], SV3=SV2
801		; IDInfo = [], % it is from ABSTRACT_CONSTANTS, but this info is already stored
802		mark_closure_as_symbolic(SV2,SV3)
803		),
804		get_waitflags_phase(WF,Phase), stop_constant_profile(SV3,Phase,ID,IDInfo,T1),
805		start_propagation_profile(ID,T2,CstL1),
806		kernel_call_predicate_equal_object_optimized(SV1,SV3,WF),
807		% profile propagation time and what constants are grounded
808		stop_propagation_profile(SV3,ID,T2,CstL1).
809
810		push_constant_def_equality_call_stack(WF,ID,Pos,WF2) :-
811		(constants_profiling_on
812		-> push_wait_flag_call_stack_info(WF,
813		id_equality_evaluation(ID,constant,Pos),WF2)
814		; WF2=WF).
815
816		start_propagation_profile(ID,T1,CstL1) :-
817		(constants_profiling_on -> findall(Cst1,det_solution_for_constant_was_stored(Cst1),CstL1) ; CstL1=[]),
818		start_profile(ID,T1).
819		stop_propagation_profile(SV3,ID,T1,CstL1) :-
820		(constants_profiling_on
821		-> findall(Cst2,det_solution_for_constant_was_stored(Cst2),L2),
822		append(CstL1,New,L2), debug_format(9,'Propagation of value for ~w instantiated ~w~n',[ID,New]),
823		IDInfo2 = [instantiates(New)]
824		; IDInfo2 = []),
825		stop_constant_profile(SV3,propagate_value,ID,IDInfo2,T1).
826
827		% treat not(Arg1 = Arg2) predicates
828		b_test_atomic_not_equal_boolean_expression(Arg1,Arg2,_Info,LocalState,State,WF) :-
829		get_texpr_type(Arg1,boolean),!, % special treatment : not_equal_object has no type information
830		b_compute_expression(Arg1,LocalState,State,B1,WF),
831		b_compute_expression(Arg2,LocalState,State,B2,WF),
832		negate(B1,B2). % from bool_pred
833		b_test_atomic_not_equal_boolean_expression(Arg1,Arg2,_Info,LocalState,State,WF) :-
834		get_texpr_type(Arg1,integer),
835		preferences:preference(use_clpfd_solver,true),
836		!,
837		% Note: calling b_compute_arith_expression will also instantiate a variable to at least the int(_) skeleton; thereby enabling propagation
838		% this is potentially better than calling the default versions of the predicates, which may wait until the int(_) skeleton is set up before propagation
839	?	b_compute_arith_expression(Arg1,LocalState,State,CLPFD_Expr1,WF),
840	?	b_compute_arith_expression(Arg2,LocalState,State,CLPFD_Expr2,WF),
841		clpfd_interface:clpfd_neq_expr(CLPFD_Expr1,CLPFD_Expr2).
842		b_test_atomic_not_equal_boolean_expression(Arg1,Arg2,_Info,LocalState,State,WF) :-
843	?	b_compute_expression_symbolic(Arg1,LocalState,State,SV1,WF),
844	?	b_compute_expression_symbolic(Arg2,LocalState,State,SV2,WF),
845		kernel_call_predicate_not_equal_object(SV1,SV2,WF,not_equal(Arg1,Arg2)).
846		% Note: symbolic case occurs for symbolic abstract constants f when using DOUBLE_EVALUATION
847		% in the evaluation view which are defined by f = %x... when checking f /=
848
849		% a version of b_compute_expression which does not try to expand comprehension sets
850		% TODO: deal with other constructs which merit symbolic treatment; union of comprehension sets, ...
851		% (see line 147 in AMASS_mchs/oriented_abscissa.mch)
852		b_compute_expression_symbolic(Arg,LocalState,State,Val,WF) :-
853		(Arg = b(comprehension_set(PP,CC),_,InfoCS) % second arg is a comprehension set;
854		-> % print(symbolic(PP)),nl,
855	?	b_compute_comprehension_set_symbolic(PP,CC,InfoCS,LocalState,State,Val,WF)
856	?	; b_compute_expression(Arg,LocalState,State,Val,WF)
857		).
858		% ditto for already de-constructed b/3 expression:
859		b_compute_expression2_symbolic(comprehension_set(PP,CC),_,InfoCS,LocalState,State,Val,WF) :- !,
860		b_compute_comprehension_set_symbolic(PP,CC,InfoCS,LocalState,State,Val,WF).
861		b_compute_expression2_symbolic(Arg,Type,Info,LocalState,State,Val,WF) :-
862		b_compute_expression2(Arg,Type,Info,LocalState,State,Val,WF).
863
864		simple_expression(b(A,_,_)) :- simple_expression_aux(A).
865		simple_expression_aux(boolean_true).
866		simple_expression_aux(boolean_false).
867		simple_expression_aux(empty_set).
868		simple_expression_aux(empty_sequence).
869		simple_expression_aux(integer(_)).
870		simple_expression_aux(max_int).
871		simple_expression_aux(min_int).
872		simple_expression_aux(string(_)).
873		simple_expression_aux(value(_)).
874
875
876		is_lambda_result_id(b(identifier('_lambda_result_'),_,_)).
877		% at the moment we only detect those identifiers; the info field is currently not updated for _was_lambda_result_
878		% and not available in other treatmens of _lambda_result_ (in b_enumerate)
879		%is_lambda_result_id(b(identifier(X),_,Info)) :-
880		% memberchk(lambda_result,Info).
881		% (X=='_lambda_result_' -> (memberchk(lambda_result,Info) -> true ; format('~n*** _lambda_result_ without info: ~w~n~N',[Info])) ; memberchk(lambda_result,Info)).
882
883		%:- block b_lambda_result_equal_boolean_expression(-,?,?, -,?). % we now use when above
884		% only compute lambda result when finished finding domain element, i.e., _EWF is grounded
885		b_lambda_result_equal_boolean_expression(SV1,SV2,WF,EWF,WF2) :-
886		kernel_call_predicate_equal_object_optimized(SV1,SV2,WF),
887		% print(' LAMBDA : '), print((SV1,_EWF)),nl,
888		% the inner waitflags are for evaluating the lambda_result Expression; unless there is a WD issue this should
889		% never fail; we can delay the enumeration as much as possible
890		% NOTE: even if SV2 is ground, Arg2 may not be (e.g., if Arg2 = prj2(..,..)(NotGr,Ground))
891	?	blocking_ground_copied_wait_flags(WF2,EWF). % without when we will ground WF0 which is shared with outer WF-store
892		:- block blocking_ground_copied_wait_flags(?,-).
893		blocking_ground_copied_wait_flags(WF2,_) :-
894	?	ground_constraintprop_wait_flags(WF2). % do not ground EF flag, as shared with outer WF and WF2 is copied
895
896		% TO DO: add avl_set+closure expansion
897		%b_test_member_expression(Expr,El,_Set,_LocalState,_State,_WF) :-
898		% print('test member: '),print_bexpr(Expr),nl,fail.
899		b_test_member_expression(TElem,b(Set,Type,Info),LocalState,State,WF) :-
900	?	b_test_member_expression2(Set,Type,Info,TElem,LocalState,State,WF).
901
902		% new profiler
903		%:- use_module('../extensions/profiler/profiler.pl').
904		%:- use_module('../extensions/profiler/profiler_te.pl').
905		%:- enable_profiling(b_test_member_expression2/7).
906
907		% old profiler
908		%:- use_module(covsrc(hit_profiler)).
909
910		b_test_member_expression2(comprehension_set(Par,Cond),_Type,_Info,El,LocalState,State,WF) :-
911		% used to call in next clause below: b_generate_closure_if_necessary(Par,Cond,LocalState,State,SetValue,WF) /* will not expand closure */
912		/* optimized case for dealing with comprehension_set ; however, does not seem to buy anything over older version with b_generate_closure_if_necessary in test 1079 */
913		/* new version buys about 6 % for {x| x:1..400000 & x:{n|n >= 9000 & n<= 600000 & n mod 100 = 0}} (Sep 3 2014) */
914		set_up_typed_localstate(Par,ValueList,_TypedVals,LocalState,NewLocalState,positive),
915		!,
916		convert_list_into_pairs(ValueList,ElementVal),
917		b_compute_expression(El,LocalState,State,ElementVal,WF),
918		b_test_boolean_expression(Cond,NewLocalState,State,WF).
919		b_test_member_expression2(SymbolicSetConstant,_Type,_Info,El,LocalState,State,WF) :-
920		%hit_profiler:add_profile_hit(SymbolicSetConstant),
921		cst_in_boolean_type(SymbolicSetConstant,Module:Kernel_predicate),!, % two cases : string_set and integer_set
922		b_compute_expression(El,LocalState,State,ElValue,WF),
923		functor(KernelCall,Kernel_predicate,2),
924		arg(1,KernelCall,ElValue),
925		arg(2,KernelCall,WF),
926		% print_message(cst_in_boolean_type_call(KernelCall)),
927		kernel_call_predicate(KernelCall,Module,WF,SymbolicSetConstant). % should be member(... SymbolicSetConstant)
928		b_test_member_expression2(Expression,_Type,Info,El,LocalState,State,WF) :-
929		functor(Expression,BOP,2),
930		binary_in_boolean_type(BOP,Module:Kernel_predicate),!,
931		b_compute_expression(El,LocalState,State,ElValue,WF),
932		arg(1,Expression,Arg1),arg(2,Expression,Arg2),
933		(binary_in_definitely_true(BOP,ElValue)
934		-> % no need to compute arguments; unless required for WD:
935		check_well_defined(Arg1,LocalState,State,WF),
936		check_well_defined(Arg2,LocalState,State,WF)
937		; b_compute_expression(Arg1,LocalState,State,SV1,WF),
938	?	b_compute_expression(Arg2,LocalState,State,SV2,WF),
939		opt_push_wait_flag_call_stack_info(WF,b_operator_call(member,[ElValue,b_operator(BOP,[SV1,SV2])],Info),WF2),
940		% for constant profiling: we could catch partial/total_fun checks here translate:print_bexpr(El),nl,translate:print_bexpr(b(Expression,_Type,Info)),nl,nl,
941	?	binary_in_kernel_call(Module,Kernel_predicate,ElValue,SV1,SV2,WF2,Expression)
942		).
943		b_test_member_expression2(Expression,_Type,Info,El,LocalState,State,WF) :-
944		functor(Expression,UnOP,1),
945		unary_in_boolean_type(UnOP,Module:Kernel_predicate),!,
946		b_compute_expression(El,LocalState,State,ElValue,WF),
947		arg(1,Expression,Arg1),
948		(unary_in_definitely_true(UnOP,ElValue)
949		-> % no need to compute arguments; unless required for WD:
950		check_well_defined(Arg1,LocalState,State,WF)
951		; b_compute_expression(Arg1,LocalState,State,SV1,WF),
952		opt_push_wait_flag_call_stack_info(WF,b_operator_call(member,[ElValue,b_operator(UnOP,[SV1])],Info),WF2),
953	?	unary_in_kernel_call(Module,Kernel_predicate,ElValue,SV1,WF2,Expression)
954		).
955		b_test_member_expression2(SetExpression,Type,Info,El,LocalState,State,WF) :-
956	?	b_compute_expression2(SetExpression,Type,Info,LocalState,State,SetValue,WF),
957		(always_well_defined_or_disprover_mode(El)
958		-> SetValue \== [] % if we have the empty set: check_element will always fail
959		; true % we could check SetValue \== [] if find_abort_values=false ??
960		),
961	?	b_compute_expression(El,LocalState,State,Element,WF),
962		Span = El, % Info is quite often the empty list
963		(not_invertible(El) % then no sense in setting up member constraint f(...) : SetValue ;
964		% we cannot used the info anyway; but we could enumerate
965		-> % we wait until Element is fully known before doing the check
966		ground_value_check(Element,GrEl),
967		when(nonvar(GrEl),kernel_call_predicate_check_element_of_wf(Element,SetValue,WF,Span))
968	?	; kernel_call_predicate_check_element_of_wf(Element,SetValue,WF,Span)).
969
970		:- use_module(external_functions,[external_fun_can_be_inverted/1]).
971		not_invertible(b(E,_,_)) :- not_inv_aux(E).
972		not_inv_aux(external_function_call(FunName,_Args)) :- \+ external_fun_can_be_inverted(FunName).
973		% TO DO: capture other cases like function applications
974		% TO DO: also do this in b_interpreter_check ?
975		% TO DO: We should compute this information in ast_cleanup; e.g., what if we do STRING_TO_INT(s)+1 : SET
976
977		% TO DO: >>> 2:{x,v} --> special case for set_extension([b(identifier(x),integer,[nodeid(none)]),b(identifier(v),integer,[nodeid(none)])]) --> 2=x or 2=v --> evaluate [x,v] -> sort and then use list member (or should b_ast_cleanup do this) ?
978
979		:- use_module(kernel_lists,[not_element_of_list_wf/3]).
980		b_test_notmember_expression(set_extension(Ex),El,_Set,_,LocalState,State,WF) :- !,
981		b_compute_expressions(Ex,LocalState,State,ExValueList,WF),
982		b_compute_expression(El,LocalState,State,ElementVal,WF),
983		not_element_of_list_wf(ElementVal,ExValueList,WF).
984		b_test_notmember_expression(SymbolicSetCst,El,_Set,_,LocalState,State,WF) :-
985		kernel_mappings:cst_not_in_boolean_type(SymbolicSetCst,Module:Kernel_predicate),!,
986		b_compute_expression(El,LocalState,State,ElValue,WF),
987		functor(KernelCall,Kernel_predicate,1),
988		arg(1,KernelCall,ElValue),
989		% debug_print(cst_not_in_boolean_type(9,KernelCall)),
990		kernel_call_predicate(KernelCall,Module,WF,SymbolicSetCst).
991		b_test_notmember_expression(Expression,El,_Set,Info,LocalState,State,WF) :-
992		functor(Expression,BOP,2),
993		kernel_mappings:binary_not_in_boolean_type(BOP,Module:Kernel_predicate),!,
994		b_compute_expression(El,LocalState,State,ElValue,WF),
995		\+ binary_in_definitely_true(BOP,ElValue),
996		arg(1,Expression,Arg1),arg(2,Expression,Arg2),
997		b_compute_expression(Arg1,LocalState,State,SV1,WF),
998		b_compute_expression(Arg2,LocalState,State,SV2,WF),
999		% KernelCall =.. [Kernel_predicate,ElValue,SV1,SV2,WF],
1000		opt_push_wait_flag_call_stack_info(WF,b_operator_call(not_member,[ElValue,b_operator(BOP,[SV1,SV2])],Info),WF2),
1001	?	kernel_call_predicate3(Kernel_predicate,ElValue,SV1,SV2,Module,WF2,Expression).
1002		b_test_notmember_expression(Expression,El,_Set,Info,LocalState,State,WF) :-
1003		functor(Expression,UnOP,1),
1004		unary_not_in_boolean_type(UnOP,Module:Kernel_predicate),!,
1005		b_compute_expression(El,LocalState,State,ElValue,WF),
1006		\+ unary_in_definitely_true(UnOP,ElValue),
1007		arg(1,Expression,Arg1),
1008		b_compute_expression(Arg1,LocalState,State,SV1,WF),
1009		%KernelCall =.. [Kernel_predicate,ElValue,SV1,WF],
1010		%kernel_call_predicate(KernelCall,Module,WF,Expression).
1011		opt_push_wait_flag_call_stack_info(WF,b_operator_call(not_member,[ElValue,b_operator(UnOP,[SV1])],Info),WF2),
1012		kernel_call_predicate2(Kernel_predicate,ElValue,SV1,Module,WF2,Expression).
1013		b_test_notmember_expression(Expr,Elem,Set,_Info,LocalState,State,WF) :-
1014		(Expr=comprehension_set(Par,Cond)
1015		-> b_generate_closure_if_necessary(Par,Cond,LocalState,State,SetValue,WF) /* will not expand closure */
1016		; b_compute_expression(Set,LocalState,State,SetValue,WF)
1017		),
1018		(SetValue == []
1019		-> /* nothing can be member of empty set */
1020		check_well_defined(Elem,LocalState,State,WF)
1021		% we could disable this check if find_abort_values=true
1022		; b_compute_expression(Elem,LocalState,State,ElemValue,WF),
1023		%kernel_call_predicate2(not_element_of_wf,ElemValue,SetValue,kernel_objects,WF,Expr)
1024		%kernel_call_predicate(not_element_of_wf(ElemValue,SetValue,WF),kernel_objects,WF,Expr)
1025		kernel_call_predicate_not_element_of_wf(ElemValue,SetValue,WF)
1026		).
1027
1028		:- block block_test_implication(?,?,?,?,?,-).
1029		block_test_implication(LHS,RHS,LocalState,State,WF,_WF2) :-
1030	?	b_test_inner_boolean_expression(LHS,LocalState,State,WF),
1031		b_test_inner_boolean_expression(RHS,LocalState,State,WF).
1032		block_test_implication(LHS,_RHS,LocalState,State,WF,_WF2) :-
1033	?	b_not_test_inner_boolean_expression(LHS,LocalState,State,WF).
1034
1035
1036		b_test_equivalence(LHS,RHS,LocalState,State,WF,Ai,Ao) :-
1037		copy_wf_start(WF,equivalence,CWF),
1038	?	if(b_check_boolean_expression(LHS,LocalState,State,CWF,PredRes,Ai,Aii),
1039	?	(b_check_test_equivalence(PredRes,LHS,RHS,LocalState,State,CWF,Aii,Ao),
1040		copy_wf_finish(WF,CWF)),
1041		(% check LHS fails, We could check if RHS can be checked with b_check_boolean_expression
1042		Ai=Ao, get_binary_choice_wait_flag(equivalence,WF,WF2),
1043		b_enum_test_equivalence(LHS,RHS,LocalState,State,WF,WF2,Ai))).
1044		b_not_test_equivalence(LHS,RHS,LocalState,State,WF,Ai,Ao) :-
1045		copy_wf_start(WF,not_equivalence,CWF),
1046		if(b_check_boolean_expression(LHS,LocalState,State,CWF,PredRes,Ai,Aii),
1047		(negate(PredRes,NegPredRes), % from bool_pred
1048		b_check_test_equivalence(NegPredRes,LHS,RHS,LocalState,State,CWF,Aii,Ao),
1049		copy_wf_finish(WF,CWF)),
1050		(% check LHS fails, We could check if RHS can be checked with b_check_boolean_expression
1051		Ai=Ao, get_binary_choice_wait_flag(not_equivalence,WF,WF2),
1052		b_enum_not_test_equivalence(LHS,RHS,LocalState,State,WF,WF2,Ai))).
1053		b_check_test_equivalence(PredRes,LHS,RHS,LocalState,State,WF,Aii,Ao) :-
1054		% print('checking <=> '), print_bexpr(LHS), print(' '), print(PredRes),nl,
1055	?	(var(PredRes),b_check_boolean_expression(RHS,LocalState,State,WF,PredRes2,Aii,Ao) % TO DO <---- REPLACE CUT
1056		-> /* also propagate from right to left */
1057	?	equiv_bidrectional_test_boolean_expression(PredRes,PredRes2,LHS,RHS,LocalState,State,WF)
1058		; Aii=Ao,
1059	?	equiv_test_boolean_expression(PredRes,pred_true,RHS,LocalState,State,WF,Aii)
1060		). % should we also add a binary choice flag ?? what about a=2 <=> b/=3 ??
1061
1062		:- block b_enum_test_equivalence(?,?,?,?,?,-,?).
1063		b_enum_test_equivalence(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1064		b_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii), % TO DO: we could call b_test_inner_boolean_expression with Ai
1065		b_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1066		b_enum_test_equivalence(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1067		b_not_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1068		b_not_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1069
1070		%enumerate_bool(X,WF) :- !.
1071		enumerate_bool(X,Prio,WF) :- (nonvar(X) -> true /* already set */
1072		; get_wait_flag0(WF,WF0),
1073		enumerate_bool0(X,Prio,WF,WF0)).
1074
1075		:- block enumerate_bool0(?,?,?,-).
1076		enumerate_bool0(X,Prio,WF,_) :- (nonvar(X) -> true /* already set */
1077		; %print(enum_bool(X)), translate:print_bexpr(LHS),nl,
1078		% get_binary_choice_wait_flag(enumerate_bool,WF,WF2),
1079		get_wait_flag(Prio,enumerate_bool,WF,WF2), % what priority should we use ?? give time for other enumerators to decide the lhs of the disjunct; actions_cbtc is slower to setup with low priority
1080		enumerate_bool_aux(X,WF2)).
1081		:- block enumerate_bool_aux(-,-).
1082		%enumerate_bool_aux(P,WF) :- var(P),print(forcing_bool(P,WF)),nl,fail. %
1083		enumerate_bool_aux(pred_true,_).
1084		enumerate_bool_aux(pred_false,_).
1085
1086		:- block b_test_disjunction(?,?,?,?,?,-,?).
1087		b_test_disjunction(LHS,_RHS,LocalState,State,WF,_WF2,Ai) :-
1088	?	b_test_boolean_expression(LHS,LocalState,State,WF,Ai,_).
1089		b_test_disjunction(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1090	?	b_not_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1091	?	b_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1092
1093		:- block b_not_test_conjunction(?,?,?,?,?,-,?).
1094		b_not_test_conjunction(LHS,_RHS,LocalState,State,WF,_WF2,Ai) :-
1095	?	b_not_test_boolean_expression(LHS,LocalState,State,WF,Ai,_).
1096		b_not_test_conjunction(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1097	?	b_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1098	?	b_not_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1099
1100		:- block b_enum_not_test_equivalence(?,?,?,?,?,-,?).
1101		b_enum_not_test_equivalence(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1102		b_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii), % we could call b_test_inner_boolean_expression with Ai
1103		b_not_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1104		b_enum_not_test_equivalence(LHS,RHS,LocalState,State,WF,_WF2,Ai) :-
1105		b_not_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1106		b_test_boolean_expression(RHS,LocalState,State,WF,Aii,_).
1107
1108
1109
1110		/* --------------------------------------*/
1111		/* b_not_test_boolean_expression */
1112		/* --------------------------------------*/
1113
1114		b_not_test_list_of_boolean_expression([],_,_,_WF).
1115		b_not_test_list_of_boolean_expression([B1|T],LS,S,WF) :-
1116		b_not_test_boolean_expression(B1,LS,S,WF),
1117		b_not_test_list_of_boolean_expression(T,LS,S,WF).
1118
1119		:- assert_pre(b_interpreter:b_not_test_boolean_expression_cs(E,LS,S,_,_),
1120		(bsyntaxtree:check_if_typed_predicate(E),type_check(LS,store),type_check(S,store))).
1121		:- assert_post(b_interpreter:b_not_test_boolean_expression_cs(_,_,_,_,_), true).
1122
1123
1124		% a version where we can provide an initial call stack entry for context
1125		b_not_test_boolean_expression_cs(E,LS,S,PredKind,Nr) :-
1126		init_wait_flags_cs(E,PredKind,Nr,b_not_test_boolean_expression_cs,WF), % TODO: we could register negation info
1127		% TO DO: call b_trace_test_components ?
1128	?	b_not_test_boolean_expression(E,LS,S,WF),
1129		ground_wait_flags(WF).
1130
1131		b_not_test_boolean_expression(E,LS,S,WF) :-
1132	?	empty_avl(Ai), b_not_test_boolean_expression(E,LS,S,WF,Ai,_).
1133
1134		:- assert_pre(b_interpreter:b_not_test_boolean_expression(E,LS,S,WF),
1135		(type_check(E,boolean_expression),type_check(LS,store),type_check(S,store), type_check(WF,wait_flag))).
1136		:- assert_post(b_interpreter:b_not_test_boolean_expression(_,_,_,_), true).
1137
1138		:- if(environ(prob_debug_watch_flag,true)).
1139		b_not_test_boolean_expression(b(Expr,_,Infos),LS,S,WF,Ai,Ao) :- !,
1140		(waitflag0_is_set(WF)
1141		-> debug:watch(400,b_interpreter:b_not_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao))
1142		; debug:watch_det(400,b_interpreter:b_not_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao)) ).
1143		:- else.
1144		b_not_test_boolean_expression(b(Expr,Type,Infos),LS,S,WF,Ai,Ao) :- !,
1145		(preference(smt_supported_interpreter,true)
1146		-> b_not_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao),create_negation(b(Expr,Type,Infos),Neg),
1147		get_wait_flag1(smt_call,WF,BeforeEnumWF),
1148		gensym:gensym(smt_assertion_name,Symbol),
1149		smt_add_predicate(BeforeEnumWF,Neg,LS,S,Symbol)
1150	?	; b_not_test_boolean_expression2(Expr,Infos,LS,S,WF,Ai,Ao)).
1151		:- endif.
1152		b_not_test_boolean_expression(E,LS,S,WF,Ai,Ao) :-
1153		add_internal_error('Boolean (not) expression not properly wrapped: ',
1154		b_not_test_boolean_expression(E,LS,S,WF,Ai,Ao)),
1155		b_not_test_boolean_expression2(E,[],LS,S,WF,Ai,Ao).
1156
1157		b_not_test_boolean_expression2(truth,_,_,_,_WF,_Ai,_Ao) :- !,fail.
1158		b_not_test_boolean_expression2(falsity,_,_,_,_WF,Ai,Ao) :- !,Ai=Ao. % NOT COVERED (2)
1159		b_not_test_boolean_expression2(negation(BExpr),_,LocalState,State,WF,Ai,Ao) :- !,
1160		b_test_boolean_expression(BExpr,LocalState,State,WF,Ai,Ao).
1161		% following makes test 349 fail:
1162		%b_not_test_boolean_expression2(conjunct(LHS,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,
1163		% nl, print(' NOT: '),translate:print_bexpr(b(conjunct(LHS,RHS),pred,Infos)),nl,
1164		% create_negation(LHS,NegLHS), % TO DO: avoid this construction by generalising code for disjunct
1165		% create_negation(RHS,NegRHS),
1166		% b_test_boolean_expression2(disjunct(NegLHS,NegRHS),Infos,LocalState,State,WF,Ai,Ao).
1167		b_not_test_boolean_expression2(conjunct(LHS,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,
1168		b(conjunct(LHS,RHS),pred,Infos) = Conj,
1169		copy_wf_start(WF,not_conjunct,CWF),
1170	?	if(b_check_boolean_expression(Conj,LocalState,State,CWF,PredRes,Ai,Ao),
1171		(PredRes=pred_false,
1172	?	copy_wf_finish(WF,CWF)
1173		),
1174	?	if(b_check_boolean_expression(LHS,LocalState,State,CWF,LHSPredRes,Ai,Ao), % some redundant work with call above: TODO: avoid !
1175		(copy_wf_finish(WF,CWF),
1176		get_last_wait_flag(not_conjunct_rhs,WF,WF2), % before starting to enumerate infinite types: better try both possibilities:
1177	?	b_not_test_conjunction_rhs(LHSPredRes,RHS,LocalState,State,WF,Ai,WF2)
1178		),
1179		(Ai=Ao,
1180		get_priority_of_boolean_expression2(disjunct(LHS,RHS),StartPrio),
1181		%get_wait_flag(Prio,not_conjunct,WF,WF2),
1182		get_binary_choice_wait_flag_exp_backoff(StartPrio,not_conjunct,WF,WF2),
1183		% TO DO: we could check if LHS or RHS are registered in Ai as pred_true/pred_false ??
1184		b_not_test_conjunction(LHS,RHS,LocalState,State,WF,WF2,Ai))
1185		)
1186		).
1187
1188		b_not_test_boolean_expression2(implication(LHS,RHS),_,LocalState,State,WF,Ai,Ao) :- !,
1189		b_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1190		b_not_test_boolean_expression(RHS,LocalState,State,WF,Aii,Ao).
1191		b_not_test_boolean_expression2(equivalence(LHS,RHS),_,LocalState,State,WF,Ai,Ao) :- !,
1192		b_not_test_equivalence(LHS,RHS,LocalState,State,WF,Ai,Ao).
1193		b_not_test_boolean_expression2(disjunct(LHS,RHS),_,LocalState,State,WF,Ai,Ao) :- !,
1194		b_not_test_boolean_expression(LHS,LocalState,State,WF,Ai,Aii),
1195		b_not_test_boolean_expression(RHS,LocalState,State,WF,Aii,Ao).
1196		b_not_test_boolean_expression2(lazy_let_pred(Id,AssignmentExpr,Expr),_I,LocalState,State,WF,Ai,Ao) :- !,
1197		add_lazy_let_id_and_expression(Id,AssignmentExpr,LocalState,State,NewLocalState,WF,Ai),
1198		b_not_test_boolean_expression(Expr,NewLocalState,State,WF,Ai,Ao). % we could use Ai,Ao version as lazy lets never interfere with each other and never invalidate existing expressions
1199		b_not_test_boolean_expression2(lazy_lookup_pred(Id),_Info,LocalState,_State,WF,Ai,Ao) :- !, Ai=Ao,
1200		lookup_value_for_existing_id_wf(Id,LocalState,(Trigger,Value),WF), % should normally only occur in LocalState; value introduced by lazy_let
1201		(Trigger,Value) = (pred_true,pred_false). % force evaluation
1202		b_not_test_boolean_expression2(value(PredVal),_Info,_LocalState,_State,_WF,Ai,Ao) :- !, % this can occur when lazy_lookup_pred gets compiled by b_compiler
1203		is_pred_false(PredVal),Ai=Ao.
1204		b_not_test_boolean_expression2(Expr,Info,LocalState,State,WF,Ai,Ao) :-
1205		% TO DO: we could put some of the operators into the Ai store (comparison operators)
1206	?	b_not_test_atomic_boolean_expression2(Expr,Info,LocalState,State,WF,Ai,Ao).
1207
1208		% Other boolean expressions, not involving boolean connectives
1209		b_not_test_atomic_boolean_expression2(exists(Parameters,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,
1210		/* #ID.(RHS) */
1211		Ai=Ao,
1212	?	b_not_test_exists(Parameters,RHS,Infos,LocalState,State,compile,WF).
1213		b_not_test_atomic_boolean_expression2(forall(Parameters,LHS,RHS),Infos,LocalState,State,WF,Ai,Ao) :- !,
1214		/* !ID.(LHS => RHS) */
1215		Ai=Ao,
1216		safe_create_texpr(negation(RHS),pred,Negation),
1217		conjunct_predicates_with_pos_info(LHS,Negation,Condition),
1218		% conjunct_predicates merges the used_ids Info in Condition
1219	?	b_test_exists(Parameters,Condition,Infos,LocalState,State,WF).
1220		/* TODO(DP, 2.8.2008): Extension for Z: a let-statement as predicate */
1221		b_not_test_atomic_boolean_expression2(let_predicate(Ids,AssignmentExprs,Pred),Infos,LocalState,State,WF,Ai,Ao) :-
1222		!,Ai=Ao, % any expression inside the LET cannot be safely reused
1223	?	set_up_localstate_for_let(Ids,ParaValues,AssignmentExprs,LocalState,State,LetState,WF),
1224		opt_push_wait_flag_call_stack_quantifier_info(WF,let_quantifier,Ids,ParaValues,Infos,WF2),
1225	?	b_not_test_boolean_expression(Pred,LetState,State,WF2). % NOT COVERED (10)
1226		/* TODO(DP, 2.8.2008): */
1227		b_not_test_atomic_boolean_expression2(freetype_case(Freetype,Case,Expr),_,LocalState,State,WF,Ai,Ao) :-
1228		!,Ai=Ao,b_compute_expression(Expr,LocalState,State,freeval(Freetype,RealCase,_),WF),
1229		dif(RealCase,Case). % NOT COVERED (11)
1230		b_not_test_atomic_boolean_expression2(finite(SetExpr),_,LocalState,State,WF,Ai,Ao) :-
1231		!, Ai=Ao,b_compute_expression(SetExpr,LocalState,State,Value,WF),
1232		kernel_call_predicate(is_infinite_set_wf(Value,WF),kernel_objects,WF,finite(SetExpr)).
1233		/* Extension for Kodkod */
1234		b_not_test_atomic_boolean_expression2(kodkod(ProblemId,_),_,LocalState,State,WF,Ai,Ao) :-
1235		!,Ai=Ao,get_wait_flag1(kodkod_negative_call,WF,WF0),
1236		kodkod_request(ProblemId,neg,LocalState,State,WF0). % NOT COVERED (12)
1237		b_not_test_atomic_boolean_expression2(partition(LHS,RHS),Info,LocalState,State,WF,Ai,Ao) :- !,
1238		b_interpreter_check:register_predicate(partition(LHS,RHS),Info,pred_false,Reused,Ai,Ao),
1239		(Reused==true -> true
1240		; b_compute_expression(LHS,LocalState,State,SV1,WF),
1241		l_compute_expression(RHS,LocalState,State,SV2,WF), % RHS is Prolog list of expressions
1242		kernel_call_predicate(not_partition_wf(SV1,SV2,WF),kernel_objects,WF,partition(LHS,RHS))
1243		).
1244		b_not_test_atomic_boolean_expression2(external_pred_call(FunName,Args),Info,LocalState,State,WF,Ai,Ao) :-
1245		!, Ai=Ao,
1246		(do_not_evaluate_args(FunName) -> EvaluatedArgs=[]
1247		; b_compute_expressions(Args, LocalState,State, EvaluatedArgs, WF)),
1248		push_wait_flag_call_stack_info(WF,external_call(FunName,EvaluatedArgs,Info),WF2),
1249		call_external_predicate(FunName,Args,EvaluatedArgs,LocalState,State,pred_false,Info,WF2).
1250		b_not_test_atomic_boolean_expression2(Pred,Info,LocalState,State,WF,Ai,Ao) :-
1251		b_interpreter_check:register_predicate(Pred,Info,pred_false,Reused,Ai,Ao),
1252		(Reused==true
1253		-> %% print('REUSED (not): '), translate:print_bexpr(Pred),nl,
1254		true
1255	?	; b_not_test_atomic_boolean_expression3(Pred,Info,LocalState,State,WF)).
1256		b_not_test_atomic_boolean_expression3(Expression,Info,LocalState,State,WF) :-
1257		functor(Expression,BOP,2),
1258	?	kernel_mappings:negate_binary_boolean_operator(BOP,NBOP),
1259		arg(1,Expression,Arg1),arg(2,Expression,Arg2),!,
1260		NExpression =.. [NBOP,Arg1,Arg2],
1261	?	b_test_atomic_boolean_expression2(NExpression,Info,LocalState,State,WF).
1262		b_not_test_atomic_boolean_expression3(Expression,Info,LocalState,State,WF) :-
1263		functor(Expression,BOP,2),
1264		kernel_mappings:negate_binary_boolean_operator_swap(BOP,NBOP),
1265		arg(1,Expression,Arg1),arg(2,Expression,Arg2),!,
1266		NExpression =.. [NBOP,Arg2,Arg1],
1267		b_test_atomic_boolean_expression2(NExpression,Info,LocalState,State,WF).
1268		b_not_test_atomic_boolean_expression3(E,_,_,_,_WF) :-
1269		add_internal_error('Uncovered boolean expression (not): ',E),
1270		print_functor(E),nl,fail.
1271
1272
1273		% test RHS of not-conjunction depending on outcome of LHS
1274		:- block b_not_test_conjunction_rhs(-,?,?,?,?,?,-).
1275		b_not_test_conjunction_rhs(pred_false,_RHS,_LocalState,_State,_WF,_Ai,_LWF).
1276		b_not_test_conjunction_rhs(pred_true,RHS,LocalState,State,WF,Ai,_LWF) :-
1277	?	b_not_test_boolean_expression(RHS,LocalState,State,WF,Ai,_).
1278
1279		/* -----------------------------*/
1280		/* b_compute_expression */
1281		/* -----------------------------*/
1282
1283
1284
1285		:- assert_must_succeed((b_interpreter:b_compute_expression(b(pow_subset(
1286		b(identifier(nm),set(integer),[])),set(set(integer)),[]),
1287		[], [bind(nm,[])],R,_WF),
1288		nonvar(R), custom_explicit_sets:expand_custom_set_to_list(R,[[]]))).
1289		:- assert_must_succeed((b_interpreter:b_compute_expression(b(pow_subset(
1290		b(identifier(nm),set(boolean),[])),set(set(boolean)),[]),[],
1291		[bind(nm,[pred_false /* bool_false */])],R,_WF),
1292		nonvar(R), custom_explicit_sets:expand_custom_set_to_list(R,ER),
1293		kernel_objects:equal_object(ER,[[pred_false /* bool_false */],[]]))).
1294
1295		:- assert_pre(b_interpreter:b_compute_expression(Exp,LS,State,_Val,WF),
1296		(nonvar(Exp),
1297		bsyntaxtree:check_if_typed_expression(Exp),
1298		type_check(LS,store),type_check(State,store), type_check(WF,wait_flag))).
1299		:- assert_post(b_interpreter:b_compute_expression(_E,_LS,_State,Val,WF),
1300		(b_interpreter:value_type(Val), type_check(WF,wait_flag))). %, nonvar(Val)
1301
1302		b_compute_expression_nowf(E,LS,S,R) :-
1303		b_compute_expression_nowf(E,LS,S,R,none,0).
1304
1305		b_compute_expression_nowf(E,LS,S,R,FormulaKind,Nr) :-
1306		get_texpr_info(E,Info),
1307	?	b_compute_expression_nowf(E,LS,S,R,FormulaKind,Nr,Info).
1308		b_compute_expression_nowf(E,LS,S,R,FormulaKind,Nr,Span) :-
1309	?	b_compute_expression_no_wf8(E,LS,S,R,FormulaKind,Nr,default,Span).
1310		% a variation where we tell ProB to expect non-symbolic / explicit values
1311		b_compute_explicit_epression_no_wf(E,LS,S,R,FormulaKind,Nr) :-
1312		get_texpr_info(E,Info),
1313	?	b_compute_explicit_epression_no_wf(E,LS,S,R,FormulaKind,Nr,Info).
1314		b_compute_explicit_epression_no_wf(E,LS,S,R,FormulaKind,Nr,Span) :-
1315	?	b_compute_expression_no_wf8(E,LS,S,R,FormulaKind,Nr,expect_explicit_value,Span).
1316		b_compute_expression_no_wf8(E,LS,S,R,FormulaKind,Nr,Expect,Span) :-
1317		%add_message(b_compute_expression,'Called Version wo WFLAGS: ', b_compute_expression(E,LS,S,R)),
1318		(Expect=expect_explicit_value -> WFInfos = [expect_explicit_value] ; WFInfos = []),
1319		(FormulaKind = none -> init_wait_flags(WF,WFInfos)
1320		; CallStackEntry = prob_command_context(eval_expr_command(FormulaKind,Nr),Span),
1321		init_wait_flags_and_push_call_stack(no_wf_available,CallStackEntry,WFInfos,WF)
1322		),
1323	?	b_compute_expression(E,LS,S,R,WF),
1324	?	ground_wait_flags(WF), % this will add abort errors and fail before enumerating the result:
1325		init_wait_flags(WF2,[b_compute_expression_nowf2]),
1326		get_texpr_type(E,Type),
1327		b_enumerate:b_tighter_enumerate_single_value(R,Type,Span,b_compute_expression_nowf,WF2), %should rarely be necessary
1328		% a non-ground result only occurs when WD error appears and in this case ground_wait_flags will fail after
1329		% adding the abort error (and thus no value is returned)
1330		% exceptions are test 1066 with a complicated set comprehension used in a function application
1331		% test 1861 relies on two phase enumeration
1332		ground_wait_flags(WF2).
1333
1334		l_compute_expression([],_LS,_S,[],_WF).
1335		l_compute_expression([H|T],LS,S,[CH|CT],WF) :-
1336		b_compute_expression(H,LS,S,CH,WF),
1337		l_compute_expression(T,LS,S,CT,WF).
1338
1339		:- if(environ(prob_debug_watch_flag,true)).
1340		b_compute_expressiond(b(Expr,Type,Info),LS,S,R,WF) :- !,
1341		((ground(Type), Type \== pred, Type \== subst) -> true
1342		; add_error_wf(b_compute_expression,'Expression has illegal type: ',b(Expr,Type,Info),WF)),
1343		check_value(R,b(Expr,Type,Info)),
1344		b_compute_expression2(Expr,Type,Info,LS,S,R,WF).
1345		:- block check_value(-,?).
1346		check_value(pred_true,_) :- !. check_value(pred_false,_) :- !.
1347		check_value(string(_),_) :- !.
1348		check_value([],_) :- !.
1349		check_value([H|T],E) :- !, check_value(H,E), check_value(T,E).
1350		check_value((A,B),E) :- !, check_value(A,E), check_value(B,E).
1351		check_value(fd(N,T),E) :- !, (nonvar(T) -> check_fd(N,T,E) ; check_err(fd(N,T),E)).
1352		check_value(global_set(GS),E) :- !,(nonvar(GS) -> true ; check_err(global_set(GS),E)).
1353		check_value(avl_set(AS),E) :- !,((nonvar(AS),AS=node(_,_,_,_,_)) -> true ; check_err(global_set(AS),E)).
1354		check_value(int(X),E) :- !,check_int(X,E).
1355		check_value(closure(P,T,B),E) :- !,
1356		(ground(P),ground(T),nonvar(B)
1357		-> (same_length(P,T) -> bsyntaxtree:check_ast(B) ; check_err(closure_not_same_length(P,T)))
1358		; check_err(closure(P,T,B),E)).
1359		check_value(rec(_),_) :- !. %TODO: check
1360		check_value(X,E) :- check_err(uncovered(X),E).
1361		% TO DO: add records + more thorough checking of global_set and closures and avl_sets
1362		:- block check_int(-,?).
1363		check_int(X,E) :- (number(X) -> true ; check_err(int(X),E)).
1364		:- block check_fd(-,?,?).
1365		check_fd(X,T,E) :- (number(X),b_get_fd_type_bounds(T,Low,Up),X>=Low,X=<Up -> true ; check_err(fd(X,T),E)).
1366
1367		check_err(V,E) :- add_internal_error('Illegal value when computing expression: ',V:E).
1368		b_compute_expression(E,LS,S,R,WF) :- !,
1369		(waitflag0_is_set(WF)
1370		-> debug:watch(100,b_interpreter:b_compute_expressiond(E,LS,S,R,WF))
1371		; debug:watch_det(100,b_interpreter:b_compute_expressiond(E,LS,S,R,WF))).
1372		:- else.
1373		b_compute_expression(b(Expr,Type,Info),LS,S,R,WF) :- !,
1374		((ground(Type), Type \== pred, Type \== subst) -> true
1375		; Type==pred -> add_internal_error_wf(b_interpreter,'Expected expression, not predicate: ',b(Expr,Type,Info),Info,WF)
1376		; Type==subst -> add_internal_error_wf(b_interpreter,'Expected expression, not substitution: ',b(Expr,Type,Info),Info,WF)
1377		; add_internal_error_wf(b_interpreter,'Expression has non-ground type: ',b(Expr,Type,Info),Info,WF)
1378		),
1379	?	b_compute_expression2(Expr,Type,Info,LS,S,R,WF).
1380		:- endif.
1381		b_compute_expression(Expr,LS,S,R,WF) :-
1382		add_internal_error('Expression not properly wrapped: ',b_compute_expression(Expr,LS,S,R,WF)),
1383		b_compute_expression2(Expr,unknown,[],LS,S,R,WF).
1384
1385
1386		:- use_module(bsyntaxtree,[get_texpr_set_type/2]).
1387
1388		%:- use_module(b_global_sets,[b_type2_set/2]).
1389		%b_compute_expression2(V,T,I,LS,S,R,_WF) :- nonvar(R), print('result_instantiated: '(R:V)),nl,fail.
1390	?	b_compute_expression2(value(Val),_T,_I,_LS,_S,V,WF) :- !, equal_object_wf(Val,V,WF). %Val=V.
1391		b_compute_expression2(boolean_true,_T,_I,_LState,_State,Res,_WF) :- !, Res = pred_true /* bool_true */. % for simple types we can use ordinary unification
1392		b_compute_expression2(boolean_false,_T,_I,_LState,_State,Res,_WF) :- !, Res = pred_false /* bool_false */.
1393		b_compute_expression2(integer_set(NSET),_T,_I,_LState,_State,Res,WF) :- !, equal_object_wf(Res,global_set(NSET),WF). %Res = global_set(NSET).
1394		b_compute_expression2(bool_set,_T,_I,_LState,_State,Res,WF) :- !, % b_type2_set(bool,Res).
1395		equal_object_wf(Res,avl_set(node(pred_false,true,1,empty,node(pred_true,true,0,empty,empty))),WF).
1396		% was equal_object(Res,[pred_true /* bool_true */,pred_false /* bool_false */]) % changing this to avl used to break test 800 Bosch Deadlock v9; probably because of identity closure detection instantiation
1397		b_compute_expression2(float_set,_T,_I,_LState,_State,Res,WF) :- !, equal_object_wf(Res,global_set('FLOAT'),WF).
1398		b_compute_expression2(real_set,_T,_I,_LState,_State,Res,WF) :- !, equal_object_wf(Res,global_set('REAL'),WF).
1399		b_compute_expression2(string_set,_T,_I,_LState,_State,Res,WF) :- !, equal_object_wf(Res,global_set('STRING'),WF).
1400		% was all_strings(Res). %% NOT COVERED (6)
1401		b_compute_expression2(string(S),_T,_I,_LState,_State,Res,_WF) :- !,
1402		% TODO(ML,26.8.2008): Check if we should use a different functor for syntax tree vs data
1403		Res = string(S).
1404		b_compute_expression2(typeset,Type,_I,_LState,_State,Res,WF) :- !,
1405		is_set_type(Type,ElType), % we could generate global_set('STRING'),... for certain types
1406		equal_object_wf(Res,closure('_zzzz_unary',[ElType],b(truth,pred,[])),WF).
1407		b_compute_expression2(empty_set,_T,_I,_LState,_State,Res,_WF) :- !, empty_set(Res).
1408		b_compute_expression2(empty_sequence,_T,_I,_LState,_State,Res,_WF) :- !, empty_sequence(Res).
1409		b_compute_expression2(event_b_identity,EType,_I,_LState,_State,Res,WF) :-
1410		get_set_type(EType,couple(Type,Type)),!,
1411		event_b_identity_for_type(Type,Res,WF).
1412		b_compute_expression2(integer(Val),_T,_I,_LocalState,_State,Res,_WF) :- !, Res = int(Val).
1413		b_compute_expression2(max_int,_T,_I,_LS,_S,Res,_WF) :-
1414		preferences:get_preference(maxint,CVal),!, Res = int(CVal).
1415		b_compute_expression2(min_int,_T,_I,_LS,_S,Res,_WF) :-
1416		preferences:get_preference(minint,CVal),!, Res = int(CVal).
1417		b_compute_expression2(identifier(Id),Type,Info,LocalState,State,Res,WF) :- !,
1418		lookup_value_in_store_and_global_sets_wf(Id,Type,LocalState,State,Value,Info,WF),
1419		equal_object_wf(Res,Value,WF).
1420		b_compute_expression2(lazy_lookup_expr(Id),_Type,_Info,LocalState,_State,Res,WF) :- !,
1421		lookup_value_for_existing_id_wf(Id,LocalState,(Trigger,Value),WF), % should normally only occur in LocalState; value introduced by lazy_let
1422		Trigger = pred_true, % force evaluation
1423		equal_object_wf(Res,Value,WF).
1424		b_compute_expression2(lazy_let_expr(Id,AssignmentExpr,Expr),_T,_I,LocalState,State,Value,WF) :-
1425		!,
1426		add_lazy_let_id_and_expression(Id,AssignmentExpr,LocalState,State,NewLocalState,WF),
1427		%Trigger = pred_true, % expressions cannot be delayed !? (TO DO: more refined check)
1428		%block_lazy_compute_expression(Trigger,_,AssignmentExpr,LocalState,State,IdValue,WF,Ai),
1429		b_compute_expression(Expr,NewLocalState,State,Value,WF).
1430		b_compute_expression2(real(Atom),_T,_I,_LocalState,_State,Res,_WF) :- !, construct_real(Atom,Res).
1431		b_compute_expression2(rec(Fields),_T,_I,LocalState,State,Record,WF) :- !,
1432	?	l_compute_field(Fields,LocalState,State,FieldValues,WF),
1433	?	construct_record_wf(FieldValues,Record,WF).
1434		b_compute_expression2(record_field(RecEx,Name),_T,_I,LocalState,State,Value,WF) :- !,
1435	?	b_compute_expression(RecEx,LocalState,State,RecValue,WF),
1436		access_record_wf(RecValue,Name,Value,WF).
1437		b_compute_expression2(freetype_set(Id),_T,_I,_LState,_State,Val,_WF) :- !, Val=freetype(Id). %% NOT COVERED (17)
1438		b_compute_expression2(function(Function,FunArg),Type,Info,LocalState,State,Res,WF) :- !,
1439	?	b_compute_expression_function(Function,FunArg,Type,Info,LocalState,State,Res,WF).
1440		b_compute_expression2(card(b(Arg1,Type,Info)),integer,OuterInfo,LocalState,State,Card,WF) :- !,
1441	?	b_compute_card(Arg1,Type,Info,OuterInfo,LocalState,State,Card,WF).
1442		b_compute_expression2(max(b(Arg1,Type,Info)),integer,_I,LocalState,State,Max,WF) :- !,
1443		b_compute_max(Arg1,Type,Info,LocalState,State,Max,WF).
1444		b_compute_expression2(min(b(Arg1,Type,Info)),integer,_I,LocalState,State,Min,WF) :- !,
1445	?	b_compute_min(Arg1,Type,Info,LocalState,State,Min,WF).
1446		b_compute_expression2(set_extension(Ex),Type,_I,LocalState,State,Res,WF) :- !,
1447	?	b_compute_expressions(Ex,LocalState,State,ExValue,WF),
1448		kernel_call(b_interpreter:convert_list_of_expressions_into_set_wf(ExValue,ValueSet,Type,WF),ExValue,WF, set_extension(Ex)),
1449	?	equal_object_wf(Res,ValueSet,WF).
1450		%kernel_call_convert_list_of_expressions_into_set_wf(ExValue,ValueSet,Type, WF).
1451		%b_compute_expression('ListTermes'(ListOfEx),LocalState,State,ValueSet,WF) :- !,
1452		% /* convert list of expressions of CASE statement into set of elements */
1453		% b_compute_expression(ListOfEx,LocalState,State,Value,WF),
1454		% init_wait_flags(WF),convert_list_of_expressions_into_set_wf(Value,ValueSet,set(any),WF),ground_wait_flags(WF).
1455		b_compute_expression2(sequence_extension(Ex),_T,_I,LocalState,State,ValueSeq,WF) :- !,
1456	?	b_compute_expressions(Ex,LocalState,State,Value,WF),
1457		kernel_call(b_interpreter:convert_list_of_expressions_into_sequence(Value,ValueSeq),Value,WF,sequence_extension(Ex)).
1458		b_compute_expression2(convert_bool(PRED),_T,_I,LocalState,State,Val,WF) :- !, /* B bool(.) operator */
1459		b_convert_bool(PRED,LocalState,State,WF,Val).
1460		b_compute_expression2(couple(El1,El2),_T,_I,LocalState,State,Result,WF) :- !, Result = (Val1,Val2),
1461	?	b_compute_expression(El1,LocalState,State,Val1,WF),
1462	?	b_compute_expression(El2,LocalState,State,Val2,WF).
1463		b_compute_expression2(comprehension_set(Parameters,Condition),_T,Info,LocalState,State,Result,WF) :- !,
1464	?	b_compute_comprehension_set(Parameters,Condition,Info,LocalState,State,Result,WF).
1465		b_compute_expression2(recursive_let(TId,TSet),OrigType,OrigInfo,LocalState,State,Result,WF) :- !,
1466		% LET TId = TSet in TSet
1467		( get_texpr_expr(TSet,comprehension_set(Parameters,Condition)) ->
1468		true % if the argument TSet is a comprehension set,
1469		% we just add a recursive parameter
1470		; get_texpr_set_type(TSet,Type) ->
1471		% if not, we construct a new comprehension set {x | x:TSet}
1472		unique_typed_id("_tmparg_",Type,TArg),
1473		Parameters=[TArg],
1474		safe_create_texpr(member(TArg,TSet),pred,Condition)
1475		;
1476		add_internal_error('Expected set as argument to recursive_let',
1477		b_compute_expression2(recursive_let(TId,TSet),OrigType,OrigInfo,LocalState,State,Result,WF)),fail
1478		),
1479		% Generate closure where the references to the recursion are kept
1480		% add recursion ID to parameters to prevent removal of references during compilation
1481		generate_recursive_closure(TId,recursion,[TId|Parameters],Condition,LocalState,State,Closure1,WF),
1482		% add_message(b_interpreter,'Recursive Let for: ',TId,TId),
1483		% remove recursion ID from parameters after compilation
1484		Closure1=closure([_|P],[_|T],Cond),RClosure=closure(P,T,Cond),
1485		% Generate closure where the references to the recursion are kept
1486		generate_recursive_closure(TId,RClosure,Parameters,Condition,LocalState,State,Result,WF).
1487		b_compute_expression2(general_sum(Ids,Condition,Expression),Type,Info,LocalState,State,SumResult,WF) :- !,
1488		b_general_sum_or_mul(Ids,Condition,Expression,Type,Info,LocalState,State,SumResult,WF,sum).
1489		b_compute_expression2(general_product(Ids,Condition,Expression),Type,Info,LocalState,State,MulResult,WF) :- !,
1490		b_general_sum_or_mul(Ids,Condition,Expression,Type,Info,LocalState,State,MulResult,WF,mul).
1491		/* Begin: Extensions for Z */
1492		b_compute_expression2(if_then_else(If,Then,Else),T,_I,LocalState,State,Value,WF) :- !,
1493		opt_push_wait_flag_call_stack_info(WF,b_expr_call(if_test,If),WF2),
1494	?	b_try_check_boolean_expression_wf(If,LocalState,State,WF2,PredRes),
1495		(var(PredRes), can_get_full_fd_value(T), preferences:preference(use_clpfd_solver,true),
1496		always_well_defined(Then), always_well_defined(Else)
1497		% Note: always_well_defined_or_disprover_mode probably not ok, as we evaluate the expressions unconditionally
1498		-> b_clpfd_if_then_else(PredRes,T,Then,Else,LocalState,State,Value,WF)
1499	?	; b_compute_if_then_else(PredRes,Then,Else,LocalState,State,Value,WF)
1500		).
1501		b_compute_expression2(let_expression_global(Ids,AssignmentExprs,Expr),_T,Info,LocalState,State,Value,WF) :-
1502		debug_println(4,global_let(Ids,Info)),
1503		% store variables globally (not in LocalState) to be visible to subsidiary operation_calls
1504		!, set_up_localstate_for_global_let(Ids,AssignmentExprs,LocalState,State,LetState,WF),
1505		b_compute_expression(Expr,LocalState,LetState,Value,WF).
1506		b_compute_expression2(let_expression(Ids,AssignmentExprs,Expr),_T,_I,LocalState,State,Value,WF) :-
1507	?	!, set_up_localstate_for_let(Ids,_ParaValues,AssignmentExprs,LocalState,State,LetState,WF),
1508	?	b_compute_expression(Expr,LetState,State,Value,WF). %% NOT COVERED (30)
1509		b_compute_expression2(freetype_constructor(Id,Case,Expr),_T,_I,LocalState,State,FreeValue,WF) :-
1510		!, FreeValue = freeval(Id,Case,Value),
1511		b_compute_expression(Expr,LocalState,State,Value,WF). %% NOT COVERED (32)
1512		b_compute_expression2(freetype_destructor(Id,Case,Expr),_T,Info,LocalState,State,Value,WF) :-
1513		!, b_compute_expression(Expr,LocalState,State,freeval(Id,VCase,VValue),WF),
1514		check_freetype_case(Id,Case,VCase,VValue,Value,Info,WF).
1515		/* End: Extensions for Z */
1516		b_compute_expression2(assertion_expression(Cond,ErrMsg,Expr),T,Info,LocalState,State,Value,WF) :- !,
1517		opt_push_wait_flag_call_stack_info(WF,
1518		span_predicate(b(assertion_expression(Cond,ErrMsg,b(value(string('')),string,[])),T,Info),LocalState,State),WF2),
1519		% should we use another term for call stack?
1520		(get_preference(disprover_mode,true) -> PredRes = pred_true ; true), % in Disprover mode we know Cond must be true
1521		b_try_check_boolean_expression_no_enum_wf(Cond,LocalState,State,WF2,PredRes), % DO NOT ENUM, unless we cannot reify
1522		% does not make sense to enumerate PredRes as with pred_false we get no value anyway
1523		% however, we may get pending co-routines if Cond cannot be reified
1524		( PredRes==pred_false ->
1525		translate_bexpression_with_limit(Cond,100,CS),
1526		add_wd_error_span(ErrMsg,CS,span_predicate(Cond,LocalState,State),WF2),
1527		get_last_wait_flag(assertion_expression,WF2,WFC),
1528		when(nonvar(WFC),
1529		(ground_value(Value) -> true % we have a WD Error, any Value goes
1530		; b_compute_expression(Expr,LocalState,State,Value,WF2) % compute Value; avoid infinite enumeration of possible values; useful e.g. for prj1/prj2 assertion expressions
1531		))
1532	?	; b_compute_expression(Expr,LocalState,State,Value,WF),
1533		add_wd_error_if_false(PredRes,ErrMsg,Cond,span_predicate(Cond,LocalState,State),WF2)
1534		). %% NOT COVERED (34)
1535		b_compute_expression2(multiplication(Arg1,Arg2),integer,Info,LocalState,State,Value,WF) :-
1536		same_texpr(Arg1,Arg2), !, % is less useful when CLPFD is already turned on, calls square(Arg1,Value,WF)
1537		b_compute_expression(Arg1,LocalState,State,SV1,WF),
1538		unary_kernel_call(kernel_objects,square,SV1,Value,WF,multiplication(Arg1,Arg1),integer,Info).
1539		b_compute_expression2(image(Relation,Set),_EType,_Info,LocalState,State,Value,WF) :-
1540		special_operator_for_image(Relation,Kind,Args),
1541		% we have closure1(Rel)[Set] or similar -> avoid computing full closure
1542		!,
1543	?	b_compute_expression(Set,LocalState,State,SV,WF),
1544		b_compute_expressions(Args,LocalState,State,EArgs,WF),
1545	?	kernel_call(bsets_clp:image_for_special_operator(Kind,EArgs,SV,Value,WF),[SV|EArgs],WF,image(Relation,Set)).
1546		b_compute_expression2(external_function_call(FunName,Args),EType,Info,LocalState,State,Value,WF) :-
1547		!,
1548	?	b_compute_expressions(Args, LocalState,State, EvaluatedArgs, WF),
1549		push_wait_flag_call_stack_info(WF,external_call(FunName,EvaluatedArgs,Info),WF2),
1550	?	call_external_function(FunName,Args,EvaluatedArgs,Value,EType,Info,WF2).
1551		b_compute_expression2(Expression,EType,Info,LocalState,State,Res,WF) :-
1552		is_set_type(EType,Type),
1553		/* avoid evaluating certain expensive expressions:
1554		convert them into symbolic closures and expand only if really required */
1555		functor(Expression,UnOp,1),
1556		symbolic_closure_unary_operator(UnOp),
1557		/* TO DO: UNFOLD THIS OR WRAP in CONSTRUCTOR */
1558		arg(1,Expression,BType),
1559		!, %preferences:get_preference(convert_types_into_closures,true),!,
1560		% print_message(delayed_un_op(UnOp,BType)),
1561	?	b_compute_expression(BType,LocalState,State,ArgValue,WF),
1562		( do_not_keep_symbolic_unary(UnOp,ArgValue),
1563		unary_function(UnOp,Module,KernelFunction) ->
1564		/* special treatment for empty set or other situations: no need to keep symbolic */
1565	?	unary_kernel_call(Module,KernelFunction,ArgValue,Res,WF,Expression,EType,Info)
1566		;
1567		get_texpr_type(BType,ArgType),
1568		create_texpr(value(ArgValue),ArgType,[],TValue),
1569		ClosureSetExpression =.. [UnOp,TValue],
1570		construct_member_closure('_zzzz_unary',Type,Info,ClosureSetExpression,Value),
1571	?	((unop_to_be_marked_as_symbolic(UnOp,ArgValue) ; member(prob_annotation('SYMBOLIC'),Info)) ->
1572		mark_closure_as_symbolic(Value,SValue),
1573		equal_object_wf(Res,SValue,WF)
1574		; equal_object_wf(Res,Value,WF))
1575
1576		).
1577		b_compute_expression2(Expression,EType,Info,LocalState,State,Res,WF) :-
1578		is_set_type(EType,Type),
1579		/* avoid evaluating certain expensive expressions:
1580		convert them into symbolic closures and expand only if really required */
1581		functor(Expression,BinOp,2),
1582		arg(1,Expression,BType1),
1583		arg(2,Expression,BType2),
1584		kernel_mappings:symbolic_closure_binary_operator(BinOp),
1585		!,
1586		%preferences:get_preference(convert_types_into_closures,true),!,
1587	?	b_compute_expression(BType1,LocalState,State,ArgValue1,WF),
1588		(binary_arg1_determines_value(BinOp,ArgValue1,DetResult)
1589		-> /* print(det(BinOp,ArgValue1)),nl, */
1590		equal_object_wf(Res,DetResult,b_compute_expression2(BinOp),WF)
1591		; b_compute_expression(BType2,LocalState,State,ArgValue2,WF),
1592		% print_message(delayed_bin_op(BinOp,ArgValue1,ArgValue2)),
1593		(is_definitely_empty(BinOp,ArgValue1,ArgValue2)
1594		-> empty_set(Res)
1595		; if(do_not_keep_symbolic(BinOp,ArgValue1,ArgValue2,ERes,WF),
1596		% then:
1597		equal_object_wf(Res,ERes,b_compute_expression2(BinOp),WF),
1598		% else:
1599		(get_texpr_type(BType1,TypeArg1), create_texpr(value(ArgValue1),TypeArg1,[],TArg1),
1600		get_texpr_type(BType2,TypeArg2), create_texpr(value(ArgValue2),TypeArg2,[],TArg2),
1601		ClosureSetExpression =.. [BinOp,TArg1,TArg2],
1602		construct_member_closure('_zzzz_unary',Type,Info,ClosureSetExpression,Value),
1603		% print('Constructed Symbolic Closure : '), translate:print_bvalue(Value),nl,
1604	?	(binop_to_be_marked_as_symbolic(BinOp,ArgValue1,ArgValue2) ->
1605		mark_closure_as_symbolic(Value,SValue),
1606		equal_object_wf(Res,SValue,WF)
1607		; equal_object_wf(Res,Value,WF))
1608		)
1609		) % if
1610		)
1611		).
1612		b_compute_expression2(Expression,Type,Info,LocalState,State,Value,WF) :-
1613		functor(Expression,Op,1),
1614		unary_function(Op,Module,KernelFunction),
1615		arg(1,Expression,Arg1),!,
1616		%opt_push_wait_flag_call_stack_info(WF,b_operator_arg_evaluation(Op,1,[SV1],Arg1),WF1),
1617	?	b_compute_expression(Arg1,LocalState,State,SV1,WF),
1618	?	unary_kernel_call(Module,KernelFunction,SV1,Value,WF,Expression,Type,Info).
1619		b_compute_expression2(Expression,Type,Info,LocalState,State,Value,WF) :-
1620		functor(Expression,Op,2),
1621		binary_function(Op,Module,KernelFunction),
1622		arg(1,Expression,Arg1),
1623		arg(2,Expression,Arg2),!,
1624		%opt_push_wait_flag_call_stack_info(WF,b_operator_arg_evaluation(Op,1,[SV1,_],Arg1),WF1),
1625	?	b_compute_expression(Arg1,LocalState,State,SV1,WF),
1626		(binary_arg1_determines_value(Op,SV1,Result) % we could disable this if find_abort_values=true or if SV1 not guaranteed to be wd
1627		->
1628		equal_object_wf(Value,Result,b_compute_expression2(Op),WF)
1629	?	; b_compute_expression(Arg2,LocalState,State,SV2,WF),
1630	?	binary_kernel_call(Module,KernelFunction,SV1,SV2,Value,WF,Expression,Type,Info)
1631		).
1632		b_compute_expression2(operation_call_in_expr(Operation,Parameters),_T,Info,LocalState,State,Value,WF) :-
1633		!, def_get_texpr_id(Operation,op(OperationName)),
1634		% TODO: check that this is a query operation; probably done in type checker
1635		b_execute_operation_in_expression(OperationName,LocalState,State,Parameters,Value,Info,WF).
1636		b_compute_expression2(E,T,Info,_L,_S,_R,_WF) :-
1637		(T==pred -> add_internal_error('Uncovered expression; looks like a predicate in the wrong place: ',b(E,T,Info))
1638		; T==subst -> add_internal_error('Uncovered expression; looks like a substitution in the wrong place: ',b(E,T,Info))
1639		; requires_cleanup_pre(E) -> add_internal_error('Non-cleaned up ambiguous expression: ',b(E,T,Info))
1640		; add_internal_error('Uncovered expression: ',b(E,T,Info))
1641		),
1642		print_functor(E), print(' : '), print(T),nl,fail.
1643
1644		requires_cleanup_pre(mult_or_cart(_,_)).
1645		requires_cleanup_pre(minus_or_set_subtract(_,_)).
1646
1647		make_couplise([A],R) :- !,R=A.
1648		make_couplise([A,B],R) :- !,R=(A,B).
1649		make_couplise([A,B|Rest],Result) :- !,
1650		make_couplise([(A,B)|Rest],Result).
1651		make_couplise(A,_) :- add_internal_error('Illegal operation call result:',A),fail.
1652
1653		% ---
1654
1655
1656		% check if a symbolic_closure_unary_operator result should be marked with prob_annotation(SYMBOLIC)
1657		% because direct sub-args are marked SYMBOLIC
1658		unop_to_be_marked_as_symbolic(UnOp,Value) :- nonvar(Value),
1659	?	to_be_marked_as_symbolic_aux(UnOp,Value).
1660		to_be_marked_as_symbolic_aux(struct,rec(Fields)) :- !,
1661	?	member(field(_,SymbolicClosure),Fields),
1662	?	is_symbolic_closure(SymbolicClosure).
1663		%to_be_marked_as_symbolic_aux(pow_subset,SymbolicClosure) :- is_symbolic_closure(SymbolicClosure).
1664		%to_be_marked_as_symbolic_aux(pow1_subset,SymbolicClosure) :- is_symbolic_closure(SymbolicClosure).
1665	?	to_be_marked_as_symbolic_aux(_,SymbolicClosure) :- is_symbolic_closure(SymbolicClosure).
1666
1667		% check if a symbolic_closure_binary_operator result should be marked with prob_annotation(SYMBOLIC)
1668		% because direct sub-args are marked SYMBOLIC
1669		binop_to_be_marked_as_symbolic(interval,_,_) :- !, fail.
1670		%binop_to_be_marked_as_symbolic(overwrite,_,_) :- !, true. % TO DO: fix by detecting infinite <+ closures
1671	?	binop_to_be_marked_as_symbolic(set_subtraction,ArgVal1,_) :- !, is_symbolic_closure(ArgVal1).
1672		binop_to_be_marked_as_symbolic(intersection,ArgVal1,ArgVal2) :-
1673	?	(finite_reasonably_sized_set(ArgVal1) ; finite_reasonably_sized_set(ArgVal2)), !,
1674		fail. % intersection is finite and reasonably sized
1675	?	binop_to_be_marked_as_symbolic(_,ArgVal1,_) :- is_symbolic_closure(ArgVal1).
1676	?	binop_to_be_marked_as_symbolic(_,_,ArgVal2) :- is_symbolic_closure(ArgVal2).
1677		% ---
1678
1679		% check if we have a finite known set that can be reasonably represented
1680		% see small_known_set/1 is kernel_mappings
1681		finite_reasonably_sized_set(AVL) :- nonvar(AVL), AVL=avl_set(_). % already expanded; so it can be represented in memory
1682		finite_reasonably_sized_set(Closure) :- nonvar(Closure),
1683		custom_explicit_sets:is_interval_closure(Closure,From,To), integer(From), integer(To),
1684		1+To-From < 250000. % what value should we use here?
1685
1686		lazy_compute_expression(TRIGGER,AssignmentExpr,LocalState,State,IdValue,WF,Ai) :-
1687		get_enumeration_finished_wait_flag(WF,F),
1688		block_lazy_compute_expression(TRIGGER,F,AssignmentExpr,LocalState,State,IdValue,WF,Ai).
1689
1690		:- block block_lazy_compute_expression(-,-,?,?,?, ?,?,?).
1691		block_lazy_compute_expression(TRIGGER,_F,_AssignmentExpr,_LocalState,_State,_IdValue,_WF,_Ai) :-
1692		var(TRIGGER),!.
1693		block_lazy_compute_expression(pred_true,_,AssignmentExpr,LocalState,State,IdValue,WF,Ai) :-
1694		AssignmentExpr = b(Expr,Type,Infos),
1695		(Type \== pred -> b_compute_expression2(Expr,Type,Infos,LocalState,State,IdValue,WF)
1696		; IdValue == pred_true -> b_test_boolean_expression2(Expr,Infos,LocalState,State,WF,Ai,_)
1697		; IdValue == pred_false -> b_not_test_boolean_expression2(Expr,Infos,LocalState,State,WF,Ai,_)
1698		; b_check_boolean_expression(AssignmentExpr,LocalState,State,WF,PredVal,Ai,_) -> IdValue = PredVal
1699		; % reification of check_boolean_expression failed:
1700		b_try_check_failed(AssignmentExpr,LocalState,State,'$ENUMERATION',WF,IdValue,'$GENERATE_ON_DEMAND')
1701		).
1702		block_lazy_compute_expression(pred_false,_,_AssignmentExpr,_LocalState,_State,[],_WF,_Ai). % maybe generate any value ??
1703
1704		% ---
1705
1706		:- block add_wd_error_if_false(-,?,?,?,?).
1707		add_wd_error_if_false(pred_true,_,_,_,_).
1708		add_wd_error_if_false(pred_false,ErrMsg,Cond,Span,WF) :-
1709		translate_bexpression_with_limit(Cond,100,CS),
1710		%(Span=span_predicate(P,LS,State) -> tcltk_interface:write_dot_file_for_pred_expr_and_state(P, LS, State,'/tmp/prob_wd_error.dot') ; true),
1711		add_wd_error_span(ErrMsg,CS,Span,WF).
1712
1713		% ---
1714
1715
1716		:- use_module(kernel_tools,[ground_value/1]).
1717		% compute function application:
1718		b_compute_expression_function(Function,FunArg,Type,Info,LocalState,State,Res,WF) :-
1719		preferences:preference(find_abort_values,false), % the treatment below will not check, e.g., if the set extension is really a function
1720		is_extension_function(Function,FInfo,ExFun), !,
1721		/* a set extension applied to an argument: in some cases we can can first evaluate the argument,
1722		and then avoid having to compute the set_extension for all non-matching args */
1723		b_compute_expression(FunArg,LocalState,State,ArgValue,WF),
1724		% TO DO : should we only do this if ArgValue is known ?? otherwise the standard treatment is better ??
1725		% Note: b_compiler has a special rule to not remove this optimisation
1726		Span = span_predicate(b(function(Function,FunArg),Type,Info),LocalState,State),
1727		opt_push_wait_flag_call_stack_info(WF,function_call(Function,ArgValue,Info),WF2), % small performance hit; hence we only push onto call_stack in TRACE_INFO mode
1728		((memberchk(contains_wd_condition,FInfo) ; % relevant for test 1302; but machine seems to contain real WD error
1729		preferences:preference(use_clpfd_solver,false) ;
1730		ground_value(ArgValue))
1731		-> b_apply_function_set_extension(ExFun,ArgValue,LocalState,State,Res,WF2,Span)
1732		; /* the standard treatment can infer information about the result,... in clpfd_mode */
1733		b_compute_expression(Function,LocalState,State,FValue,WF),
1734		get_texpr_type(Function,FunctionType),
1735		kernel_call_apply_to(FValue,ArgValue,Res,FunctionType,Span,WF2)).
1736		%b_compute_expression_function(b(comprehension_set(Parameters,Condition),_,SInfo),Arg,Type,Info,LocalState,State,Value,WF) :- !,
1737		% b_compute_comprehension_set_symbolic(Parameters,Condition,SInfo,LocalState,State,FValue,WF),
1738		% b_compute_expression(Arg,LocalState,State,ArgValue,WF),
1739		% Span = span_predicate(b(function(Function,Arg),Type,Info),LocalState,State),
1740		% get_texpr_type(Function,FunctionType),
1741		% kernel_call_apply_to(FValue,ArgValue,Value,FunctionType,Span,WF).
1742		b_compute_expression_function(Function,FunArg,_Type,Info,LocalState,State,Value,WF) :-
1743		special_operator_for_image(Function,Kind,Args),!, % detect e.g. iterate(rel,k)(x)
1744		b_compute_expression(FunArg,LocalState,State,SV,WF),
1745		b_compute_expressions(Args,LocalState,State,EArgs,WF),
1746		kernel_call(bsets_clp:apply_fun_for_special_operator(Kind,EArgs,SV,Value,WF,Info),
1747		[SV|EArgs],WF,function(Function,FunArg)).
1748		b_compute_expression_function(Function,Arg,Type,Info,LocalState,State,Value,WF) :-
1749		opt_push_wait_flag_call_stack_info(WF,function_call(Function,ArgValue,Info),WF2),
1750	?	b_compute_expression(Function,LocalState,State,FValue,WF2),
1751	?	b_compute_expression(Arg,LocalState,State,ArgValue,WF2),
1752		Span = span_predicate(b(function(Function,Arg),Type,Info),LocalState,State),
1753		get_texpr_type(Function,FunctionType),
1754		% TODO: do we still need the span predicate when we have the function_call call_stack infos?
1755	?	kernel_call_apply_to(FValue,ArgValue,Value,FunctionType,Span,WF2).
1756
1757
1758		:- use_module(bsyntaxtree,[get_set_type/2,is_set_type/2]).
1759		:- use_module(kernel_cardinality_attr,[finite_cardinality_as_int_with_type_wf/5]).
1760		b_compute_card(Arg1,Type,Info,OuterInfo,LocalState,State,Card,WF) :-
1761	?	b_compute_card2(Arg1,Type,Info,OuterInfo,LocalState,State,Card,WF),
1762		% maybe we should move this code below inside kernel_objects ??
1763		(ground(Card) -> true
1764		; get_set_type(Type,SetElType), % TO DO: only needed for cardinality_of_set_extension_list
1765	?	kernel_objects:max_cardinality(SetElType,MaxCard), % this could be precomputed statically
1766		(number(MaxCard) -> kernel_objects:in_nat_range(Card,int(0),int(MaxCard))
1767		; kernel_objects:greater_than_equal(Card,int(0)) % not sure this is required
1768		)
1769		).
1770		b_compute_card2(set_extension(Ex),_,_,_,LocalState,State,Card,WF) :- !,
1771		b_compute_expressions(Ex,LocalState,State,ExValue,WF),
1772		kernel_objects:cardinality_of_set_extension_list(ExValue,Card,WF).
1773		b_compute_card2(range(F),_,_,_,LocalState,State,Card,WF) :- !,
1774		b_compute_expression(F,LocalState,State,SV1,WF),
1775		kernel_objects:cardinality_of_range(SV1,Card,WF).
1776		b_compute_card2(comprehension_set(Parameters,Condition),Type,Info,OuterInfo,LocalState,State,Card,WF) :- !,
1777		get_set_type(Type,SetElType),
1778		% ensure that we keep the closure and don't expand it:
1779	?	b_compute_comprehension_set_symbolic(Parameters,Condition,Info,LocalState,State,SV1,WF),
1780	?	kernel_mappings:must_succ_kernel_call(
1781		kernel_cardinality_attr:finite_cardinality_as_int_with_type_wf(SV1,SetElType,OuterInfo,Card,WF),SV1,WF,card).
1782		% TO DO: treat comprehension set + things like card({x|x>1 & x<2**e & x mod 2 = 0}) = 0
1783		b_compute_card2(Arg1,Type,Info,OuterInfo,LocalState,State,Card,WF) :-
1784		get_set_type(Type,SetElType),
1785		b_compute_expression2(Arg1,Type,Info,LocalState,State,SV1,WF),
1786	?	kernel_mappings:must_succ_kernel_call(
1787		kernel_cardinality_attr:finite_cardinality_as_int_with_type_wf(SV1,SetElType,OuterInfo,Card,WF),SV1,WF,card).
1788
1789		b_compute_max(set_extension(Ex),_,Info,LocalState,State,Max,WF) :- !,
1790		b_compute_expressions(Ex,LocalState,State,ExValue,WF),
1791		kernel_objects:maximum_of_set_extension_list(ExValue,Max,Info,WF).
1792		b_compute_max(Arg1,Type,Info,LocalState,State,Max,WF) :-
1793		b_compute_expression2_symbolic(Arg1,Type,Info,LocalState,State,SV1,WF),
1794		kernel_mappings:must_succ_kernel_call(kernel_objects:maximum_of_set(SV1,Max,Info,WF),SV1,WF,max).
1795
1796		b_compute_min(set_extension(Ex),_,Info,LocalState,State,Min,WF) :- !,
1797	?	b_compute_expressions(Ex,LocalState,State,ExValue,WF),
1798		kernel_objects:minimum_of_set_extension_list(ExValue,Min,Info,WF).
1799		/* doesnot really buy a lot: */
1800		/*b_compute_min(union(Arg1,Arg2),_,Info,LocalState,State,Min,WF) :-
1801		Arg1 = b(set_extension(Ex),Type1,Info1),
1802		!,
1803		b_compute_min(set_extension(Ex),Type1,Info1,LocalState,State,Min1,WF),
1804		b_compute_expression(Arg2,LocalState,State,SV2,WF),
1805		b_compute_min2(SV2,Min1,Min,Info,WF).
1806		:- block b_compute_min2(-,?,?,?,?).
1807		b_compute_min2([],Min1,Res,_,_WF) :- !, Res=Min1.
1808		b_compute_min2(SV1,Min1,Res,Info,WF) :-
1809		kernel_mappings:must_succ_kernel_call(kernel_objects:minimum_of_set(SV1,Min2,Info,WF),SV1,WF,min),
1810		min(Min1,Min2,Res).
1811		min(int(A),int(B),int(Res)) :- kernel_objects:minimum(A,B,Res). */
1812		b_compute_min(Arg1,Type,Info,LocalState,State,Min,WF) :-
1813		b_compute_expression2_symbolic(Arg1,Type,Info,LocalState,State,SV1,WF),
1814		kernel_mappings:must_succ_kernel_call(kernel_objects:minimum_of_set(SV1,Min,Info,WF),SV1,WF,min).
1815
1816		generate_recursive_closure(TRecId,RecValue,Parameters,Condition,LocalState,State,Result,WF) :-
1817		get_texpr_id(TRecId,RecId),
1818		add_var_to_localstate(RecId,RecValue,LocalState,State1),
1819		debug_println(9,generating_recursive_closure(RecId,Parameters)),
1820		b_generate_rec_closure_aux(RecId,Parameters,Condition,State1,State,RClosure1,WF),
1821		mark_closure_as_recursive(RClosure1,RClosure2),
1822		mark_closure(RClosure2,[recursive(TRecId)],Result),
1823		( debug_mode(off) -> true
1824		; ground_value(Result) -> true
1825		; term_variables(Result,TV),
1826		add_message(b_interpreter,'non-ground closure generated: ',TV:Result,Condition)
1827		).
1828		% a variation of b_generate_closure
1829		b_generate_rec_closure_aux(RecId,Parameters,Condition,LocalState,State,Result,WF) :-
1830		split_names_and_types(Parameters,Names,Types),
1831		construct_closure(Names,Types,ClosurePred,Result),
1832		% now add RecId to parameters to prevent looking up recursive calls
1833		b_compiler:b_compile(Condition,[RecId|Names],LocalState,State,ClosurePred,WF).
1834
1835		% check if a freetype value has the expected case, if not
1836		% generate a WD-error
1837		check_freetype_case(Id,Case,VCase,Inner,Value,Info,WF) :-
1838		get_enumeration_finished_wait_flag(WF,F),
1839		check_freetype_case2(Id,Case,VCase,Inner,Value,Info,F,WF).
1840		:- block check_freetype_case2(?,?,-,?,?,?,-,?).
1841		check_freetype_case2(Id,Case,VCase,Inner,Value,Info,_F,WF) :-
1842		( nonvar(VCase) ->
1843		( Case=VCase -> equal_object_wf(Inner,Value,check_freetype_case2,WF)
1844		;
1845		ajoin(['cannot apply destructor for data type ',Id,
1846		', expected constructor ',Case,', but got: '],Msg),
1847		add_wd_error_set_result(Msg,VCase,Inner,Value,Info,WF))
1848		; % the computation has finished without value,
1849		true). % just drop the check
1850
1851		% check if we have a set_extension argument representing an explicit function
1852		% {a |-> f1, b |-> f2, ...} or [f1,f2]
1853		is_extension_function(b(A,_,Info),Info,C) :- is_extension_function_aux(A,C).
1854		is_extension_function_aux(set_extension(Ex),CaseList) :- is_set_extension_function(Ex,CaseList).
1855		is_extension_function_aux(sequence_extension(Ex),CaseList) :- is_sequence_extension_function(Ex,1,CaseList).
1856		is_set_extension_function([],[]).
1857		is_set_extension_function([b(Couple,TC,_)|T],[case(A,B)|ST]) :- is_couple(Couple,TC,A,B),
1858		is_set_extension_function(T,ST).
1859		is_sequence_extension_function([],_,[]).
1860		is_sequence_extension_function([B|T],Nr,[case(b(value(int(Nr)),integer,[]),B)|ST]) :- N1 is Nr+1,
1861		is_sequence_extension_function(T,N1,ST).
1862
1863		is_couple(couple(A,B),_,A,B).
1864		is_couple(value((VA,VB)),couple(TA,TB), b(value(VA),TA,[]), b(value(VB),TB,[])).
1865
1866		:- use_module(kernel_equality,[equality_objects_wf/4]).
1867		b_apply_function_set_extension([],FunArgVal,_LocalState,_State,_Res,WF,Span) :-
1868		add_wd_error_span('Function applied outside of domain (#8): ','@fun'(FunArgVal,[]),Span,WF).
1869		b_apply_function_set_extension([case(A,B)|T],FunArgVal,LocalState,State,Res,WF,Span) :-
1870		b_compute_expression(A,LocalState,State,AVal,WF),
1871		equality_objects_wf(AVal,FunArgVal,EqRes,WF),
1872		% TO DO: if Res is known, we can call equality_objects(BVal,Res,ResEqRes)
1873		b_apply_function_set_extension_aux(EqRes,B,T,FunArgVal,LocalState,State,Res,WF,Span).
1874
1875		:- block b_apply_function_set_extension_aux(-,?,?,?, ?,?,?,?,?).
1876		b_apply_function_set_extension_aux(pred_true,B,_T,_FunArgVal,LocalState,State,Res,WF,_Span) :-
1877		b_compute_expression(B,LocalState,State,BVal,WF), %print(value(BVal)),nl,
1878		equal_object_wf(BVal,Res,b_apply_function_set_extension_aux,WF).
1879		b_apply_function_set_extension_aux(pred_false,_B,T,FunArgVal,LocalState,State,Res,WF,Span) :-
1880		b_apply_function_set_extension(T,FunArgVal,LocalState,State,Res,WF,Span).
1881
1882
1883		% --------------------- SIGMA & PI ------------------------
1884		:- use_module(bsyntaxtree,[is_membership_or_equality/3,same_id/3]).
1885		/* first clause: try to do a specific treatment for formulas of the form SIGMA(ID).(ID:SET|EXPR) */
1886		/* Advantage: will not delay as long before computing comprehension_set SET ; see test 1312 */
1887		b_general_sum_or_mul([TID],Condition,Expression,Type,_Info,LocalState,State,SumResult,WF,SUMorMUL) :-
1888		is_membership_or_equality(Condition,MID,SET),
1889		same_id(TID,MID,_),!,
1890		b_compute_expression(SET,LocalState,State,SETResult,WF),
1891		b_general_sum_or_mul_over_set([TID],SETResult,Expression,Type,LocalState,State,SumResult,WF,SUMorMUL).
1892		b_general_sum_or_mul(Ids,Condition,Expression,Type,Info,LocalState,State,SumMulResult,WF,SUMorMUL) :-
1893		b_compute_comprehension_set(Ids,Condition,Info,LocalState,State,SETResult,WF),
1894		(var(SETResult) -> perfmessagecall(sigma_pi_not_expanded_or_reified(SUMorMUL),
1895		translate:print_bexpr(Condition),Condition) ; true),
1896		b_general_sum_or_mul_over_set(Ids,SETResult,Expression,Type,LocalState,State,SumMulResult,WF,SUMorMUL).
1897
1898
1899		:- block b_general_sum_or_mul_over_set(?,-, ?,?,?,?, ?,?,?).
1900		b_general_sum_or_mul_over_set([TID],SETResult,Expression,Type,_LS,_S,SumResult,WF,SUMorMUL) :-
1901		Type=integer, % TO DO: also for real
1902		get_texpr_id(Expression,ID), % check if we just sum the elements of the list SIGMA(x).(x:S|x)
1903		get_texpr_id(TID,ID),
1904	?	sum_or_mul_of_explicit_set(SETResult,SUMorMUL,R),!,
1905		equal_object_wf(SumResult,R,b_general_sum_or_mul_over_set,WF).
1906		b_general_sum_or_mul_over_set(IDs,SETResult,Expression,Type,LocalState,State,SumResult,WF,SUMorMUL) :-
1907		expand_custom_set_to_list_wf(SETResult,ESETResult,_Done,b_general_sum_or_mul_over_set,WF),
1908	?	b_sum_or_mul_over_list(ESETResult,IDs,Expression,Type,LocalState,State,SumResult,WF,SUMorMUL).
1909
1910		b_sum_or_mul_over_list(L,IDs,Expr,Type,LS,State,Result,WF,SUMorMUL) :-
1911		get_acc_base(SUMorMUL,Type,Acc),
1912		(Type = integer -> get_wait_flag0(WF,WF0) ; true), % for real: delay until values known
1913	?	b_sum_or_mul_over_list_acc(L,IDs,Expr,Type,LS,State,Acc,Result,WF,SUMorMUL,WF0).
1914
1915		:- block b_sum_or_mul_over_list_acc(-, ?, ?,?,?,?,?, ?,?,?,?).
1916		% better if list is fully known: no constraint propagation performed during computation !
1917		% for example: SIGMA(x).(x:{-1} \/ 1..30000|x+1) goes down from 2050 ms to 1210 ms
1918		b_sum_or_mul_over_list_acc([],_,_,Type,_,_,Acc,Result,_WF,_SUMorMUL,_) :-
1919	?	get_acc_result(Type,Acc,Result).
1920		b_sum_or_mul_over_list_acc([H|T],IDs,Expr,Type,LocalState,State,Acc,Result,WF,SUMorMUL,WF0) :-
1921		add_typed_vars_to_localstate(IDs,H,LocalState,NewLocalState),
1922		b_compute_expression(Expr,NewLocalState,State,HExprVal,WF),
1923		b_sum_or_mul_over_list_acc2(HExprVal,T,IDs,Expr,Type,LocalState,State,Acc,Result,WF,SUMorMUL,WF0).
1924
1925		:- block b_sum_or_mul_over_list_acc2(?,-, ?, ?,?,?,?,?, ?,?,?,?),
1926		b_sum_or_mul_over_list_acc2(?,?, ?, ?,?,?,?,-, ?,?,?,-),
1927		b_sum_or_mul_over_list_acc2(-,?, ?, ?,?,?,?,?, ?,?,?,-). % wait until T nonvar and either Acc & HExprVal known or WF0 set
1928		% purpose: try and remain in non-CLPFD mode as long as possible to avoid overflows,... (see eg. test 1642, 1708)
1929		b_sum_or_mul_over_list_acc2(HExprVal,T,IDs,Expr,Type,LocalState,State,Acc, Result,WF,SUMorMUL,WF0) :-
1930		(nonvar(T),nonvar(Acc),ground(HExprVal)
1931		-> % we can continue computing the system without constraint propagation; is faster
1932		get_value(Type,HExprVal,HVal),
1933		compose_acc(SUMorMUL,Acc,HVal,NewAcc),
1934		b_sum_or_mul_over_list_acc(T,IDs,Expr,Type,LocalState,State,NewAcc,Result,WF,SUMorMUL,WF0)
1935		; T==[], number(Acc), get_acc_base(SUMorMUL,Type,Acc) ->
1936		/* we have just a single element left and no operator has to be applied -> no need for clpfd treatment */
1937		equal_object_wf(HExprVal,Result,b_sum_or_mul_over_list_acc)
1938		; Type=real -> % no CLP(FD) treatment possible yet
1939		when(ground(HExprVal),
1940		b_sum_or_mul_over_list_acc2(HExprVal,T,IDs,Expr,Type,LocalState,State,Acc, Result,WF,SUMorMUL,WF0))
1941		; init_clp_acc(SUMorMUL,HExprVal,int(Acc),CLPAccumulator),
1942		b_sum_or_mul_over_list_clp(T,IDs,Expr,LocalState,State,CLPAccumulator,Result,WF,SUMorMUL)
1943		).
1944
1945		% add set comprehension solution ValueForTypedIDs as individual values for every TypedIDs to LocalState
1946		add_typed_vars_to_localstate(TypedIDs,ValueForTypedIDs,LocalState,NewLocalState) :-
1947		(flatten_pairs(TypedIDs,ValueForTypedIDs,ValAsList),
1948		add_typed_vars_to_localstate_aux(TypedIDs,ValAsList,LocalState,R)
1949		-> NewLocalState = R
1950		; add_internal_error('Call failed: ',add_typed_vars_to_localstate(TypedIDs,ValueForTypedIDs,LocalState,NewLocalState)),
1951		fail
1952		).
1953		% set comprehension results for {a,b,c|P} are nested like this ((a,b),c)
1954		% first argument only used for length (to know how deep the pairs are nested)
1955		flatten_pairs(L,Pairs,FlatList) :- flatten_pairs(L,Pairs,FlatList,[]).
1956		flatten_pairs([_],A) --> !, [A].
1957		flatten_pairs([_|T],(A,B)) --> flatten_pairs(T,A) ,[B].
1958		add_typed_vars_to_localstate_aux([],_,LS,LS).
1959		add_typed_vars_to_localstate_aux([TID],[H],LocalState,NewLocalState) :- !,
1960		get_texpr_id(TID,ID), get_texpr_type(TID,TYPE),
1961		add_typed_var_to_localstate(ID,H,TYPE,LocalState,NewLocalState).
1962		add_typed_vars_to_localstate_aux([TID1|Ids],[H1|Hs],LocalState,NewLocalState) :- !,
1963		get_texpr_id(TID1,ID1), get_texpr_type(TID1,TYPE),
1964		add_typed_var_to_localstate(ID1,H1,TYPE,LocalState,LS1),
1965		add_typed_vars_to_localstate_aux(Ids,Hs,LS1,NewLocalState).
1966
1967
1968		:- block b_sum_or_mul_over_list_clp(-, ?, ?,?,?, ?, ?,?,?).
1969		b_sum_or_mul_over_list_clp([],_, _,_,_, Acc, Result,_WF,SUMorMUL) :-
1970		finalise_clp(SUMorMUL,Acc,Result).
1971		b_sum_or_mul_over_list_clp([H|T],IDs,Expr,LocalState,State,Acc, Result,WF,SUMorMUL) :-
1972		add_typed_vars_to_localstate(IDs,H,LocalState,NewLocalState),
1973		b_compute_expression(Expr,NewLocalState,State,HExprVal,WF),
1974		compose_clp(SUMorMUL,HExprVal,Acc,NewAcc),
1975		b_sum_or_mul_over_list_clp(T,IDs,Expr,LocalState,State,NewAcc,Result,WF,SUMorMUL).
1976
1977		:- use_module(kernel_reals,[is_real/2]).
1978		get_acc_base(sum,integer,R) :- !, R=0.
1979		get_acc_base(sum,real,0.0).
1980		get_acc_base(mul,integer,R) :- !, R=1.
1981		get_acc_base(mul,real,1.0).
1982		get_acc_result(integer,Nr,int(Nr)).
1983		get_acc_result(real,Nr,Real) :- is_real(Real,Nr).
1984		get_value(integer,int(Val),Val) :- !.
1985		get_value(real,Real,Nr) :- is_real(Real,Nr).
1986
1987		compose_acc(sum,A,B,C) :- C is A+B.
1988		compose_acc(mul,A,B,C) :- C is A*B.
1989		init_clp_acc(sum,int(A),int(B),Res) :- (B==0 -> Res=[A] ; Res=[A,B]). % A always not ground
1990		init_clp_acc(mul,A,B,C) :- times(A,B,C).
1991		compose_clp(sum,int(A),Acc,NewAcc) :- NewAcc = [A|Acc].
1992		compose_clp(mul,A,B,C) :- times(A,B,C).
1993		:- use_module(clpfd_interface,[clpfd_sum/2]).
1994		finalise_clp(sum,Acc,int(Result)) :-
1995		clpfd_sum(Acc,Result). % using clpfd_sum can be much more efficient: no intermediate variables set up
1996		finalise_clp(mul,int(Acc),int(Acc)).
1997
1998		/* for if-then-else in Z: compute Then or Else,
1999		depending on the outcome of the predicate */
2000		:- block b_compute_if_then_else(-,?,?,?,?,?,?).
2001		b_compute_if_then_else(pred_true,Then,_Else,LocalState,State,Value,WF) :-
2002		opt_push_wait_flag_call_stack_info(WF,b_expr_call(if_then_body,Then),WF2),
2003	?	b_compute_expression(Then,LocalState,State,Value,WF2).
2004		b_compute_if_then_else(pred_false,_Then,Else,LocalState,State,Value,WF) :-
2005		opt_push_wait_flag_call_stack_info(WF,b_expr_call(if_else_body,Else),WF2),
2006	?	b_compute_expression(Else,LocalState,State,Value,WF2).
2007
2008		:- use_module(clpfd_interface,[clpfd_if_then_else/4]).
2009		% a more sophisticated treatment, can also work backwards forcing PredRes
2010		% examples:
2011		% x = IF a<10 THEN 0 ELSE 5 END & x:6..10 & a:1..23
2012		% see must_fail_clpfd_det 132 and 133
2013		% problematic if Else contains recursion; but then we should have WD condition
2014		b_clpfd_if_then_else(PredRes,Type,Then,Else,LocalState,State,Value,WF) :-
2015		get_wait_flag0(WF,WF0),
2016		b_clpfd_if_then_else_block(PredRes,WF0,Type,Then,Else,LocalState,State,Value,WF).
2017		:- block b_clpfd_if_then_else_block(-,-,?,?,?,?,?,?,?).
2018		b_clpfd_if_then_else_block(PredRes,_,Type,Then,Else,LocalState,State,Value,WF) :- var(PredRes),!,
2019		get_full_fd_value(Type,Value,FDValue),
2020		b_compute_expression(Then,LocalState,State,ThenValue,WF),
2021		get_full_fd_value(Type,ThenValue,FDThenValue),
2022		b_compute_expression(Else,LocalState,State,ElseValue,WF),
2023		get_full_fd_value(Type,ElseValue,FDElseValue),
2024		% TO DO: catch CLPFD overflow and use equality_objects
2025		clpfd_if_then_else(PredRes,FDThenValue,FDElseValue,FDValue).
2026		b_clpfd_if_then_else_block(pred_true,_,_Type,Then,_Else,LocalState,State,Value,WF) :-
2027		b_compute_expression(Then,LocalState,State,Value,WF).
2028		b_clpfd_if_then_else_block(pred_false,_,_Type,_Then,Else,LocalState,State,Value,WF) :-
2029		b_compute_expression(Else,LocalState,State,Value,WF).
2030
2031		:- use_module(b_global_sets,[get_global_type_value/3]).
2032		% try and get full_fd_value; true if full value can be translated to CLP(FD) value
2033		get_full_fd_value(global(T),FY,X) :- get_global_type_value(FY,T,X).
2034		get_full_fd_value(integer,int(X),X).
2035		get_full_fd_value(boolean,B,FD) :- kernel_equality:prop_eq_01(B,FD).
2036		% record with single field ?
2037
2038		can_get_full_fd_value(global(_)).
2039		can_get_full_fd_value(integer).
2040		can_get_full_fd_value(boolean).
2041
2042		% a slightly improved version over set_up_localstate (not sure it is really much faster):
2043		add_lazy_let_id_to_local_state(b(identifier(ID),_,_),Trigger,IdValue,LocalState,NewState) :-
2044		% should we delete any old occurence of ID in LocalState?
2045		NewState = [bind(ID,(Trigger,IdValue))|LocalState].
2046
2047		add_lazy_let_id_and_expression(Id,IdExpr,LocalState,InState,NewLocalState,WF) :-
2048		empty_avl(Ai),
2049		add_lazy_let_id_and_expression(Id,IdExpr,LocalState,InState,NewLocalState,WF,Ai).
2050		add_lazy_let_id_and_expression(Id,IdExpr,LocalState,InState,NewLocalState,WF,Ai) :-
2051		add_lazy_let_id_to_local_state(Id,Trigger,IdValue,LocalState,NewLocalState),
2052		lazy_compute_expression(Trigger,IdExpr,LocalState,InState,IdValue,WF,Ai).
2053
2054		/* for let-statements in Z and now in B: expand localstate by new variables and assign
2055		values to them ;
2056		now Expressions are evaluated in state *with* the new identifiers !
2057		*/
2058		%set_up_localstate_for_let_no_reuse(Ids,Exprs,LocalState,State,LetState,WF) :-
2059		% set_up_localstate(Ids,Vars,LocalState,LetState),
2060		% compute_let_expressions(Exprs,Vars,LocalState,State,WF).
2061		set_up_localstate_for_let(Ids,Vars,Exprs,LocalState,State,LetState,WF) :-
2062		set_up_localstate(Ids,Vars,LocalState,LetState),
2063		%external_functions:observe_variables(Ids,Vars),
2064	?	compute_let_expressions(Exprs,Vars,LetState,State,WF).
2065		compute_let_expressions([],[],_,_,_).
2066		compute_let_expressions([Expr|RestExprs],[Var|RestVars],LocalState,State,WF) :-
2067	?	b_compute_expression(Expr,LocalState,State,Value,WF),
2068		equal_object_optimized(Var,Value,compute_let_expressions),
2069		compute_let_expressions(RestExprs,RestVars,LocalState,State,WF).
2070
2071		set_up_localstate_for_global_let(Ids,Exprs,LocalState,State,LetState,WF) :-
2072		set_up_localstate(Ids,Vars,State,LetState),
2073		compute_let_expressions(Exprs,Vars,LocalState,LetState,WF).
2074
2075
2076		l_compute_field([],_LS,_S,[],_WF).
2077		l_compute_field([Field|T],LS,S,[FVal|CT],WF) :-
2078	?	b_compute_field(Field,LS,S,FVal,WF),
2079	?	l_compute_field(T,LS,S,CT,WF).
2080
2081		b_compute_field(field(Name,TypeOrVal),LocalState,State,field(Name,TypeOrFieldValue),WF) :-
2082	?	b_compute_expression(TypeOrVal,LocalState,State,TypeOrFieldValue,WF).
2083
2084
2085
2086		:- use_module(b_compiler).
2087
2088		/* :- type bsets_closure +--> closure(list(type(variable_id)),
2089		list(type(basic_type_descriptor)),type(boolean_expression)). */
2090
2091		:- assert_pre(b_interpreter:b_compute_comprehension_set(Parameters,Cond,_Info,LS,State,_R,_WF),
2092		(ground_check(Parameters),
2093		bsyntaxtree:check_if_typed_predicate(Cond),type_check(LS,store),type_check(State,store)) ).
2094
2095		:- assert_post(b_interpreter:b_compute_comprehension_set(_P,_C,_Info,_LS,_State,Val,_WF),
2096		(b_interpreter:value_type(Val))). %, nonvar(Val)
2097
2098
2099
2100		b_compute_comprehension_set_symbolic(Parameters,Condition,Info,LocalState,State,Result,WF) :-
2101		% a version which never expands the generated closure
2102	?	b_generate_closure_if_necessary(Parameters,Condition,LocalState,State,CResult,WF),
2103	?	(member(prob_annotation('SYMBOLIC'),Info)
2104		-> mark_closure_as_symbolic(CResult,CRS),Result=CRS
2105		; Result=CResult). % TODO: check if we need definitely_expand_this_explicit_set
2106		% we could catch Parameters = [TID], Condition = b(member(b(identifier(ID),_TYPE,_),SET)
2107		b_compute_comprehension_set(Parameters,Condition,Info,LocalState,State,Result,WF) :-
2108	?	b_generate_closure_if_necessary(Parameters,Condition,LocalState,State,CResult,WF),
2109		b_compute_comprehension_set_aux(CResult,Info,Result,WF).
2110
2111		:- use_module(clpfd_interface,[catch_clpfd_overflow_call2/2]).
2112		b_compute_comprehension_set_aux(CResult,_,Result,_WF) :-
2113		(var(CResult) ; \+ functor(CResult,closure,3) ),!,
2114		Result=CResult.
2115		b_compute_comprehension_set_aux(CResult,Info,Result,_WF) :-
2116	?	member(prob_annotation('SYMBOLIC'),Info),!,
2117		mark_closure_as_symbolic(CResult,CRS),Result=CRS.
2118		b_compute_comprehension_set_aux(CResult,Info,Result,WF) :-
2119		(preferences:get_preference(convert_comprehension_sets_into_closures,true)
2120		-> \+ definitely_expand_this_explicit_set(CResult)
2121		; dont_expand_symbolic_explicit_set(CResult), % Note: also detects FORCE annotation
2122		perfmessage_wf(symbolic,'Keeping set comprehension symbolic (use FORCE to override this or increase SYMBOLIC_LIMIT)','',Info,WF)
2123		),!,
2124		Result=CResult.
2125		b_compute_comprehension_set_aux(CResult,Info,Result,WF) :-
2126		b_expand_compute_comprehension_set(CResult,Info,Result,WF).
2127
2128		b_expand_compute_comprehension_set(CResult,Info,Result,WF) :-
2129		% using just get_wait_flag1(b_compute_comprehension_set,WF,WF0), makes many benchmarks faster ; but e.g., test 268 fails; maybe we sholud pre-compute bexpr_variables ? and pass this to expand_only_custom_closure_global
2130		(preferences:preference(use_smt_mode,false)
2131		-> get_wait_flag(1000,b_compute_comprehension_set,WF,WF0) % ideally we should say WF0 = _ ; but for some benchmarks Rule_DB_SIGAREA_0024_ori.mch this is important to avoid expanding closures before other stuff fails
2132		% only in SMT mode can there be any benefit in expanding a non-ground closure (when it is a lambda closure)
2133		% => hence delay expansion longer, possibly detecting enumeration warnings while expanding
2134		% TO DO: for lambda closures with known domain: expand earlier !
2135		; get_wait_flag(2,b_compute_comprehension_set,WF,WF0)),
2136		kernel_objects:mark_as_to_be_computed(Result), % avoid that we instantiate this set (e.g., in check_element_of_wf: we will get a full description of the set later; see test 1353
2137		(var(WF0),var(Result) -> ground_value_check(CResult,CGr) ; true),
2138		block_compute_comprehension_set_aux(CResult,Info,Result,WF,WF0,CGr).
2139
2140		:- block block_compute_comprehension_set_aux(?,?,-,?,-,-).
2141		block_compute_comprehension_set_aux(CResult,Info,Result,WF,_WF0,_CGr) :-
2142		(
2143		nonvar(Result)
2144	?	-> equal_object_wf(CResult,Result,WF) % this may expand CResult or do other tests;
2145		% like emptyness test or symbolic equality;
2146		% if Result=[_|_] then the closure needs to be expanded anyhow, so need to try and keep symbolic
2147		;
2148	?	catch_clpfd_overflow_call2(
2149		on_enumeration_warning_with_continue(expand_only_custom_closure_global(CResult,Expansion,check_no_inf,WF),
2150		% check_no_inf: we know it is not definitely infinite; and we do not want warnings for virtual time-outs
2151		% an enumeration warning occured in the expansion scope: keep closure symbolic after all
2152		% NOTE: for this detection to work it is better to delay until the body is ground (CGr)
2153		% and not use a priority too low for WF0, otherwise Expansion will be var and enum warning may occur later
2154		b_compute_comprehension_set_sym_msg(CResult,Info,Result,WF) % Backup Call in case of enum warning
2155		,
2156		equal_object_wf(Result,Expansion,WF) % TrueContinuation
2157		% instantiating Result can trigger other code which fails and confuses on_enumeration_warning
2158		),
2159		b_compute_comprehension_set_sym(CResult,Result,WF)
2160		) % catch_clpfd_overflow_call2
2161		).
2162
2163		b_compute_comprehension_set_sym_msg(CResult,Info,Result,WF) :- CResult = closure(P,_T,B),
2164		silent_mode(off),
2165		% TO DO: should we check that this closure has not been constructed by ProB, e.g., for UNION ??
2166		% e.g., P = ['__RANGE_LAMBDA__'] what about '_zzzz_unary', '_zzzz_binary', '_prj_arg1__', ...
2167		% also: what if the enumeration warning has a pending_abort_error
2168		!,
2169		Msg = 'Keeping comprehension-set symbolic (you may want to use the /*@symbolic*/ pragma to prevent this message, unless it was due to a WD-Error), identifiers: ',
2170		(contains_info_pos(Info) -> Span=Info ; Span=B),
2171		add_message(b_compute_comprehension_set,Msg,P,Span),
2172		b_compute_comprehension_set_sym(CResult,Result,WF).
2173		b_compute_comprehension_set_sym_msg(CResult,_,Result,WF) :-
2174		b_compute_comprehension_set_sym(CResult,Result,WF).
2175
2176
2177		b_compute_comprehension_set_sym(CResult,Result,WF) :-
2178		mark_closure_as_symbolic(CResult,CRS), % prevent doing the same mistake again
2179		equal_object_wf(Result,CRS,b_compute_comprehension_set_sym,WF).
2180
2181
2182		:- use_module(closures,[construct_closure_if_necessary/4]).
2183		b_generate_forall_closure(Parameters,Condition,LocalState,State,Result,WF) :-
2184		split_names_and_types(Parameters,Names,Types),
2185		construct_closure(Names,Types,ClosurePred1,Result),
2186		(LocalState==[],State==[]
2187		-> ClosurePred = Condition % no lookups can be performed anyway; no need to compile
2188		; b_compiler:b_compile(Condition,Names,LocalState,State,ClosurePred,WF) ),
2189		add_texpr_infos(ClosurePred,[quantifier_kind(forall)],ClosurePred1). % info for call_stack
2190
2191
2192
2193		b_generate_closure_if_necessary(Parameters,Condition,LocalState,State,Result,WF) :-
2194		split_names_and_types(Parameters,Names,Types),
2195	?	b_compiler:b_compile(Condition,Names,LocalState,State,ClosurePred,WF),
2196		%print('COMPILED: '),translate:print_bexpr(ClosurePred),nl,
2197		construct_closure_if_necessary(Names,Types,ClosurePred,Result).
2198
2199
2200		:- public convert_list_of_expressions_into_sequence/2.
2201		convert_list_of_expressions_into_sequence(List,SeqValue) :-
2202		convert_list_of_expressions_into_sequence(List,1,Seq),
2203	?	equal_object_optimized(Seq,SeqValue,convert_list_of_expressions_into_sequence).
2204
2205		convert_list_of_expressions_into_sequence([],_,[]).
2206		convert_list_of_expressions_into_sequence([H|T],Cur,[(int(Cur),H)|ConvT]) :-
2207		C1 is Cur+1,
2208		convert_list_of_expressions_into_sequence(T,C1,ConvT).
2209
2210		convert_list_of_expressions_into_set_wf(ListOfElements,Set,Type,WF) :-
2211		list_of_expressions_is_ground(ListOfElements,Ground,OrderedListOfElements),
2212	?	convert_list_of_expressions_into_set1(Ground,OrderedListOfElements,Set,Type,WF).
2213		convert_list_of_expressions_into_set1(true,ListOfElements,Set,_Type,WF) :- %var(Set),
2214	?	\+ (ListOfElements = [H|_], is_symbolic_closure(H)), % list contains symbolic closures, do not try to expand to avl
2215		% see should_be_converted_to_avl_from_lists ?
2216		!, construct_avl_from_lists_wf(ListOfElements,AVLSet,WF),
2217	?	equal_object_wf(AVLSet,Set,convert_list_of_expressions_into_set1,WF).
2218		convert_list_of_expressions_into_set1(_,Seq,Set,Type,WF) :-
2219	?	kernel_objects:max_cardinality(Type,TypeMaxCard),
2220	?	convert_list_of_expressions_into_set2(Seq,1,[],Set,TypeMaxCard,WF).
2221
2222		% TO DO: sort elements : ground elements first
2223		convert_list_of_expressions_into_set2([],_,Set,Res,_,WF) :-
2224	?	equal_object_wf(Set,Res,convert_list_of_expressions_into_set2,WF).
2225		convert_list_of_expressions_into_set2([H|T],MaxSze,SetSoFar,OutSet,TypeMaxCard,WF) :-
2226		%kernel_objects:basic_type_set(Type,IntSet,MaxSze),
2227		check_set_lists_bounded(IntSet,TypeMaxCard,MaxSze),
2228		% TO DO: optimize; avoid traversing or typing elements over and over again
2229		% maybe add a max. sze argument to add_element
2230		add_element_wf(H,SetSoFar,IntSet,WF), % print(add_el(H,SetSoFar,IntSet)),nl,
2231		% TO DO: check if H in OutSet and keep track of which elements have already been covered in OutSet
2232		%check_element_of_wf(H,OutSet,WF), makes tests 114, 115, 118-120, 1063 fail ! % we could also call lazy_try_check_element_of if this turns out to be too expensive
2233		kernel_objects:lazy_try_check_element_of(H,OutSet,WF),
2234		M1 is MaxSze+1,
2235	?	convert_list_of_expressions_into_set2(T,M1,IntSet,OutSet,TypeMaxCard,WF).
2236
2237
2238		:- use_module(inf_arith).
2239
2240		% check that a set does not exceed a certain bound (to prevent infinite
2241		% or overeager enumeration of sets); Warning: will not check custom_explicit_set sizes
2242		check_set_lists_bounded(Set,TypeMaxCard,Bound) :-
2243		inf_arith:infmin(TypeMaxCard,Bound,Card),
2244		(is_inf_or_overflow_card(Card) -> true
2245		; Card<1 -> empty_set(Set)
2246		; check_set_bounded_aux(Set,Card)).
2247
2248		:- block check_set_bounded_aux(-,?).
2249		check_set_bounded_aux(CustomSet,_) :- is_custom_explicit_set(CustomSet,check_set_bounded_aux),!.
2250		check_set_bounded_aux([],_).
2251		check_set_bounded_aux([_|T],Card) :-
2252		C1 is Card-1,
2253		(C1=0 -> empty_set(T) ; check_set_bounded_aux(T,C1)).
2254
2255
2256
2257		% check if the list can be converted into AVL form; if not: re-order list so that ground elements are present first
2258		list_of_expressions_is_ground([],true,[]).
2259		list_of_expressions_is_ground([E|T],Ground,ResList) :-
2260		(should_be_converted_to_avl(E) -> ResList=[E|RT], list_of_expressions_is_ground(T,Ground,RT)
2261		; Ground=false,
2262		bring_ground_elements_forward(T,[E],ResList)
2263		).
2264
2265		bring_ground_elements_forward([],Acc,Acc).
2266		bring_ground_elements_forward([H|T],Acc,Res) :-
2267		(should_be_converted_to_avl(H) -> Res=[H|RT], bring_ground_elements_forward(T,Acc,RT)
2268		; bring_ground_elements_forward(T,[H|Acc],Res)).
2269
2270		:- use_module(kernel_card_arithmetic,[is_inf_or_overflow_card/1, safe_mul/3]).
2271		% compute cardinality of a list of parameters, such as for forall
2272		parameter_list_cardinality([],1).
2273		parameter_list_cardinality([b(identifier(_),BasicType,_)|T],Res) :-
2274	?	parameter_list_cardinality(T,TCard),
2275		(is_inf_or_overflow_card(TCard) -> Res=TCard
2276	?	; kernel_objects:max_cardinality(BasicType,Card),
2277		safe_mul(Card,TCard,Res)
2278		).
2279		% see also basic_type_list_cardinality, now moved to custom_explicit_sets
2280
2281		b_for_all(Parameters,Infos,LHS,RHS,LocalState,State,WF) :-
2282		get_wait_flag1(for_all(Parameters),WF,LWF), % hack: give total_function,... priority to set up domain/range
2283	?	b_for_all_aux(LWF,Parameters,Infos,LHS,RHS,LocalState,State,WF).
2284
2285		:- block b_for_all_aux(-,?,?,?,?,?,?,?).
2286		b_for_all_aux(_,Parameters,Infos,LHS,RHS,LocalState,State,WF) :-
2287		split_names_and_types(Parameters,Names,Types),
2288	?	b_compile(LHS,Names,LocalState,State,CLHS,WF),
2289	?	b_compile(RHS,Names,LocalState,State,CRHS,WF),
2290	?	b_for_all_aux2(Parameters,Names,Types,Infos,CLHS,CRHS,WF).
2291
2292		:- use_module(kernel_tools,[ground_bexpr/1, ground_bexpr_check/2]).
2293		b_for_all_aux2(_,_,_,_,LHS,RHS,_) :-
2294		(is_falsity(LHS) ; is_truth(RHS)),
2295		!. % quantifier always true
2296		b_for_all_aux2(Parameters,CParameters,CParameterTypes,Infos,LHS,RHS,WF) :-
2297		ground_bexpr(LHS),
2298	?	\+ obvious_enumeration(LHS,CParameters), % if we have an obvious (small) enumeration in the LHS it is often better simply to enumerate and check the RHS for every instance
2299		ground_bexpr(RHS), %print(not_exists_forall(Parameters,LHS,RHS)),nl,
2300		!,
2301		b_for_all_find_counter_example(Parameters,CParameters,CParameterTypes,Infos,LHS,RHS,WF).
2302		b_for_all_aux2(Parameters,CParameters,CParameterTypes,Infos,LHS,RHS,WF) :-
2303	?	parameter_list_cardinality(Parameters,ParCard),
2304		peel_implications(Parameters,ParCard,LHS,RHS, LHS2,RHS2),
2305	?	b_for_all_aux3(Parameters,ParCard,CParameters,CParameterTypes,Infos,LHS2,RHS2,WF).
2306
2307		b_for_all_aux3(Parameters,ParCard,CParameters,CParameterTypes,Infos,LHS,RHS,WF) :-
2308		%large_domain(Parameters,ParCard,LHS),
2309		is_infinite_or_very_large_explicit_set(closure(CParameters,CParameterTypes,LHS),10000000),
2310		% the domain is so large that we cannot possibly check all instances
2311		% in this case: we prefer to look for a counter example in the hope that the constraint solver can narrow down the search by combining LHS and not(RHS)
2312		!,
2313		perfmessage(forall,'Large forall domain: ',ParCard,Infos),
2314		ground_bexpr_check(LHS,LG),
2315		ground_bexpr_check(RHS,RG),
2316		when((nonvar(LG),nonvar(RG)),
2317		b_for_all_find_counter_example(Parameters,CParameters,CParameterTypes,Infos,LHS,RHS,WF)
2318		).
2319		b_for_all_aux3(Parameters,ParCard,_CP,_,Infos,LHS,RHS,WF) :-
2320		if(expand_forall_quantifier(Parameters,LHS,RHS,Infos,WF,ReificationVariable),
2321		(
2322		perfmessage(good(forall),'Reified forall by expanding into conjunction: ',LHS),
2323		ReificationVariable=pred_true),
2324		( % print(normal_forall(Parameters)),nl,
2325		b_generate_for_all_list_domain1(Parameters,ParCard,LHS,RHS,[],[],AllSolList,NewRHS,WF),
2326	?	expand_forall1(AllSolList,NewRHS,Parameters,WF)
2327		)).
2328
2329
2330		% a treatment of for all where we look for counter examples satisfying LHS & not(RHS)
2331		b_for_all_find_counter_example(Parameters,CParameters,CParameterTypes,Infos,LHS,RHS,WF) :-
2332		% if LHS is Parameters: avl_set(V) then we probably should not apply this rule ?
2333		create_negation(RHS,NegRHS),
2334		conjunct_predicates_with_pos_info(LHS,NegRHS,Pred0),
2335		% format('looking for: ~w ',[CParameters]), translate:print_bexpr(LHS),nl, translate:print_bexpr(NegRHS),nl,
2336		perfmessage(good(forall),translating_forall_into_not_exists(CParameters),LHS),
2337		add_texpr_infos(Pred0,[quantifier_kind(forall)],ClosureBody1), % for call_stack
2338		init_quantifier_wait_flag(WF,not(forall),Parameters,ParValues,Infos,LocalWF), % relevant for test 1904
2339		not_with_enum_warning_and_possible_delay(
2340		(custom_explicit_sets:b_test_closure(CParameters,CParameterTypes,ClosureBody1,ParValues,negative,LocalWF),
2341		perfmessage_bexpr(forall,forall_counter_example(CParameters,ParValues),LHS)
2342		),LocalWF, WF, forall(CParameters), Infos).
2343
2344		:- use_module(library(timeout),[time_out/3]).
2345		not_with_enum_warning_and_possible_delay(C,WF,OuterWF,PP,Span) :-
2346		get_preference(disprover_mode,true),
2347		% in disprover mode we do not track WD errors, no need to start_attach_inner_abort_errors
2348		!,
2349		% delay potentially expensive quantifications in the hope of finding other contradictions earlier
2350		if( (time_out(not_with_enum_warning(C,WF,PP,Span),20,TRes),TRes \== time_out),
2351		copy_wfe_from_inner_if_necessary(WF,OuterWF),
2352		(get_wait_flag(2,not_with_enum_warning_and_possible_delay,OuterWF,LWF), % which priority to use ??
2353		debug_println(19,delay_not_in_disprover_mode),
2354		not_with_enum_warning_delay(C,LWF,WF,OuterWF,PP,Span))).
2355		not_with_enum_warning_and_possible_delay(C,WF,OuterWF,PP,Span) :-
2356		start_attach_inner_abort_errors(Level,not_with_enum_warning),
2357		call_cleanup(not_with_enum_warning(C,WF,PP,Span),
2358		re_attach_pending_inner_abort_errors(Level,OuterWF,_)),
2359		copy_wfe_from_inner_if_necessary(WF,OuterWF).
2360
2361
2362		:- block not_with_enum_warning_delay(?,-,?,?,?,?).
2363		not_with_enum_warning_delay(C,_,WF,OuterWF,PP,Span) :-
2364		debug_println(19,trigger_not_with_enum_warning_delay),
2365		not_with_enum_warning(C,no_wf_available,PP,Span),
2366		copy_wfe_from_inner_if_necessary(WF,OuterWF).
2367
2368		:- use_module(avl_tools,[quick_avl_approximate_size/2]).
2369		obvious_enumeration(LHS,[Id]) :- % TO DO : allow multiple ids
2370		% TO DO: unify with is_for_all_set_membership_predicate code below
2371		TLHSMembership = b(LHSMembership,_,_),
2372	?	member_conjunct(TLHSMembership,LHS,_),
2373		obvious_enum_aux(LHSMembership,Id).
2374
2375		obvious_enum_aux(member(TID,b(value(VAL),_,_)),ID) :- get_texpr_id(TID,ID),
2376		nonvar(VAL), VAL = avl_set(AVL), % TO DO: also support interval closures ?
2377		quick_avl_approximate_size(AVL,Size),
2378		Size<256.
2379		%obvious_enum_aux(equal(LHS,RHS),ID) :- % stillposes problem for test 231, investigate
2380		% ( get_texpr_id(LHS,ID) -> get_texpr_expr(RHS,value(_))
2381		% ; get_texpr_id(RHS,ID) -> get_texpr_expr(LHS,value(_))).
2382		% % TODO: do we need to accept integer(.),... literals?
2383
2384		% expands forall quantifier and thus enables that we also propagate from right to left
2385		% This helps for test 1397 (HandshakeSimple_TotFun)
2386		% TO DO: directly call the code which tries to expand a forall quantifier
2387		expand_forall_quantifier(Parameters,LHS,RHS,Infos,WF,ReificationVariable) :-
2388		(preferences:preference(use_smt_mode,true) -> true
2389		; preferences:preference(solver_strength,SS), SS>9), % sometimes contrapositive checking maybe not useful; see test 1368
2390		% TO DO: investigate and provide more principled heuristic
2391		b_interpreter_check:b_check_forall_wf(Parameters,LHS,RHS,Infos,[],[],WF,ReificationVariable).
2392
2393		% rewrite !(x,..).( TRUTH => (LHS2 => RHS2)) into !(x,...).(LHS2 => RHS2)
2394		peel_implications(Parameters,ParCard,LHS,RHS, NewLHS,NewRHS) :-
2395		%print(forall),nl, print(Parameters),nl,print(LHS),nl,
2396		% this patterns occurs often in Event-B translations to classical B
2397		LHS=b(truth,_,_),
2398		RHS=b(implication(LHS2,RHS2),_,_), % TO DO: maybe also accept nested forall and then add to Parameters?
2399		(is_inf_or_overflow_card(ParCard) -> true ; ParCard>50),
2400		% larger bound than below: maybe user explicitly wants to expand it
2401		!,
2402		peel_implications(Parameters,ParCard,LHS2,RHS2, NewLHS,NewRHS).
2403		peel_implications(_,_,LHS,RHS, LHS,RHS).
2404
2405		b_generate_for_all_list_domain_nolwf(Parameters,LHS,RHS,LS,S,ForAllDomain,NewRHS,WF) :-
2406	?	parameter_list_cardinality(Parameters,ParCard),
2407		peel_implications(Parameters,ParCard,LHS,RHS, LHS2,RHS2),
2408		b_generate_for_all_list_domain1(Parameters,ParCard,LHS2,RHS2,LS,S,OForAllDomain,NewRHS,WF),
2409		optlist_to_list(OForAllDomain,ForAllDomain). % resolve any optional_value/2 items
2410
2411		% generate the domain of a Universally Quantified Formula as a list
2412		b_generate_for_all_list_domain1(Parameters,_ParCard,LHS,RHS,LS,S,ForAllDomain,NewRHS,WF) :-
2413		% optimized treatment for formulas of the form !x.(x:S => RHS) or !(x,y).(x|->y:S => RHS)
2414		% to do: expand to more formulas, such as !(x,y).(x:S & y:T => RHS)
2415		% or !y.(y:1..(n-1) & f(y)=TRUE => f(y+1)=TRUE) --> !y.(y:1..(n-1) => (f(y)=TRUE => f(y+1)=TRUE))
2416		% or we could try and reify set membership for small domains and trigger implication
2417		is_for_all_set_membership_predicate(LHS,Parameters,Set,Pattern,ParameterValues),!,
2418		perfmessages_bexpr_call(good(forall),['Detected forall set membership over ',Ps,': '],
2419		LHS,bsyntaxtree:def_get_texpr_ids(Parameters,Ps)),
2420		NewRHS=RHS,
2421		b_generate_set_for_all_domain(Set,LS,S,Pattern,ParameterValues,ForAllDomain,WF).
2422		b_generate_for_all_list_domain1(Parameters,ParCard,LHS,RHS,LS,S,ForAllDomain,NewRHS,WF) :-
2423		b_generate_forall_closure(Parameters,LHS,LS,S,Closure,WF), % POSSIBLY NO NEED TO COMPILE
2424		b_generate_for_all_domain2(Closure,Parameters,ParCard,LHS,RHS,ForAllDomain,NewRHS,WF).
2425
2426		b_generate_for_all_domain2(Closure,_Parameters,_,LHS,RHS,ForAllDomain,NewRHS,WF) :-
2427		(LHS=b(truth,pred,_) ; ground_value(Closure)),
2428		!, NewRHS=RHS, % nl,print('FORALL EXPAND: '),(ground_value(Closure) -> print(ground(_Parameters)),nl, print_bexpr(LHS),nl ; print('NONGROUND!!'),nl,print_bexpr(RHS),nl), %%
2429		b_expand_closure_forall_to_list(Closure,ForAllDomain,WF).
2430		b_generate_for_all_domain2(_,Parameters,_,LHS,RHS,ForAllDomain,NewRHS,WF) :-
2431		is_a_conjunct(LHS,_,_), % otherwise we have already checked for set_membership above !
2432		LHS_Membership = b(member(_,_),_,_), % TO DO: also allow conjuncts
2433	?	member_conjunct(LHS_Membership,LHS,RestLHS),
2434		% !(x). ( x:Set & RestLHS => RHS) ---> !(x).(x:Set => (RestLHS => RHS))
2435		is_for_all_set_membership_predicate(LHS_Membership,Parameters,Set,Pattern,ParameterValues),
2436	?	max_cardinality_ok_for_expansion(Set,100,[],[]), % TO DO: simplify LS,S argument <----
2437		!,
2438		% as we expand Set without RHS predicate, check if this is ok
2439		% indeed maximum cardinality of Set could be infinite !! !x.(x:NATURAL1 & x<N => P)
2440		% print('Splitting for all conjunct: '), print(Parameters),nl, print_bexpr(LHS_Membership),nl,print_bexpr(RestLHS),nl, %%
2441		perfmessage_bexpr(good(forall),'Splitting LHS of forall: ',LHS),
2442		NewRHS = b(implication(RestLHS,RHS),pred,[]), % TO DO: extract & join info
2443		b_generate_set_for_all_domain(Set,[],[],Pattern,ParameterValues,ForAllDomain,WF).
2444		b_generate_for_all_domain2(Closure,_Parameters,ParCard,LHS,RHS,ForAllDomain,NewRHS,WF) :-
2445		(is_inf_or_overflow_card(ParCard) -> true ; ParCard>8),
2446		!,
2447		NewRHS=RHS,
2448		perfmessage_bexpr(forall,'No optimisations applicable to forall (will delay until all variables are bound): ',LHS), % maybe we should generate this message only if ForAllDomain is var ?
2449		b_expand_closure_forall_to_list(Closure,ForAllDomain,WF).
2450		b_generate_for_all_domain2(_Closure,Parameters,ParCard,LHS,RHS,ForAllDomain,NewRHS,WF) :-
2451		NewLHS=b(truth,pred,[]), NewRHS=b(implication(LHS,RHS),pred,[]),
2452		b_generate_forall_closure(Parameters,NewLHS,[],[],Closure,WF),
2453		perfmessages_bexpr(good(forall),['Expanding forall with finite parameter type, card = ',ParCard,': '],LHS),
2454		b_expand_closure_forall_to_list(Closure,ForAllDomain,WF).
2455
2456		% code to decide whether a for all should be expanded if the
2457		% predicate contains a set membership predicate : !x.( (P & x:S & P') => Q)
2458		max_cardinality_ok_for_expansion(b(Expr,Type,_Info),Limit,LS,S) :- % which value to choose for Limit ??
2459	?	kernel_objects:max_cardinality(Type,TypeCard),
2460		( (number(TypeCard),TypeCard =< Limit) -> true ;
2461		max_cardinality_ok_for_expansion2(Expr,Limit,TypeCard,LS,S)).
2462
2463		max_cardinality_ok_for_expansion1(b(E,_,_),Limit,TC,LS,S) :-
2464		max_cardinality_ok_for_expansion2(E,Limit,TC,LS,S).
2465
2466		:- use_module(custom_explicit_sets,[efficient_card_for_set/3]).
2467
2468		max_cardinality_ok_for_expansion2(set_extension(E),Limit,_TC,_,_) :- !, length(E,Len), Len =< Limit.
2469		max_cardinality_ok_for_expansion2(interval(Up,Low),Limit,_TC,LS,S) :- !,
2470		get_integer(UpI,Up,LS,S), get_integer(LowI,Low,LS,S),
2471		UpI-LowI<Limit.
2472		max_cardinality_ok_for_expansion2(integer_set(GS),Limit,_TC,_LS,_S) :- !, b_global_set_cardinality(GS,Card),
2473		number(Card), Card =< Limit.
2474		max_cardinality_ok_for_expansion2(set_subtraction(A,_),Limit,TC,LS,S) :- !,
2475		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S).
2476		max_cardinality_ok_for_expansion2(image(RelA,_),Limit,TC,LS,S) :- !,
2477		max_cardinality_ok_for_expansion1(RelA,Limit,TC,LS,S).
2478		max_cardinality_ok_for_expansion2(function(_RelA,_),_Limit,_TC,_LS,_S) :- !,
2479		fail. % TO DO: we should look at the size of the range elements
2480		% max_cardinality_ok_for_expansion1(_RelA,_Limit,_TC,_LS,_S).
2481		max_cardinality_ok_for_expansion2(intersection(A,B),Limit,TC,LS,S) :- !,
2482		(max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S) -> true ; max_cardinality_ok_for_expansion1(B,Limit,TC,LS,S)).
2483		max_cardinality_ok_for_expansion2(union(A,B),Limit,TC,LS,S) :- !,
2484		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S), max_cardinality_ok_for_expansion1(B,Limit,TC,LS,S).
2485		max_cardinality_ok_for_expansion2(range(A),Limit,TC,LS,S) :- !,
2486		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S).
2487		max_cardinality_ok_for_expansion2(domain(A),Limit,TC,LS,S) :- !,
2488		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S).
2489		max_cardinality_ok_for_expansion2(domain_restriction(_A,B),Limit,TC,LS,S) :- !,
2490		max_cardinality_ok_for_expansion1(B,Limit,TC,LS,S). % note: finite A does not guarantee finite result
2491		max_cardinality_ok_for_expansion2(domain_subtraction(_A,B),Limit,TC,LS,S) :- !,
2492		max_cardinality_ok_for_expansion1(B,Limit,TC,LS,S).
2493		max_cardinality_ok_for_expansion2(range_restriction(A,_B),Limit,TC,LS,S) :- !,
2494		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S). % note: finite B does not guarantee finite result
2495		max_cardinality_ok_for_expansion2(range_subtraction(A,_B),Limit,TC,LS,S) :- !,
2496		max_cardinality_ok_for_expansion1(A,Limit,TC,LS,S).
2497		max_cardinality_ok_for_expansion2(direct_product(A,B),Limit,TC,LS,S) :- !,
2498		max_cardinality_ok_for_expansion2(cartesian_product(A,B),Limit,TC,LS,S).
2499		max_cardinality_ok_for_expansion2(parallel_product(A,B),Limit,TC,LS,S) :- !,
2500		max_cardinality_ok_for_expansion2(cartesian_product(A,B),Limit,TC,LS,S).
2501		max_cardinality_ok_for_expansion2(cartesian_product(A,B),Limit,TC,LS,S) :- !,
2502		ILimit is Limit//2, ILimit>0, %use sqrt ?
2503		max_cardinality_ok_for_expansion1(A,ILimit,TC,LS,S),
2504		max_cardinality_ok_for_expansion1(B,ILimit,TC,LS,S).
2505		max_cardinality_ok_for_expansion2(value(S),Limit,_TC,_LS,_S) :- !,
2506		get_max_card_for_value(S,MaxCard),
2507		MaxCard =< Limit.
2508		max_cardinality_ok_for_expansion2(identifier(_ID),_Limit,TC,_LS,_S) :- !, number(TC).
2509		% TO DO: check if ID is fully defined; if so use card else accept as it will
2510		% probably be represented by a list and the forall constraints could be useful in finding ID's value
2511		% we have to store/compute ID anyway (could be infinite closure; hence check that TC is a number); a bit of a hack; is there a more principled way?
2512		max_cardinality_ok_for_expansion2(external_function_call(_,_),_,_,_,_) :- !,fail.
2513		max_cardinality_ok_for_expansion2(lazy_lookup_expr(_),_,_,_,_) :- !,fail.
2514		max_cardinality_ok_for_expansion2(record_field(_,_),_Limit,_TC,_LS,_S) :- !, fail.
2515		max_cardinality_ok_for_expansion2(E,Limit,TC,_LS,_S) :- functor(E,F,N),
2516		print(unknown_max_card(F/N,Limit,TC)),nl,fail.
2517
2518
2519		:- use_module(kernel_cardinality_attr,[clpfd_card_domain_for_var/3]).
2520
2521		get_max_card_for_value(S,MaxCard) :- var(S), !,
2522		clpfd_card_domain_for_var(S,_,Max), number(Max),
2523		MaxCard=Max.
2524		get_max_card_for_value([],R) :- !, R=0.
2525		get_max_card_for_value([_|T],R) :- !,get_max_card_for_value(T,TMax), R is TMax+1.
2526		get_max_card_for_value(S,Card) :- efficient_card_for_set(S,Card,C),!,
2527		call(C), number(Card).
2528
2529
2530		get_integer(X, b(Expr,integer,_),LS,S) :- get_integer2(Expr,X,LS,S).
2531		get_integer2(integer(X),X,_,_) :- number(X).
2532		get_integer2(identifier(Id),Val,LS,S) :- lookup_value(Id,LS,S,int(Val)), number(Val).
2533
2534		member_conjunct(Predicate,Conjunction,Rest) :-
2535		conjunction_to_list(Conjunction,List),
2536	?	select(Predicate,List,RestList),
2537		conjunct_predicates(RestList,Rest).
2538		% member_conjunct(Conj,Conj,b(truth,pred,[])). covered by case above
2539
2540		b_generate_set_for_all_domain(Set,LS,S,Pattern,ParameterValues,ForAllDomain,WF) :-
2541		b_compute_expression(Set,LS,S,EvSet,WF),
2542		expand_custom_set_to_list_wf(EvSet,ESet,_Done,b_generate_set_for_all_domain,WF),
2543		filter_and_convert_list_to_parameter_tuples(ESet,Pattern,ParameterValues,ForAllDomain).
2544
2545
2546		% check if it is a predicate of the form x:S or x:Sx & y:Sy ... which we can optimize
2547		% (i.e. compute SET before all values inside it are fully known)
2548		is_for_all_set_membership_predicate(LHS,Parameters,Set,Pattern,ParameterValues) :-
2549		% print('CHECK FORALL : '), translate:print_bexpr(LHS),nl,nl,
2550		get_texpr_ids(Parameters,ParIDs), % TO DO: call get_texpr_ids before
2551		same_length(ParIDs,ParameterValues),
2552		is_for_all_set_membership_predicate2(LHS,ParIDs,ParIDs,UnmatchedParIDs,Set,Pattern,ParameterValues,_UPV),
2553		UnmatchedParIDs=[].
2554
2555		% TODO: maybe also deal with existential quantifiers #x.(x|->y:Set) -> in Pattern x becomes free var
2556		is_for_all_set_membership_predicate2(LHS,All,ParIDs,UnmatchedParIDs,Set,Pattern,ParameterValues,UPV) :-
2557		is_member_test(LHS,Element,Set),
2558		!,
2559		identifiers_not_used_in_bexp(All,Set),
2560		convert_to_prolog_pattern_match(Element,ParIDs,UnmatchedParIDs,Pattern,ParameterValues,UPV).
2561		% TO DO: also allow failing pattern matches ?!; at least when splitting
2562		is_for_all_set_membership_predicate2(LHS,All,ParIDs,ParIDs2,Set,
2563		(Pat1,Pat2),ParameterValues,UPV) :-
2564		is_a_conjunct(LHS,LHS1,LHS2), % we could have something of the form x:Sx & y:Sy ...
2565		Set = b(cartesian_product(Set1,Set2),couple(T1,T2),[]),
2566		is_for_all_set_membership_predicate2(LHS1,All,ParIDs, ParIDs1,Set1,Pat1,ParameterValues,PV1),
2567		get_texpr_type(Set1,T1),
2568		!,
2569		is_for_all_set_membership_predicate2(LHS2,All,ParIDs1,ParIDs2,Set2,Pat2,PV1,UPV),
2570		get_texpr_type(Set2,T2).
2571
2572		% TO DO: maybe use a more general test to be reused in other places
2573		is_member_test(b(P,_,_),Element,Set) :- is_member_test_aux(P,Element,Set).
2574		is_member_test_aux(member(Element,Set),Element,Set).
2575		% also detect equalities: important for tests 28,29 after b_compiler can introduce equalities for singleton set memberships
2576		is_member_test_aux(equal(Element,SetVal),Element,Set) :- % TO DO : also other direction + other kinds of values ?
2577		SetVal = b(value(SV),T,I),
2578		Set = b(value([SV]),set(T),I).
2579
2580		identifiers_not_used_in_bexp(IDList,Expr) :-
2581		find_identifier_uses(Expr,[],Used),
2582		id_check(IDList,Used).
2583		id_check([],_).
2584		id_check([ID|T],Used) :-
2585		nonmember(ID,Used), !,
2586		id_check(T,Used).
2587
2588		% check if an expression can be converted to a Prolog linear unification/pattern match
2589		% give an list of free identifiers IDS
2590		convert_to_prolog_pattern_match(b(E,_,_),IDS,OutIDS,Pattern,VarsIn,VarsOut) :-
2591		convert_to_prolog_pattern_match2(E,IDS,OutIDS,Pattern,VarsIn,VarsOut).
2592
2593		convert_to_prolog_pattern_match2(identifier(ID),IDsIn,IDsOut,PatVariable,VarsIn,VarsOut) :-
2594		% check that the identifier is in the list of quantified variables and thus unbound
2595		!,
2596	?	(nth1(Nr,IDsIn,ID,IDsOut)
2597		-> nth1(Nr,VarsIn,PatVariable,VarsOut) % put fresh PatVariable in the Pattern
2598		),!.
2599		convert_to_prolog_pattern_match2(couple(ID1,ID2),IDS,OutIDS,Pattern,VarsIn,VarsOut) :-
2600		Pattern = (Pat1,Pat2),
2601		convert_to_prolog_pattern_match(ID1,IDS,RemIDS,Pat1,VarsIn,VarsInt),
2602		convert_to_prolog_pattern_match(ID2,RemIDS,OutIDS,Pat2,VarsInt,VarsOut).
2603		convert_to_prolog_pattern_match2(value(V),IDsIn,IDsOut,Pattern,VarsIn,VarsOut) :-
2604		can_be_used_for_unification(V), % check if we can use Prolog unification for equality
2605		!, Pattern=V, IDsOut=IDsIn, VarsIn=VarsOut.
2606		% TO DO: records?
2607
2608		% a pattern match code to be used with above; ensure we do not instantiate values
2609		pattern_match(PatVar,Val,Res) :- var(PatVar),!,PatVar=Val, Res=pred_true. % we have a free pattern variable
2610		pattern_match((Pat1,Pat2),(V1,V2),Res) :- !,
2611		pattern_match(Pat1,V1,R1), conjoin_simple(R1,R2,Res),
2612		pattern_match(Pat2,V2,R2).
2613		pattern_match(GroundPatVal,Val,Res) :- % we have a value that can_be_used_for_unification
2614		when( ?=(GroundPatVal,Val), (GroundPatVal=Val -> Res=pred_true ; Res=pred_false)).
2615
2616		:- block conjoin_simple(-,?,?). % TO DO: also allow second arg to unblock
2617		conjoin_simple(pred_true,X,X).
2618		conjoin_simple(pred_false,_,pred_false).
2619
2620		% similar to get_template(V,T,[])
2621		% but more restricted; we only accept those values where equality corresponds to Prolog unification
2622		% get_template is different and can assume normalized values, e.g., for empty set
2623		% pairs are treated above in convert_to_prolog_pattern_match2
2624		can_be_used_for_unification(V) :- var(V),!,fail.
2625		can_be_used_for_unification(int(V)) :- nonvar(V).
2626		can_be_used_for_unification(string(S)) :- ground(S).
2627		can_be_used_for_unification(fd(S,T)) :- ground(S), ground(T).
2628		can_be_used_for_unification(pred_false).
2629		can_be_used_for_unification(pred_true).
2630
2631
2632
2633		% take a list and a pattern and filter the values that do not match the Pattern
2634		% Unification with the Pattern also instantiates the ParameterValues
2635		% TODO: Instead of converting to a Prolog Unification we could use kernel_equality instead of pattern_match
2636		% but this is not obvious, as the pattern contains free variables and equality would never return true
2637		% we would need to apply kernel_equality only to the ground pattern parts
2638		:- block filter_and_convert_list_to_parameter_tuples(-,?,?,?).
2639		filter_and_convert_list_to_parameter_tuples([],_,_,[]).
2640		filter_and_convert_list_to_parameter_tuples([H|T],Pattern,ParameterValues,Res) :-
2641		copy_term((Pattern,ParameterValues),(CPat,CPV)),
2642		pattern_match(CPat,H,PredRes), % check if pattern matches new element H in set; careful not to instantiate H
2643	?	filter_and_convert_list_to_parameter_tuples_aux(PredRes,CPV,T,Pattern,ParameterValues,Res).
2644
2645		:- block filter_and_convert_list_to_parameter_tuples_aux(-,?,-,?,?,?).
2646		filter_and_convert_list_to_parameter_tuples_aux(PredRes,CPV,T,Pattern,ParameterValues,Res) :-
2647		var(PredRes),!, % we cannot decide yet whether the optional value is to be used or not
2648		Res = [optional_value(CPV,PredRes)|RT], % create constructor for map_optlist or similar
2649		filter_and_convert_list_to_parameter_tuples(T,Pattern,ParameterValues,RT).
2650		filter_and_convert_list_to_parameter_tuples_aux(PredRes,CPV,T,Pattern,ParameterValues,Res) :-
2651		(PredRes = pred_true % we have a match, universal quantifier applies to H
2652		-> Res = [CPV|RT]
2653		; % element of set does not match pattern; universal quantifier does not apply
2654		% ProB used to only accept non-failing pattern matches;
2655		% now we also accept tuples with static parts where Prolog unification can fail
2656		Res=RT
2657		),
2658	?	filter_and_convert_list_to_parameter_tuples(T,Pattern,ParameterValues,RT).
2659
2660		:- use_module(tools,[map_optlist/2,optlist_to_list/2]).
2661		:- use_module(library(lists),[maplist/3]).
2662		expand_forall1(OList,RHS,Parameters,WF) :-
2663		ground_bexpr(RHS), % because compiled this means we cannot do any constraint propagation on variables in RHS
2664		optlist_to_list(OList,List),
2665		ground_value(List), % ditto here: no variables on which we could do constraint propagation
2666		%% preferences:get_preference(double_evaluation_when_analysing,false), % causes test 1112 to fail TO DO:fix
2667		% otherwise we do not have a real redundancy wrt to not exists check
2668		debug_println(15,ground_forall_translating_into_not_exists(Parameters)),
2669		!,
2670		%kernel_waitflags:init_wait_flags(LocalWF,[expansion_context(forall,Parameters)]),
2671		init_quantifier_wait_flag(WF,forall,Parameters,ParResult,unknown,LocalWF),
2672		% Advantage over treatment below: NegRHS is interpreted only once
2673		% but we cannot provide any instantiations and there must not be any links with variables outside of the forall !!
2674		create_negation(RHS,NegRHS),
2675		not_with_enum_warning( (
2676		b_interpreter:test_forall_instance(NegRHS,Parameters,LocalWF,negative,ParResult), % can fail; if inconsistency detected in WF0
2677		kernel_waitflags:ground_det_wait_flag(LocalWF),
2678		member(ParResultInList,List), % check the body for every solution
2679		lists:maplist(kernel_objects:equal_object,ParResultInList,ParResult), % match parameters with the solutions of the domain
2680		kernel_waitflags:ground_wait_flags(LocalWF) % do not ground EF? ground_constraintprop_wait_flags ground_inner_wait_flags
2681		), LocalWF, forall(Parameters), RHS
2682		).
2683		expand_forall1(List,RHS,Parameters,WF) :-
2684	?	map_optlist(b_interpreter:test_forall_instance(RHS,Parameters,WF,positive),List).
2685
2686
2687		test_forall_instance(RHS,Parameters,WF,NegationContext,ParResult) :-
2688		LocalState=[],State=[],
2689	?	if(set_up_typed_localstate(Parameters,ParResult,_TypedVals,LocalState,NewLocalState,NegationContext),
2690		true,
2691		(nl,print(set_up_typed_localstate_failed(Parameters,ParResult,_,LocalState,NewLocalState)),nl,
2692		% it can happen that ParResult has constraints on it and that setting up the typing info detects the error
2693		% add_internal_error('Call failed: ', set_up_typed_localstate(Parameters,ParResult,_,LocalState,NewLocalState)),
2694		fail)),
2695	?	b_optimized_b_test_instance(RHS,NewLocalState,State,WF).
2696
2697		reification_relevant_for_op(implication(_,_)).
2698		reification_relevant_for_op(equivalence(_,_)).
2699		reification_relevant_for_op(disjunct(_,_)).
2700		% TODO: maybe check if a conjunct contains implication
2701		% relevant for example for: n=2000 & f:1..n-->BOOL & !i.(i:2..n => (f(i)=TRUE =>f(i-1)=FALSE)) & f(1)=TRUE
2702
2703		b_optimized_b_test_instance(RHS,NewLocalState,State,WF) :-
2704		get_texpr_expr(RHS,RE), reification_relevant_for_op(RE), % we will attempt reification
2705		attempt_reification,
2706		\+ always_well_defined(RHS), % this will prevent reification
2707		!,
2708		% try and compile in the hope that now the WD issue disappears:
2709		b_compiler:b_optimize(RHS,[],NewLocalState,State,NewRHS,WF),
2710		b_test_boolean_expression(NewRHS,NewLocalState,State,WF).
2711		b_optimized_b_test_instance(RHS,NewLocalState,State,WF) :-
2712	?	b_test_boolean_expression(RHS,NewLocalState,State,WF).
2713		% using b_test_inner_boolean_expression considerably slows down NQueens, Sudoku,...
2714		% WF=InnerWF. /* give the boolean expression a chance to do ground propagations first */
2715
2716
2717		% use this when the test boolean expression could be called with WF0 already set
2718		% give the inner expression a chance to do the deterministic stuff first
2719		b_test_inner_boolean_expression(Pred,LocalState,State,WF) :-
2720		kernel_waitflags:clone_wait_flags_from1(WF,GroundUponFinish,WF2),
2721		% set WF0 to variable to propagate deterministic infos first:
2722	?	b_test_boolean_expression(Pred,LocalState,State,WF2),
2723	?	kernel_waitflags:clone_wait_flags_from1_finish(WF,GroundUponFinish,WF2).
2724		% the same for testing negation of a predicate:
2725		b_not_test_inner_boolean_expression(Pred,LocalState,State,WF) :-
2726		kernel_waitflags:clone_wait_flags_from1(WF,GroundUponFinish,WF2),
2727		% set WF0 to variable to propagate deterministic infos first:
2728		b_not_test_boolean_expression(Pred,LocalState,State,WF2),
2729	?	kernel_waitflags:clone_wait_flags_from1_finish(WF,GroundUponFinish,WF2).
2730
2731		/* now the same as above; but without converting list of values into pairs */
2732		:- assert_pre(b_interpreter:b_expand_closure_forall_to_list(Closure,_Result,_WF),
2733		(nonvar(Closure), custom_explicit_sets:is_closure(Closure,_Parameters,_ParameterTypes,ClosureBody),
2734		nonvar(ClosureBody),
2735		bsyntaxtree:check_if_typed_predicate(ClosureBody))).
2736		:- assert_post(b_interpreter:b_expand_closure_forall_to_list(_Closure,Result,_WF),
2737		b_interpreter:value_type(Result)).
2738		b_expand_closure_forall_to_list(Closure,Result,WF) :- nonvar(Closure),
2739		Closure = closure(Parameters,ParameterTypes,ClosureBody),
2740		!,
2741		% print('Expand closure forall: '), translate:print_bexpr(ClosureBody),nl,
2742		% at the moment we may wait too long before expanding this closure
2743		% what if we have f(1) in the ClosureBody: in principle we only need to wait until f(1) known or even f sekeleton set up ? compilation now solves this issue ?
2744		(performance_monitoring_on,
2745		term_variables(ClosureBody,Vars),
2746		Vars \= []
2747		->
2748		perfmessagecall(delaying_forall(Parameters,vars(Vars),out(ParValues)),
2749		translate:print_bexpr(ClosureBody),ClosureBody)
2750		; true),
2751		ground_bexpr_check(ClosureBody,BodyGround),
2752		add_texpr_infos(ClosureBody,[quantifier_kind(forall)],ClosureBody1), % for call_stack
2753		delay_setof_list_wf( ParValues,
2754		%% (print_bt_message(expanding_forall_closure(Parameters,ClosureBody,ParValues)), %%
2755		custom_explicit_sets:b_test_closure(Parameters,ParameterTypes,ClosureBody1,
2756		ParValues,all_solutions,WF)
2757		%% ,print_bt_message(expanded(Parameters,ParValues)) ) %%
2758		,
2759		Result,
2760		BodyGround,WF).
2761		b_expand_closure_forall_to_list(Closure,Result,WF) :-
2762		add_internal_error('Illegal Call: ', b_expand_closure_forall_to_list(Closure,Result,WF)),
2763		fail.
2764
2765
2766		:- assert_pre(b_interpreter:set_up_typed_localstate(V,S,_), (list_skeleton(V),list_skeleton(S))).
2767		:- assert_post(b_interpreter:set_up_typed_localstate(_,_,R),list_skeleton(R)).
2768
2769		set_up_typed_localstate(Identifiers,InState,OutState) :-
2770	?	set_up_typed_localstate(Identifiers,_FreshVars,_TypedVals,InState,OutState,positive).
2771
2772		:- use_module(b_enumerate,[construct_typedval_infos/4]).
2773		set_up_typed_localstate([],[],[],State,State,_).
2774		set_up_typed_localstate([Identifier|IdRest],[Val|ValRest],[typedval(Val,Type,Var,TINFO)|TRest],
2775		% TO DO: add info field to typedval: source_span, and lambda_result/do_not_enumerate infos
2776		InState,OutState,NegationContext) :-
2777		% The other way round (first add Identfier, then IdRest) would be more efficient,
2778		% but we do it this way to keep compatibility with a previous version.
2779		% In specfile:compute_operation_effect, the arguments of an operation are in the same order than in the store
2780	?	set_up_typed_localstate(IdRest,ValRest,TRest,InState,InterState,NegationContext),
2781		def_get_texpr_id(Identifier,Var), get_texpr_type(Identifier,Type),
2782		get_texpr_info(Identifier,Info),
2783		triggers_enum_warning(Var,Type,Info,NegationContext,TriggersEnumWarning),
2784		get_texpr_info(Identifier,Infos),construct_typedval_infos(Var,Infos,TriggersEnumWarning,TINFO),
2785	?	add_typed_var_to_localstate(Var,Val,Type,InterState,OutState).
2786
2787		% same version; but with list of atomic ids and list of types
2788		set_up_typed_localstate2([],[],_,[],[],State,State,_).
2789		set_up_typed_localstate2([Var|IdRest],[Type|TyRest],Infos,[Val|ValRest],[typedval(Val,Type,Var,TINFO)|TRest],
2790		InState,OutState,NegationContext) :-
2791		% The other way round (first add Identfier, then IdRest) would be more efficient,
2792		% but we do it this way to keep compatibility with a previous version.
2793		% In specfile:compute_operation_effect, the arguments of an operation are in the same order than in the store
2794	?	set_up_typed_localstate2(IdRest,TyRest,Infos,ValRest,TRest,InState,InterState,NegationContext),
2795		triggers_enum_warning(Var,Type,Infos,NegationContext,TriggersEnumWarning),
2796		construct_typedval_infos(Var,Infos,TriggersEnumWarning,TINFO),
2797	?	add_typed_var_to_localstate(Var,Val,Type,InterState,OutState).
2798
2799		% possible values for NegationContext: positive, negative, all_solutions
2800		triggers_enum_warning(Id,Type,Info,all_solutions,Res) :- !,
2801		Res = trigger_throw(b(identifier(Id),Type,Info)).
2802		%triggers_enum_warning(Id,_Type,Info,NegationContext,trigger_false(Id)) :- % no longer used
2803		% NegationContext=positive, % when negated then success will occur if all possibilities have been tried out
2804		% memberchk(introduced_by(exists),Info),
2805		% %%((preferences:get_preference(disprover_mode,true),type_contains_unfixed_deferred_set(Type))-> fail % otherwise %finding a solution may depend on the size of the deferred set; true),
2806		% %% The Disprover now checks whether unfixed_deferred sets were involved; keeping track of implicit enumerations of %deferred sets is just too difficult
2807		% !.
2808		triggers_enum_warning(Id,Type,Info,_,trigger_true(b(identifier(Id),Type,Info))).
2809
2810
2811		add_typed_var_to_localstate(Var,Val,Type,InState,OutState) :-
2812		add_var_to_localstate(Var,Val,InState,OutState),
2813		%%when(ground(Val), (print(' ++ '),print(Var),print(' ---> '), print(Val),nl)),
2814	?	kernel_objects:basic_type(Val,Type). %% ,print(ok(Val)),nl.
2815
2816		/*
2817		xxb_test_exists(Parameters,Condition,Infos,LocalState,State,WF) :-
2818		b_check_boolean_expression(b(exists(Parameters,Condition),pred,Infos),LocalState,State,WF,NR),
2819		get_exists_used_ids(Parameters,Condition,Infos,Used),lookup_values_if_vars(Used,LocalState,State,WaitVars),
2820		\+ ground(WaitVars),
2821		!,
2822		debug_println(9,unfolding_exists(Parameters)), print(unfolding(Parameters)),nl,
2823		%translate:print_bexpr(Condition),nl, print(State),nl, print(LocalState),nl,nl,
2824		NR=pred_true. %, print(set_res(pred_true)),nl.
2825		% if enabled it slows down: ./probcli examples/EventBPrologPackages/SET_Game/SET_GAM_Sym_NoSet20_mch.eventb -mc 10000000 -p SYMMETRY_MODE hash -p TIME_OUT 7000 -p CLPFD TRUE -df -goal "n=18" -p MAX_OPERATIONS 20 -strict -expcterr goal_found
2826		*/
2827
2828		b_test_exists(Parameters,Condition,Infos,LocalState,State,WF) :-
2829		get_wait_flag0(WF,WF0),
2830	?	b_test_exists(WF0,Parameters,Condition,Infos,LocalState,State,WF).
2831
2832		:- block b_test_exists(-,?,?, ?,?,?,?).
2833		b_test_exists(_LWF,Parameters,Condition,Infos,LocalState,State,WF) :-
2834		if((attempt_reification, % what if there is a wd_condition attached to Condition?
2835		b_interpreter_check:b_check_exists_wf(Parameters,Condition,Infos,LocalState,State,WF,ReificationVariable)),
2836		% try and expand quantifiers of small cardinality; see also expand_forall_quantifier
2837		% tested in test 1452
2838		(debug_println(9,expanded_exists(Parameters)),
2839		ReificationVariable=pred_true),
2840	?	b_test_exists_wo_expansion(Parameters,Condition,Infos,LocalState,State,WF)).
2841
2842		%attempt_reification :- preferences:preference(use_clpfd_solver,true),!. % all tests seem to pass
2843		attempt_reification :- preferences:preference(use_smt_mode,true),!.
2844		attempt_reification :- preferences:preference(solver_strength,SS), SS>9.
2845		% TO DO: maybe take context into account: setup constants, becomes such, ... allow_skipping_over_components/reset_component_info(true)
2846
2847		:- use_module(kernel_tools,[bexpr_variables/2, value_variables/3]).
2848
2849		% we treat the existential quantifier without expansion into a disjuncition aka reification
2850		b_test_exists_wo_expansion(Parameters,Condition,Infos,LocalState,State,WF) :-
2851		%print(test_exists(Parameters,Infos)),nl,portray_waitflags(WF),nl,
2852	?	(preference(lift_existential_quantifiers,true) ; member(allow_to_lift_exists,Infos)),
2853		!, % we enumerate the exists normally; treat it just like an ordinary predicate
2854		% lifting may generate multiple solutions; but avoids delaying enumeration of quantified parameters
2855		% print('*Lifting existential quantifier: '), translate:print_bexpr(Condition),nl,
2856	?	set_up_typed_localstate(Parameters,ParaValues,TypedVals,LocalState,NewLocalState,positive),
2857		copy_wf_start(WF,b_test_exists_wo_expansion,CWF),
2858		opt_push_wait_flag_call_stack_quantifier_info(CWF,exists,Parameters,ParaValues,Infos,CWF2),
2859	?	b_test_boolean_expression(Condition,NewLocalState,State,CWF2),
2860		% often we do not need to enumerate TypedVals; they can be derived, but we could have #y.(y>x) and need to enum y
2861		b_tighter_enumerate_values_in_ctxt(TypedVals,Condition,CWF2),
2862	?	copy_wf_finish(WF,CWF2). % moving this before tighter_enum may mean that we have more precise ranges; but this can be counter-productive (e.g., for test 1162 unless we strengthen the useless enum analysis)
2863		b_test_exists_wo_expansion(Parameters,Condition,Infos,LocalState,State,WF) :-
2864		get_exists_used_ids(Parameters,Condition,Infos,Used),
2865		% IT IS IMPORTANT THAT THE USED INFO IS CORRECT ; otherwise the WaitVars will be incorrect
2866		% The used_ids info does not include the Parameters of the existential quantifier !
2867	?	set_up_typed_localstate(Parameters,ParaValues,TypedVals,LocalState,NewLocalState,positive),
2868		lookup_values_if_vars(Used,LocalState,State,WaitVarsState), % TO DO: we could use b_compiler instead
2869		% What if the Condition was compiled and now contains a previously used_variable inside a closure/value ?
2870		%term_variables((Condition,WaitVarsState),WaitVars), % this can be expensive when we have large data values (see rule_RVF219/rule_RVF219_compo.mch)
2871		bexpr_variables(Condition,CondVars),
2872		value_variables(WaitVarsState,CondVars,WaitVars),
2873		% now determine which WaitVars are really worth waiting for, e.g., do not wait for res in #x.(x:E & ... res=min(f(x)))
2874		% relevant tests: 1868, 1194, 383, 1642, 1708, 1003, 1080, 1081, 1943
2875		(remove_ids_defined_by_equality(WaitVars,LocalState,State,Infos,RealWaitVars) -> RemovedVars=true
2876		; RealWaitVars = WaitVars, RemovedVars=false),
2877		opt_push_wait_flag_call_stack_quantifier_info(WF,exists,Parameters,ParaValues,Infos,WF2),
2878		create_inner_wait_flags(WF2,expansion_context(b_test_exists,Parameters),LocalWF), % we are creating inner waitflags here as the exist will wait anyway; LocalWF shares just WFE flag with WF
2879	?	b_test_boolean_expression(Condition,NewLocalState,State,LocalWF), /* check Condition */
2880	?	ground_det_wait_flag(LocalWF), % print('det no contradiction'),nl,flush_output,
2881		b_tighter_enumerate_values_in_ctxt(TypedVals,Condition,LocalWF), % will not yet enumerate
2882		(% we could treat allow_to_lift_exists also here by setting ESWF=1; but 1162 then fails
2883		get_preference(data_validation_mode,true),
2884		not_generated_exists_paras(Parameters) % generated exists, e.g., for relational composition can lead to virtual timeouts, cf Thales_All/rule_zcpa2.mch in test 2287
2885		-> get_wait_flag(50000,b_test_exists(Parameters),WF,ESWF) % 100000 sufficient for test 1945; 869 for rule_CHAMPS in private_examples/ClearSy/2023
2886		; get_enumeration_starting_wait_flag(b_test_exists(Parameters),WF,ESWF)), %% TO DO: get flag when enumeration of infinite type starts; maybe if domain of exists is small we can start enumerating earlier ?? <-> relation with lifting exists in closure expansion heuristic
2887		when((nonvar(ESWF);ground(RealWaitVars)),b_enumerate_exists(ESWF,RemovedVars,WaitVars,Parameters,Infos,LocalWF,WF)).
2888
2889
2890		:- use_module(tools,[remove_variables/3]).
2891		:- use_module(kernel_tools,[value_variables/2]).
2892		% if we have #x.( P & y = E(x)) we do not have to wait for y to be known
2893		remove_ids_defined_by_equality(WaitVars,LocalState,State,Infos,RealWaitVars) :- WaitVars \== [],
2894		memberchk(used_ids_defined_by_equality(Ideq),Infos),
2895		Ideq = [ID1|_], % currently we only look at one used_id defined by equality,
2896		% we could have #x.(P & y=E(z) & z=E(y)): TODO: improve computation in ast_cleanup
2897		(memberchk(bind(ID1,VAL),LocalState) -> true ; memberchk(bind(ID1,VAL),State)),
2898		value_variables(VAL,VARS),
2899		remove_variables(WaitVars,VARS,RealWaitVars),
2900		debug_println(9,removed_ids_def_by_equality(WaitVars,ID1,RealWaitVars)).
2901
2902
2903		b_enumerate_exists(ESWF,RemovedVars,WaitVars,Parameters,Infos,LocalWF,WF) :-
2904		%print(enum_exists(ESWF,RemovedVars,WaitVars,Parameters,LocalWF,WF)),nl,
2905		((RemovedVars=false,var(ESWF) ; % WaitVars guaranteed to be ground
2906		ground(WaitVars)) % TODO: replace this by an optimised version of ground check
2907		-> get_idle_flag(Parameters,WF,LWF),
2908		/* allow all other co-routines waiting on WaitVars to complete */
2909		/* Note however: if WF grounding as triggered two non-deterministic co-routines this
2910		will allow the other non-determinism to run first, duplicating the number of calls !
2911		This has been fixed by storing seperate waitflag variables for same prio in kernel_waitflags
2912		TODO: However, for enumeration of FD variables this might still happen and lead to duplication of
2913		calls to b_enumerate_exists_aux_ground
2914		*/
2915		%print(get_idle(Parameters,WaitVars)),nl, %kernel_waitflags:portray_waitflags(WF),nl,nl,
2916		b_enumerate_exists_aux_ground(LWF,WaitVars,Parameters,Infos,LocalWF,WF)
2917		; debug_println(9,semi_lifting_exists(ESWF,Parameters)),
2918		% add_message_wf(exists,'Semi-lifting exists:',Parameters,Parameters,WF),portray_waitflags(LocalWF),nl,
2919		kernel_waitflags:copy_waitflag_store(LocalWF,WF) % outer WF will now drive enumeration
2920		% Note: in case a LET has been moved inside and replaced this may lead to duplication
2921		).
2922
2923		:- if(environ(prob_safe_mode,true)).
2924		get_idle_flag(Parameters,WF,LWF) :- kernel_waitflags:get_idle_wait_flag(b_enumerate_exists(Parameters),WF,LWF),
2925		(var(LWF) -> true ; add_internal_error('Illegal idle waitflag for exists:',get_idle_flag(Parameters,WF,LWF))).
2926		:- else.
2927		get_idle_flag(Parameters,WF,LWF) :- kernel_waitflags:get_idle_wait_flag(b_enumerate_exists(Parameters),WF,LWF).
2928		:- endif.
2929
2930		:- block b_enumerate_exists_aux_ground(-,?,?,?,?,?).
2931		b_enumerate_exists_aux_ground(_,_WaitVars,Parameters,Infos,LocalWF,_WF) :-
2932		/* Note: this does a local cut: so it is important
2933		that all conditions are fully evaluated before performing the cut ; otherwise
2934		solutions will be lost */
2935		% print_bt_message('ENUMERATE EXISTS'(_Parameters)),nl, % portray_waitflags(_WF),
2936		if(ground_wait_flags_for_exists(Parameters,LocalWF),true,
2937		(perfmessage(exists,'Late bound exists failed: ',Parameters,Infos),fail)).
2938
2939
2940		ground_wait_flags_for_exists(Parameters,LocalWF) :-
2941	?	\+ enumeration_warning_occured_in_error_scope,
2942		get_current_error_scope(Level),
2943	?	\+ error_manager:throw_error(Level,_,_),
2944		!, % current scope is already clean, no need to enter a fresh one
2945		ground_wait_flags_for_exists2(Parameters,LocalWF,Level).
2946		ground_wait_flags_for_exists(Parameters,LocalWF) :-
2947		enter_new_clean_error_scope(Level),
2948		% Note: see {x|x:1..10 & #y.(y>x & y*y >10)} in test 2210:
2949		% we do not want to throw enum warnings even if the outer scope does in case a solution is found
2950		% NOTE: if this engenders an enumeration warning: it may have been better to enumerate the outer WF first ?! : but as WaitVars are ground, so only failure of outer WF could help us here in preventing enumeration warning
2951		call_cleanup(ground_wait_flags_for_exists2(Parameters,LocalWF,Level),
2952		exit_error_scope(Level,_,ground_wait_flags_for_exists)).
2953
2954		ground_wait_flags_for_exists2(_Parameters,LocalWF,Level) :-
2955	?	(ground_constraintprop_wait_flags(LocalWF)
2956		-> % local cut: one solution is sufficient.
2957		clear_enumeration_warning_in_error_scope(Level)
2958		% ; %print(fail),nl, % do not clear enumeration warnings fail
2959		).
2960
2961
2962		:- use_module(b_ast_cleanup,[check_used_ids_info/4]).
2963		get_exists_used_ids(Parameters,Condition,Infos,Used) :-
2964		preference(prob_safe_mode,true),!,
2965		(select(used_ids(Used),Infos,Rest)
2966		-> check_used_ids_info(Parameters,Condition,Used,exists), %% comment in to check used_ids field
2967		(member(used_ids(_),Rest)
2968		-> add_internal_error('Multiple used_ids info fields:',Parameters:Infos) ; true)
2969		;
2970		add_internal_error(
2971		'Expected information of used identifiers in exists information',Parameters:Infos),
2972		bsyntaxtree:find_identifier_uses(Condition, [], Used)
2973		).
2974		get_exists_used_ids(Parameters,Condition,Infos,Used) :-
2975	?	member(used_ids(Used),Infos) -> true
2976		;
2977		add_internal_error(
2978		'Expected information of used identifiers in exists information',Parameters:Infos),
2979		bsyntaxtree:find_identifier_uses(Condition, [], Used).
2980		% what if we call test_exists for a negated universal quantifier ??
2981
2982
2983
2984
2985		:- use_module(kernel_tools,[ground_state/1]).
2986		/* the following causes performance problems with examples/B/Mathematical/GraphIso/CheckGraphIsomorphism
2987		and with lausanne.mch in SMT mode */
2988		b_not_test_exists(Parameters,Condition,Infos,LocalState,State,_,WF) :-
2989		preferences:preference(use_smt_mode,true),
2990		is_a_conjunct(Condition,LHS,RHS),
2991		(\+ ground_state(LocalState) ; \+ ground_state(State)),
2992		% TO DO: check if any of the variables in Condition are not ground
2993		% TO DO: check if used_ids exist in Infos ? memberchk(used_ids(_),Infos),
2994		!,
2995		%print(translating_not_exists_into_forall),nl,print(' '),print_bexpr(LHS),nl, print('=> '),print_bexpr(RHS),nl,
2996		(is_for_all_set_membership_predicate(RHS,Parameters,_Set,_Pattern,_ParameterValues),
2997		\+ is_for_all_set_membership_predicate(LHS,Parameters,_,_,_)
2998		-> LLHS=RHS, RRHS=LHS % swap LHS and RHS; TO DO: search for membership predicate inside LHS,RHS !!
2999		; LLHS=LHS, RRHS=RHS
3000		),
3001		safe_create_texpr(negation(RRHS),pred,NegRHS),
3002		b_for_all(Parameters,Infos,LLHS,NegRHS,LocalState,State,WF).
3003		b_not_test_exists(Parameters,Condition,Infos,[],[],no_compile,WF) :- !,
3004		% already compiled in is_empty_closure_wf
3005		ground_bexpr_check(Condition,Ground),
3006		b_not_test_exists_aux(Ground,Parameters,Condition, Infos, WF).
3007		b_not_test_exists(Parameters,Condition,Infos,LocalState,State,_,WF) :-
3008		% compile to remove dependency on unused parts of State+LocalState; will make it delay less below
3009		def_get_texpr_ids(Parameters,ParaIDs),
3010		%% print(b_not_test_exists(ParaIDs)),nl, print(state(LocalState,State)),nl, %%
3011	?	b_compiler:b_compile(Condition,ParaIDs,LocalState,State,CompiledCond,WF),
3012		(is_truth(CompiledCond) -> fail
3013		; is_falsity(CompiledCond) -> true
3014		% TO DO: we could detect equalities that will always succeed (but be careful for WD issues)
3015		; ground_bexpr_check(CompiledCond,Ground),
3016		b_not_test_exists_aux(Ground,Parameters,CompiledCond, Infos, WF)
3017		).
3018
3019		:- block b_not_test_exists_aux(-,?,?,?,?).
3020		b_not_test_exists_aux(_,Parameters,CompiledCond,Infos,WF) :-
3021		% getting an idle waitflag considerably slows down test 1739; see also ClearSy/2019_Aug/call_residue/rule_erreur.mch
3022		% slow down no longer the case with the new waitflag implementation
3023		kernel_waitflags:get_idle_wait_flag(b_not_test_exists_aux(Parameters),WF,LWF),
3024		% allow pending co-routines to complete
3025		b_not_test_exists_aux2(LWF,Parameters,CompiledCond,Infos,WF).
3026		:- block b_not_test_exists_aux2(-,?,?,?,?).
3027		b_not_test_exists_aux2(_,Parameters,CompiledCond,Infos,WF) :-
3028		% no need to create inner waitflag: we enumerate fully below: create_inner_wait_flags(WF,b_not_test_exists(Parameters),LocalWF),
3029		%init_wait_flags(LocalWF,[expansion_context(b_not_not_test_exists,Parameters)]),
3030		init_quantifier_wait_flag(WF,not(exists),Parameters,ParaResult,Infos,LocalWF),
3031		not_with_enum_warning(
3032		b_interpreter:b_not_not_test_exists_aux(Parameters,ParaResult,CompiledCond,LocalWF),
3033		LocalWF, CompiledCond, % was not_exists(Parameters), the not_exists quantifier call is on call_stack now
3034		CompiledCond),
3035		copy_wfe_from_inner_if_necessary(LocalWF,WF). % for the case that the negated call has found abort errors and WFE was not grounded
3036		b_not_not_test_exists_aux(Parameters,ParaResult,CompiledCond,LocalWF) :-
3037	?	b_interpreter:set_up_typed_localstate(Parameters,ParaResult,TypedVals,[],NewLocalState,negated),
3038		% delay generation of WD error messages until outer WFE flag set
3039	?	b_interpreter:b_test_boolean_expression(CompiledCond,NewLocalState,[],LocalWF), % check Condition
3040		b_tighter_enumerate_values_in_ctxt(TypedVals,CompiledCond,LocalWF),
3041	?	ground_inner_wait_flags(LocalWF). % does not always ground WFE if abort is pending in which case not_with_enum_warning also does not fail and keeps the co-routines
3042		% pending co-routines will be discarded by negation !
3043
3044
3045		/* --------------------------------- */
3046
3047		value_type(_X). % only used in post_conditions (assert_post)
3048		/*
3049		value_type(X) :- nonvar(X),
3050		(X = value(_) ; X = global_set(_) ;
3051		X = global_constant(_) ; X = term(_)).*/
3052
3053
3054		% look up identifiers in store, if the identifier
3055		% is not in the store, assume it's a constant and ignore it
3056		% used for determining wait variables for existential quantifier
3057		% TO DO: better deal with CSE @identifiers ?
3058		lookup_values_if_vars([],_,_,[]).
3059		lookup_values_if_vars([Id|IRest],LocalStore,Store,Values) :-
3060		( lookup_value(Id,LocalStore,Store,Val)
3061		-> (force_evaluation_of_lazy_value(Id,Val,RealVal)
3062		-> Values = [RealVal|VRest]
3063		; Values = [Val|VRest])
3064		; Values = VRest),
3065		lookup_values_if_vars(IRest,LocalStore,Store,VRest).
3066
3067		force_evaluation_of_lazy_value(Id,Value,RealVal) :- nonvar(Value), Value=(Trigger,RealVal),
3068		var(Trigger),
3069		get_preference(use_common_subexpression_elimination,true),
3070		is_lazy_let_identifier(Id),
3071		!,
3072		Trigger=pred_true. % force evaluation, as the exists will otherwise delay/flounder
3073		% Warning: this means that outer lazy_let_expressions inside an exists should be well-defined (WD)
3074
3075
3076		/* will not generate error messages; used for CSP||B when we don't know if something is a B variable or not */
3077		/* TO DO: add peel_prefix for global_sets and constants ?? */
3078		try_lookup_value_in_store_and_global_sets(Id,State,Val) :-
3079		(lookup_value(Id,State,RVal) -> RVal=Val
3080		; b_global_sets:lookup_global_constant(Id,VGC) -> Val = VGC
3081		; b_global_set_or_free_type(Id,_AnyType,Value) -> Val=Value /* global set evaluates to itself */
3082		).
3083
3084
3085		lookup_value_in_store_and_global_sets_wf(Id,Type,LocalState,State,Val,Span,WF) :-
3086		(lookup_value_with_span_wf(Id,LocalState,State,RVal,Span,WF)
3087		-> RVal=Val
3088		; lookup_value_in_global_sets_wf(Id,Type,Val,LocalState,State,Span,WF)
3089		).
3090
3091		lookup_value_in_global_sets_wf(Id,Type,Val,LocalState,State,Span,WF) :-
3092		(b_global_sets:lookup_global_constant(Id,VGC)
3093		-> Val=VGC
3094	?	; (b_global_set_or_free_type(Id,Type,Value)
3095		-> Val = Value /* global set evaluates to itself */
3096		; ((member(bind(Id,_),LocalState) ; member(bind(Id,_),State))
3097		-> Msg1 = 'Cannot determine value for identifier '
3098		; Msg1 = 'Cannot find identifier '
3099		),
3100		append(LocalState,State,LSS),
3101		translate:translate_bstate_limited(LSS,StateInfo),
3102		ajoin([Msg1,Id,':'],Msg),
3103		add_error_wf(identifier_not_found,Msg,StateInfo,Span,WF),
3104		fail % Val = term(Id) /* Val=fail */
3105		)
3106		).
3107
3108		:- use_module(probsrc(kernel_freetypes),[registered_freetype/2, registered_freetype_case_value/3]).
3109	?	b_global_set_or_free_type(Id,_,global_set(Id)) :- b_global_set(Id).
3110		b_global_set_or_free_type(Id,_,freetype(Id)) :- registered_freetype(Id,_).
3111		b_global_set_or_free_type(Id,Type,Value) :-
3112		registered_freetype_case_value(Id,Type,Value). % to instantiate the type parameters we also need the TypeId
3113		% TODO: we could also register Event-B destructors and look them up here
3114
3115		/* -----------------------------*/
3116		/* b_compute_expressions */
3117		/* -----------------------------*/
3118
3119		b_compute_expressions([], _, _, [],_WF).
3120		b_compute_expressions([EXPRsHd|EXPRsTl],LocalState,InState,[ValHd|ValTl],WF) :-
3121	?	b_compute_expression(EXPRsHd,LocalState,InState,ValHd,WF),
3122	?	b_compute_expressions(EXPRsTl,LocalState,InState,ValTl,WF).
3123
3124		% a variation of above that delays computing the expressions until Waitflag 1/2 is set
3125		b_compute_assign_expressions_when(EXPRsTl,LocalState,InState,ValTl,WF,OR) :-
3126		get_assign_expr_priority_wf(OR,WF,LWF),
3127	?	b_compute_expressions_when2(EXPRsTl,LocalState,InState,ValTl,WF,LWF).
3128		b_compute_expressions_when2([], _, _, [],_WF,_).
3129		b_compute_expressions_when2([EXPRsHd|EXPRsTl],LocalState,InState,[ValHd|ValTl],WF,LWF) :-
3130	?	b_compute_expression_when2(EXPRsHd,LocalState,InState,ValHd,WF,LWF),
3131		b_compute_expressions_when2(EXPRsTl,LocalState,InState,ValTl,WF,LWF).
3132
3133		% TO DO: add step number in OR
3134		get_assign_expr_priority_wf(output_required,_WF,LWF) :- !,
3135		% the Output of the statement is required; do not delay computing it
3136		LWF=0. % this would delay computation until WF0 is set: get_wait_flag0(WF,LWF); cf. initialisation for test 2104
3137		get_assign_expr_priority_wf(_,WF,LWF) :-
3138		% the Output is not directly required; compute it later (when we are sure that the statement actually succeeds)
3139		(preferences:preference(use_smt_mode,true)
3140		-> Prio = 2.0 % SMT Mode: we are probably doing CBC checking, we may have set up constraints on ValTl
3141		; Prio=4000), % unless the expression is inside an sequential composition: nothing can depend on ValTl; TO DO: check if we are inside a sequential composition; if not use inf priority; otherwise use 2.0 or 4
3142		get_wait_flag(Prio,get_assign_expr_priority_wf,WF,LWF).
3143
3144		:- block b_compute_expression_when2(?,?,?,?,?,-).
3145		b_compute_expression_when2(eval_must_not_fail(ErrMsg,EXPRsHd),LocalState,InState,Res,WF,_) :- !,
3146		% catch failure; in case the interpreter fails to catch wd-error itself (e.g., try_find_abort is false)
3147		if(b_compute_expression(EXPRsHd,LocalState,InState,ValHd,WF),equal_object_wf(ValHd,Res,WF),
3148		(translate:translate_bexpression_with_limit(EXPRsHd,TS),
3149		add_wd_error_span(ErrMsg,TS,span_predicate(EXPRsHd,LocalState,InState),WF))).
3150		b_compute_expression_when2(EXPRsHd,LocalState,InState,ValHd,WF,_) :-
3151		copy_wf_start(WF,b_compute_expression_when2,CWF), % not sure this is useful for expressions:
3152	?	b_compute_expression(EXPRsHd,LocalState,InState,ValHd,CWF),
3153	?	copy_wf_finish(WF,CWF).
3154
3155
3156		/* -----------------------------*/
3157		/* b_execute_statement */
3158		/* -----------------------------*/
3159		/* b_execute_statement(XMLStatements:input, StateofLocalVariables:input,
3160		StateOfGlobalVariables:input,
3161		ListOfUpdateBindingsForGlobalVariablesAndResultVariables:output) */
3162
3163		:- assert_pre(b_interpreter:b_execute_statement(Stmt,LS,IS,_OS,_WF,_Path,_OR),
3164		(bsyntaxtree:check_if_typed_substitution(Stmt),type_check(LS,store),type_check(IS,store) )).
3165		:- assert_post(b_interpreter:b_execute_statement(_Stmt,_LS,_IS,OS,_WF,_Path,_OR),
3166		(type_check(OS,store))).
3167
3168		b_execute_inner_statement(Body,LocalState,InState,OutState,WF,Path,output_required) :-
3169		get_texpr_expr(Body,BE),
3170		BE \= while(_COND,_STMT,_INV,_VARIANT), % also other non-det substitutions ??
3171		BE \= select(_),
3172		BE \= select(_,_),
3173		BE \= if(_), % case(_,_,_) statements are now translated to if-then-else in ast_cleanup
3174		!,
3175		get_wait_flag0(WF,WF0),
3176		block_execute_statement(WF0,Body,LocalState,InState,OutState,WF,Path).
3177		b_execute_inner_statement(Body,LocalState,InState,OutState,WF,Path,OR) :-
3178		get_wait_flag(2,inner_stmt,WF,LWF), % was 2.0
3179		clone_wait_flags_from1(WF,GroundUponFinish,InnerWF), % copy everything but WF0
3180		b_execute_inner_statement(Body,LocalState,InState,OutState,GroundUponFinish,InnerWF,Path,LWF,OR).
3181
3182		:- block block_execute_statement(-, ?,?,?, ?,?,?).
3183		block_execute_statement(_,Body,LocalState,InState,OutState,WF,Path) :-
3184	?	b_execute_statement(Body,LocalState,InState,OutState,WF,Path,output_required).
3185
3186		:- block b_execute_inner_statement(?,?,?,?,?,?,?,-,?).
3187		b_execute_inner_statement(Body,LocalState,InState,OutState,GUF,InnerWF,Path,_,OR) :-
3188	?	b_execute_statement(Body,LocalState,InState,OutState,InnerWF,Path,OR),
3189		(GUF=ground_upon_finish -> ground_wait_flags(InnerWF) ; ground_wait_flag0(InnerWF)).
3190
3191		:- use_module(source_profiler,[opt_add_source_location_hits/2]).
3192		:- use_module(b_operation_guards,[get_substitution_enabling_condition/4]).
3193
3194
3195		b_execute_statement_nowf(Subst,LS,S,OutS,Ctxt) :-
3196		init_wait_flags_with_call_stack(WF,[prob_command_context(Ctxt,unknown)]),
3197		b_interpreter:b_execute_statement(Subst,LS,S,OutS,WF,_Path),
3198		ground_wait_flags(WF).
3199
3200		b_execute_statement(Stmt, LS, S, OS, WF,Path) :-
3201	?	b_execute_statement(Stmt, LS, S, OS, WF,Path,output_not_required).
3202		b_execute_statement(b(Stmt,_,Infos), LS, S, OS, WF,Path,OR) :- !,
3203	?	b_execute_statement2(Stmt, Infos, LS, S, OS, WF,Path,OR).
3204		b_execute_statement(Stmt, LS, S, OS, WF,Path,OR) :-
3205		add_internal_error('Statement not properly wrapped: ',b_execute_statement(Stmt, LS, S, OS, WF,Path,OR)),
3206		b_execute_statement2(Stmt, [], LS, S, OS, WF,Path,OR).
3207
3208		% blocks should be removed by type-checker
3209		b_execute_statement2(block(Stmt),_,LS,IS,OS,WF,Path,OR) :- !,
3210		b_execute_statement(Stmt,LS,IS,OS,WF,Path,OR). %% NOT COVERED
3211		b_execute_statement2(assign(LHS,Exprs),Info,LocalState,InState,OutState,WF,assign(LHS,VALs),OR) :- !,
3212		/* Var1, ..., VarN := Expr1, ..., ExprN */
3213		/* also: Var1, fun1(arg), ... := Expr1, Expr2, ... */
3214		opt_add_source_location_hits(Info,1),
3215	?	b_compute_assign_expressions_when(Exprs,LocalState,InState,VALs,WF,OR),% VALs - a list of computed values
3216	?	b_assign_values_or_functions(LHS,VALs,LocalState,InState,OutState,WF,OR).
3217		b_execute_statement2(assign_single_id(IDE,Expr),Info,LocalState,InState,OutState,WF,assign_single_id(ID,Value),_OR) :-
3218		get_texpr_id(IDE,ID),!,
3219		opt_add_source_location_hits(Info,1),
3220	?	b_compute_expression(Expr,LocalState,InState,Value,WF), % b_compute_assign_expressions_when
3221		%b_compute_assign_expressions_when([Expr],LocalState,InState,[Value],WF),
3222		OutState=[bind(ID,Value)].
3223		b_execute_statement2(choice(ChoiceList),_,LocalState,InState,OutState,WF,Path,OR) :- !,
3224		/* CHOICE LHS OR RHS OR ... END */
3225		get_wait_flag(2,choice,WF,WFC), % % was 2.0, maybe use length of ChoiceList as Priority ??
3226		b_execute_choice(ChoiceList,LocalState,InState,OutState,WF,Path,WFC,OR).
3227		b_execute_statement2(becomes_element_of(LHS,RHS), /* LHS :: RHS */
3228		Info,LocalState,InState,OutState,WF,becomes_element_of(LHS,SingleValue),_OR) :- !,
3229		% LHS must be of the form Var1,..,Vark where all variables are disjoint
3230		opt_add_source_location_hits(Info,1),
3231		b_compute_expression(RHS,LocalState,InState,ValueSet,WF),
3232		check_element_of_wf(SingleValue,ValueSet,WF),
3233		ground_det_wait_flag(WF), %% TODO: remove this
3234		convert_pairs_into_list(LHS,SingleValue,ValList),
3235		set_up_typed_localstate(LHS,ValList,TypedVals,[],OutState,positive),
3236		b_tighter_enumerate_all_values(TypedVals,WF).
3237		b_execute_statement2(becomes_such(Vars,Condition),Info,LocalState,InState,OutState,WF,Path,_OR) :- !,
3238		/* Vars : (Condition) */
3239		opt_add_source_location_hits(Info,1),
3240	?	b_execute_becomes_such(Vars,Condition,LocalState,InState,OutState,_,Path,WF).
3241		b_execute_statement2(sequence(Seq), /* LHS ; RHS */
3242		_,LocalState,InState,OutUpdates,WF,Path,OR) :- !, %pe_print(sequence(Seq,InState)),
3243	?	b_execute_sequence(Seq,LocalState,InState,OutUpdates,WF,Path,OR).
3244		b_execute_statement2(precondition(PreCond,Body),_,LocalState,InState,OutState,WF,Path,OR) :- !,
3245		%print('*** Non-outermost PRE construct'),nl,
3246		Path=pre(PreRes,IPath),
3247		b_try_check_boolean_expression(PreCond,LocalState,InState,WF,PreRes),
3248		%used to be: ground_det_wait_flag(WF),
3249		check_precondition_result(PreRes,PreCond,LocalState,InState,WF),
3250	?	(PreRes == pred_true -> b_execute_statement(Body,LocalState,InState,OutState,WF,IPath,OR)
3251		; PreRes == pred_false -> IPath = not_executed
3252		; b_execute_inner_statement(Body,LocalState,InState,OutState,WF,IPath,OR) % with extra waitflag
3253		).
3254		b_execute_statement2(assertion(PreCond,Body),_,LocalState,InState,OutState,WF,Path,OR) :- !,
3255	?	b_execute_assertion(PreCond,Body,LocalState,InState,OutState,WF,Path,OR).
3256		b_execute_statement2(witness_then(PreCond,Body),_,LocalState,InState,OutState,WF,witness(Path),OR) :- !,
3257		b_test_boolean_expression(PreCond,LocalState,InState,WF),
3258		b_execute_inner_statement(Body,LocalState,InState,OutState,WF,Path,OR).
3259		b_execute_statement2(select(Whens),_, LocalState, InState, OutState,WF,select(Nr,Path),OR) :- !,
3260		get_texpr_expr(TExpr,select_when(PreCond, Body)), % info field not used for select_when
3261	?	optimized_nth1(Nr, Whens, TExpr), % THIS IS A CHOICE POINT if length(Whens)>1 ! <-------- TO DO guard
3262	?	b_test_boolean_expression(PreCond,LocalState,InState,WF),
3263		%used to call: ground_det_wait_flag(WF), now execute inner statement delays
3264		b_execute_inner_statement(Body,LocalState,InState,OutState,WF,Path,OR).
3265		b_execute_statement2(select(Whens,Else), Infos, LocalState, InState, OutState,WF,Path,OR) :- !,
3266		(
3267	?	b_execute_statement2(select(Whens), Infos, LocalState, InState, OutState,WF,Path,OR)
3268		; % THIS IS A CHOICE POINT ! <-------- TO DO guard
3269		findall(PC,
3270		(member(SW,Whens),get_texpr_expr(SW,select_when(PC,_))), AllPreconds),
3271		b_not_test_list_of_boolean_expression(AllPreconds,LocalState,InState,WF),
3272		Path = select(else,IPath),
3273		b_execute_inner_statement(Else,LocalState,InState,OutState,WF,IPath,OR)
3274		).
3275		b_execute_statement2(var(Parameters,Body), /* VAR _ IN _ substitution */
3276		_,LocalState,InState,NewOutState,WF,var(Names,Path),OR) :- !,
3277		/* introduces a new variable that can be assigned to */
3278		split_names_and_types(Parameters,Names,_),
3279		delete_variables_from_state(Names,InState,InState1), % in case any local parameter name is also a constant/variable: remove it % but if we do an operation_call: we leave context and it becomes visible again !!
3280		% otherwise we may think there are two updates, e.g., in WHILE loop; see Rule_DB_SIGAREA_0030 from test 1303
3281		set_up_undefined_localstate(Parameters,InState1,NewInState),
3282		delete_variables_from_state(Names,LocalState,NewLocalState),
3283		%check_valid_store(InState,var_in_state), check_valid_store(LocalState,var_local_state),
3284	?	b_execute_statement(Body,NewLocalState,NewInState,OutState,WF,Path,OR),
3285		% check_valid_store(OutState,var_out_state),
3286		filter_results(Parameters,OutState,NewOutState,WF)
3287		.
3288		/* it can be ok not to assign to a local variable */
3289
3290		%TODO(DP, 5.8.2008):
3291		b_execute_statement2(let(Parameters,Defs,Body), /* LET _ BE _ IN _ */
3292		_,LocalState,InState,OutState,WF,let(Path),OR) :- !,
3293	?	set_up_typed_localstate(Parameters,LocalState,NewLocalState),
3294		b_execute_let_definitions(Defs,NewLocalState,InState,WF),
3295	?	b_execute_statement(Body,NewLocalState,InState,OutState,WF,Path,OR).
3296		b_execute_statement2(lazy_let_subst(Id,IdExpr,Body),_,LocalState,InState,OutState,WF,lazy_let(Path),OR) :-
3297		!,
3298		add_lazy_let_id_and_expression(Id,IdExpr,LocalState,InState,NewLocalState,WF),
3299		b_execute_statement(Body,NewLocalState,InState,OutState,WF,Path,OR).
3300		b_execute_statement2(any(Parameters,PreCond,Body), /* ANY _ WHERE */
3301		Info,LocalState,InState,OutState,WF0,any(Bindings,Path),OR) :- !, %statistics(runtime,_),
3302		%print('ANY: '), print_bexpr(PreCond),nl, %%
3303	?	set_up_typed_localstate(Parameters,FreshVars,TypedVals,LocalState,NewLocalState,positive),
3304		create_any_bindings(Parameters,FreshVars,Bindings),
3305		push_wait_flag_call_stack_info(WF0,quantifier_call('ANY',Parameters,FreshVars,Info),WF),
3306	?	b_test_inner_boolean_expression(PreCond,NewLocalState,InState,WF), /* check WHERE */
3307		%%observe_state(TypedVals,WF,0), b_tracetest_boolean_expression(PreCond,NewLocalState,InState,WF,one), %% comment in for debugging
3308		b_tighter_enumerate_all_values(TypedVals,WF), % moved enumeration after test; in case WF already instantiated
3309		%TODO: check if we can use b_tighter_enumerate_values_in_ctxt
3310	?	b_execute_statement(Body,NewLocalState,InState,OutState,WF,Path,OR). /* should we use b_execute_inner_statement/LWF here ?? */
3311		b_execute_statement2(skip, /* SKIP */
3312		Info,_LocalState,_InState,OutState,_WF,skip,_OR) :- !,
3313		opt_add_source_location_hits(Info,1),
3314		OutState = [].
3315		b_execute_statement2(parallel(Statements), /* LHS || RHS */ %@@@
3316		_,LocalState,InState,OutState,WF,parallel(Paths),OR) :- !,
3317	?	b_execute_statements_in_parallel(Statements,LocalState,InState,OutState,WF,Paths,OR).
3318		b_execute_statement2(init_statement(Stmt),_,LocalState,InState,OutState,WF,Path,OR) :- !,
3319		/* Like block: but
3320		writes error messages if statement fails */ %@@@
3321		(preferences:get_preference(provide_trace_information,true)
3322		-> nl,print(' =INIT=> '),translate:print_subst(Stmt),nl, flush_output(user_output),
3323		statistics(walltime,[Tot1,_])
3324		; true),
3325	?	if(b_execute_initialisation_statement(Stmt,LocalState,InState,OutState,WF,Path,OR),
3326		(
3327		(preferences:get_preference(provide_trace_information,true)
3328		-> statistics(walltime,[Tot2,_]), Tot is Tot2-Tot1,
3329		format(' [=OK= ~w ms]~n',[Tot]), flush_output(user_output)
3330		; true)
3331		),
3332		( translate:translate_substitution(Stmt,TStmtStr),
3333		(bmachine:b_machine_temp_predicate(_TempPred)
3334		-> Msg = 'INITIALISATION statement cannot be executed with extra predicate: ',
3335		add_error_wf(initialisation_fails,Msg,TStmtStr,Stmt,WF)
3336		% do not add as state error; user requested transition
3337		; Msg = 'INITIALISATION statement fails: ',
3338		(get_substitution_enabling_condition(Stmt,SpanPred,_BSVars,_IsPreciseV)
3339		-> %insert_custom_predicate_into_guard(EnablingCondition,TempPred,SpanPred),
3340		ErrPos = span_predicate(SpanPred,LocalState,InState) % for visualising by user
3341		% Note: user can also visualise by chooise execute by predicate (in TK)
3342		; ErrPos = Stmt
3343		),
3344		% add as state error so that we can visualise span predicate
3345		add_state_error_wf(initialisation_fails,Msg,TStmtStr,ErrPos,WF) % cf test 1736 and 278
3346		%add_error_wf(initialisation_fails,Msg,TStmtStr,ErrPos,WF)
3347		),
3348		fail
3349		)
3350		).
3351		b_execute_statement2(if(IfList),_,LocalState,InState,OutState,WF,Path,OR) :- !,
3352		LWF='$GENERATE_ON_DEMAND',
3353	?	b_execute_else_list(IfList,LocalState,InState,OutState,WF,1,Path,LWF,OR).
3354		b_execute_statement2(operation_call(Operation,Results,Parameters),Info,LocalState,InState,OutState,WF,
3355		operation_call(OperationName,Results,ParamValues,ResultValues,InnerPath),OR) :- !,
3356		def_get_texpr_id(Operation,op(OperationName)),
3357	?	b_execute_operation_with_parameters(OperationName,LocalState,InState,Results,
3358		Parameters,OpOutState,ParamValues,ResultValues,InnerPath,Info,WF,OR),
3359		opt_add_source_location_hits(Info,1),
3360		split_names_and_types(Results,ResultingIDs,_),
3361		store_values(ResultingIDs, ResultValues, ResultsOutState),
3362		combine_updates(ResultsOutState,OpOutState,OutState).
3363
3364		b_execute_statement2(while(COND,STMT,INV,VARIANT),
3365		Info,LocalState,InState,OutState,WF0,while(VarVal),_OR) :- !,
3366		%hit_profiler:add_profile_hit(while(COND,WF),2),
3367		% we may go around the loop many times: avoid carrying around unused variables
3368		get_while_reads_write_info_and_filter_state(Info,LocalState,InState,LS,IS,ModVars),
3369		push_wait_flag_call_stack_info(WF0,b_operator_call('WHILE',[],Info),WF), % TODO: provide subst. call stack entry
3370		%print_message(execute_while(LocalState,InState)),
3371		b_compiler:b_optimize(INV,ModVars,LS,IS,CINV,WF),
3372		b_compiler:b_optimize(COND,ModVars,LS,IS,CCOND,WF),
3373		b_compiler:b_optimize(VARIANT,ModVars,LS,IS,CVARIANT,WF),
3374		%,b_compiler:b_compile(STMT,ModVars,LS,IS,CSTMT,WF)
3375		% TO DO: maybe exclude in one go; use ordered approach ?
3376		%exclude(unused_variable(ModVars),LS,LS2), % only keep modified vars; all other compiled
3377		%exclude(unused_variable(ModVars),IS,IS2), % only keep modified vars; all other compiled
3378		b_compute_expression(CVARIANT,LS,IS,VarVal,WF),
3379		b_execute_while(CCOND,STMT,CINV,CVARIANT,ModVars,VarVal,LS,IS,OutState,WF).
3380		b_execute_statement2(external_subst_call(FunName,Args),Info,LocalState,State,OutState,WF,external_subst(FunName),_OR) :-
3381		!, b_compute_expressions(Args, LocalState,State, EvaluatedArgs, WF),
3382		push_wait_flag_call_stack_info(WF,external_call(FunName,EvaluatedArgs,Info),WF2),
3383		call_external_substitution(FunName,EvaluatedArgs,State,OutState,Info,WF2).
3384		b_execute_statement2(E,I,LS,S,O,WF,Path,OR) :-
3385		add_internal_error('Uncovered statement: ',b_execute_statement2(E,I,LS,S,O,WF,Path,OR)),
3386		print_functor(E),nl,fail.
3387
3388		% -------------------
3389
3390		b_execute_becomes_such(Vars,Condition,LocalState,InState,OutState,Values,becomes_such(Ids,Values),WF) :- !,
3391		% create the LHS variables in the local state
3392	?	set_up_typed_localstate(Vars,Values,TypedVals,LocalState,TempLocalState1,positive),
3393		get_texpr_ids(Vars,Ids),
3394		% store those values also the outgoing state
3395		store_values(Ids,Values,OutState),
3396		% there might be some variables of the form x$0 to access the
3397		% values before the substitution. We put them into the local state
3398		insert_before_substitution_variables(Vars,LocalState,InState,TempLocalState1,TempLocalState),
3399	?	b_test_inner_boolean_expression(Condition,TempLocalState,InState,WF),
3400		b_tighter_enumerate_values_in_ctxt(TypedVals,Condition,WF). % moved enumeration after test, to avoid overhead in case Condition is deterministic (see e.g. WhileAssignTupleChoose_v2)
3401
3402
3403		b_execute_sequence([],_LocalState,_InState,[],_WF,[],_OR).
3404		b_execute_sequence([First|Rest],LocalState,InState,OutUpdates,WF,Path,OR) :-
3405		(Rest == []
3406	?	-> b_execute_statement(First,LocalState,InState,OutUpdates,WF,Path,OR)
3407		; Path = sequence(Path1,RestPath),
3408	?	b_execute_statement(First,LocalState,InState,LHSUpdates,WF,Path1,output_required),
3409	?	ground_det_wait_flag(WF), % maybe better to delay next execute_statement ? TODO
3410		store_intermediate_updates_wf(InState,LHSUpdates,IntermediateState,First,WF),
3411		% TO DO: statically determine what the Rest can modify and copy over LHSUpdates not modified by Rest into OutUpdates
3412	?	b_execute_statement_list_when_state_set(Rest,LocalState,IntermediateState,
3413		LHSUpdates,OutUpdates,WF,RestPath,OR)
3414		).
3415
3416
3417		:- block check_precondition_result(-,?,?,?,?).
3418		check_precondition_result(pred_true,_,_,_,_).
3419		check_precondition_result(pred_false,PreCond,LS,S,WF) :-
3420		translate_bexpression(PreCond,PreString),
3421		add_abort_error_span(precondition_error,'Precondition violated: ',PreString,span_predicate(PreCond,LS,S),WF).
3422
3423		create_any_bindings([],[],[]).
3424		create_any_bindings([Param|Prest],[Value|Vrest],[bind(Id,Value)|Brest]) :-
3425		get_texpr_id(Param,Id),
3426		create_any_bindings(Prest,Vrest,Brest).
3427
3428		% insert the values of variables before the substitution under an
3429		% alternative name. The alternative name is given as an optional extra
3430		% information in the variable (see type-checking of becomes_such for
3431		% details). Usually (i.e. always) the alternative name is x$0 for the variable x.
3432		insert_before_substitution_variables([],_LocalState,_InState,State,State).
3433		insert_before_substitution_variables([Var|VRest],LocalState,InState,StateA,ResultStateB) :-
3434		get_texpr_info(Var,Infos),
3435	?	( member(before_substitution(_,Alternative),Infos) ->
3436		def_get_texpr_id(Var,Id),
3437		lookup_value_for_existing_id(Id,LocalState,InState,Value),
3438		store_value(Alternative,Value,StateA,StateC)
3439		;
3440		StateA = StateC),
3441		insert_before_substitution_variables(VRest,LocalState,InState,StateC,ResultStateB).
3442
3443
3444
3445		% treat the bool(.) operator
3446		b_convert_bool(Pred,LocalState,State,WF,PredRes) :-
3447		get_wait_flag0(WF,WF0), % first give a chance for PredRes to be instantiated
3448		b_convert_bool_wf0(Pred,LocalState,State,WF,PredRes,WF0).
3449
3450		:- block b_convert_bool_wf0(?,?,?,?,-,-).
3451		b_convert_bool_wf0(Pred,LocalState,State,WF,PredRes,_) :- PredRes==pred_true,!,
3452		%% print('bool(.)=TRUE '), translate:print_bexpr(Pred),nl, %%
3453		b_test_inner_boolean_expression(Pred,LocalState,State,WF).
3454		b_convert_bool_wf0(Pred,LocalState,State,WF,PredRes,_) :- PredRes==pred_false,!,
3455		%% print('bool(.)=FALSE '), translate:print_bexpr(Pred),nl, %%
3456		b_not_test_inner_boolean_expression(Pred,LocalState,State,WF).
3457		b_convert_bool_wf0(Pred,LocalState,State,WF,PredRes,_) :-
3458		%% print('bool(.) check : '), translate:print_bexpr(Pred),nl, % obsv(LocalState),
3459	?	b_try_check_boolean_expression_wf(Pred,LocalState,State,WF,PredRes ).
3460		%% print('finished bool(.) check : '), translate:print_bexpr(Pred),nl,translate:print_bstate(LocalState),nl.
3461
3462		% Additional time limit +TO in ms, e.g., used for CDCL(T). +TORes is time_out if a timeout occurred.
3463		b_convert_bool_timeout(Pred,LocalState,State,WF,PredRes,TO,TORes) :-
3464		get_wait_flag0(WF,WF0),
3465		b_convert_bool_wf0_timeout(Pred,LocalState,State,WF,PredRes,WF0,TO,TORes).
3466
3467		:- block b_convert_bool_wf0_timeout(?,?,?,?,-,-,?,?).
3468		b_convert_bool_wf0_timeout(Pred,LocalState,State,WF,PredRes,_,TO,TORes) :-
3469		PredRes == pred_true,
3470		!,
3471		safe_time_out(b_test_inner_boolean_expression(Pred,LocalState,State,WF),
3472		TO,
3473		TORes).
3474		b_convert_bool_wf0_timeout(Pred,LocalState,State,WF,PredRes,_,TO,TORes) :-
3475		PredRes == pred_false,
3476		!,
3477		safe_time_out(b_not_test_inner_boolean_expression(Pred,LocalState,State,WF),
3478		TO,
3479		TORes).
3480		b_convert_bool_wf0_timeout(Pred,LocalState,State,WF,PredRes,_,TO,TORes) :-
3481		safe_time_out(b_try_check_boolean_expression_wf(Pred,LocalState,State,WF,PredRes ),
3482		TO,
3483		TORes).
3484
3485		%%obsv([]).
3486		%%obsv([bind(Var,Val) | T] ) :- when(ground(Val), format("~w = ~w~n",[Var,Val])), obsv(T).
3487
3488		% check boolean expression without enumeration predicate result (unless WFE is set)
3489		b_try_check_boolean_expression_no_enum_wf(Pred,LocalState,State,WF,PredRes) :-
3490		b_try_check_boolean_expression_lwf(Pred,LocalState,State,WF,'$NO_ENUMERATION',PredRes,_).
3491
3492		b_try_check_boolean_expression_wf(Pred,LocalState,State,WF,PredRes) :-
3493	?	b_try_check_boolean_expression_lwf(Pred,LocalState,State,WF,'$ENUMERATION',PredRes,'$GENERATE_ON_DEMAND' ).
3494		% try to do check_boolean expression; if not possible create choice point if LWF is grounded
3495		b_try_check_boolean_expression_lwf(Pred,LocalState,InState,WF,DoEnumeration,PredRes,LWF) :-
3496	?	b_compiler:b_optimize(Pred,[],LocalState,InState,CPRED,WF), % this increases chance that check can be applied+avoids multiple computations in two branches
3497		% still: some computations may not be pre-computed, e.g., union of closures, ..., see Rule_DB_PSR_0003_C
3498	?	b_try_check_boolean_expression_lwf_c(CPRED,LocalState,InState,WF,DoEnumeration,PredRes,LWF).
3499
3500		b_try_check_boolean_expression_lwf_c(b(truth,_,_),_LocalState,_InState,_WF,_,PredRes,_LWF) :- !,
3501		% typical case in e.g. IF-THEN-ELSE
3502		PredRes= pred_true.
3503		b_try_check_boolean_expression_lwf_c(Pred,LocalState,InState,WF,DoEnumeration,PredRes,LWF) :-
3504		copy_wf_start(WF,try_check,CWF),
3505	?	if(b_check_boolean_expression_with_enum(Pred,LocalState,InState,CWF,DoEnumeration,Res),
3506		% Note: we do not use a cut here ! usually b_check will not enumerate; but on rare occasions it can (apply function in inverse,...)
3507		(PredRes=Res,
3508	?	copy_wf_finish(WF,CWF)
3509		),
3510		b_try_check_failed(Pred,LocalState,InState,WF,DoEnumeration,PredRes,LWF)
3511		).
3512		b_try_check_failed(Pred,LocalState,InState,WF,DoEnumeration,PredRes,LWF) :-
3513		% print(choice_point(LWF)),nl, translate:print_bexpr(Pred),nl,
3514		perfmessagecall(choice_point,reification_of_check_predicate_failed,translate:print_bexpr(Pred),Pred),
3515		(LWF=='$GENERATE_ON_DEMAND' -> get_binary_choice_wait_flag('$GENERATE_ON_DEMAND',WF,WF1)
3516		; var(LWF),DoEnumeration=='$NO_ENUMERATION' -> get_enumeration_finished_wait_flag(WF,WF1) % nothing will enum LWF
3517		; WF1=LWF),
3518		b_try_check_boolean_expression_lwf_block(Pred,LocalState,InState,WF,PredRes,WF1).
3519
3520		% a version of b_check_boolean_expression which will enumerate its result as last resort
3521		% should we only do this in SMT mode : preferences:preference(use_smt_mode,true) ?
3522		b_check_boolean_expression_with_enum(Pred,LocalState,State,WF,DoEnumeration,Res) :-
3523	?	b_check_boolean_expression(Pred,LocalState,State,WF,Res),
3524		(nonvar(Res) -> true
3525		; DoEnumeration=='$NO_ENUMERATION' -> get_enumeration_finished_wait_flag(WF,EWF), enum_pred_result(Res,EWF,WF)
3526		; get_wait_flag0(WF,LWF0),
3527		enum_pred_result0(Res,LWF0,WF)).
3528
3529		% first set up with wait_flag0: easy to get, avoid putting unnecessary waitflags into store
3530		% relevant for DataValidationTest.mch with n>20000
3531		:- block enum_pred_result0(-,-,?).
3532		enum_pred_result0(Res,_,WF) :- var(Res),!,
3533		get_last_wait_flag(b_check_boolean_expression_with_enum,WF,LWF),
3534		enum_pred_result(Res,LWF,WF). % before doing infinite enumerations: better do case-distinction here
3535		enum_pred_result0(_,_,_).
3536
3537		:- block enum_pred_result(-,-,?).
3538		enum_pred_result(pred_true,_,_).
3539		enum_pred_result(pred_false,_,_).
3540
3541		:- block b_try_check_boolean_expression_lwf_block(?,?,?, ?,-,-).
3542		b_try_check_boolean_expression_lwf_block(Pred,LocalState,InState,WF,PREDRES,_) :-
3543		PREDRES \== pred_false,
3544		% print(' TRUE +++++> '), translate:print_bexpr(Pred),nl,
3545	?	b_test_inner_boolean_expression(Pred,LocalState,InState,WF),
3546		PREDRES = pred_true. % set it only after we have actually checked the predicate; e.g., for IF we may execute rest of while loop etc... before actually having set up the constraint Pred; See Hansen23_WhilePerformance
3547		b_try_check_boolean_expression_lwf_block(Pred,LocalState,InState,WF,PREDRES,_) :-
3548		PREDRES \== pred_true,
3549		% print(' FALSE +++++> '), translate:print_bexpr(Pred),nl,
3550		b_not_test_inner_boolean_expression(Pred,LocalState,InState,WF),
3551		PREDRES = pred_false.
3552
3553		% try to do check_boolean expression; if not possible create choice point *directly*
3554		b_try_check_boolean_expression(Pred,LocalState,InState,WF,PredRes) :-
3555		b_compiler:b_optimize(Pred,[],LocalState,InState,CPRED,WF), % this increases chance that check can be applied+avoids multiple computations in two branches
3556		b_try_check_boolean_expression_c(CPRED,LocalState,InState,WF,PredRes).
3557		b_try_check_boolean_expression_c(Pred,LocalState,InState,WF,PredRes) :-
3558		copy_wf_start(WF,try_check_c,CWF),
3559		if(b_check_boolean_expression(Pred,LocalState,InState,CWF,Res),
3560		(PredRes=Res,copy_wf_finish(WF,CWF)),
3561	?	b_try_check_boolean_expression_c2(Pred,LocalState,InState,WF,PredRes)
3562		).
3563		b_try_check_boolean_expression_c2(Pred,LocalState,InState,WF,pred_true) :-
3564		%hit_profiler:add_profile_hit(b_try_check_failed(Pred),3),
3565		b_test_inner_boolean_expression(Pred,LocalState,InState,WF).
3566		b_try_check_boolean_expression_c2(Pred,LocalState,InState,WF,pred_false) :-
3567		b_not_test_inner_boolean_expression(Pred,LocalState,InState,WF).
3568
3569
3570		% WHILE SUBSTITUTION TREATMENT:
3571
3572		:- if(environ(prob_noopt_mode,true)).
3573		get_while_reads_write_info_and_filter_state(Info,LocalState,InState,LS,IS,ModVars) :-
3574		member(modifies(ModVars),Info),!,
3575		LS=LocalState, IS=InState. % do not filter state
3576		:- endif.
3577		get_while_reads_write_info_and_filter_state(Info,LocalState,InState,LS,IS,ModVars) :-
3578	?	member(reads(ReadVars),Info),
3579	?	member(modifies(ModVars),Info),!,
3580		% we may go around the loop many times: avoid carrying around unused variables
3581		ord_union(ReadVars,ModVars,ReadOrModVars),
3582		filter_states(ReadOrModVars,LocalState,InState,LS,IS).
3583		get_while_reads_write_info_and_filter_state(Info,LocalState,InState,LS,IS,ModVars) :-
3584		add_internal_error('No reads & modifies info for while loop: ',get_while_reads_write_info_and_filter_state(Info,LocalState,InState,LS,IS,ModVars)),
3585		ModVars=_, % all variables assumed to be modified
3586		LS=LocalState, IS=InState.
3587
3588		unused_variable(List,bind(Var,_)) :-
3589		% b_is_variable(Var), % TO DO: also include constants in reads Info ?
3590		ord_nonmember(Var,List).
3591		unused_localvariable(List,bind(Var,Val)) :- ord_nonmember(Var,List),
3592		(nonvar(Val),Val=(_,_) -> atom_codes(Var,Codes), Codes \= [64|_] % not a lazy_let ID starting with @
3593		% TO DO: either ensure lazy-let ids are also included in reads/writes ! or mark Val not as pair but using a special functor in add_lazy_let_id_to_local_state ?
3594		; true).
3595
3596		filter_states(ReadOrModVars,LocalState,InState,LS,IS) :-
3597		exclude(unused_localvariable(ReadOrModVars),LocalState,LS),
3598		exclude(unused_variable(ReadOrModVars),InState,IS).
3599		% TO DO: investigate whether we should use ord_intersect; ReadVars is already sorted
3600
3601		:- block lazy_exclude(-,?,?).
3602		lazy_exclude([],_,[]).
3603		lazy_exclude([bind(Var,Val)|T],ModVars,Res) :- lazy_exclude_aux(Var,Val,T,ModVars,Res).
3604		:- block lazy_exclude_aux(-,?,?,?,?).
3605		lazy_exclude_aux(Var,Val,T,ModVars,Res) :-
3606	?	(member(Var,ModVars) -> Res = [bind(Var,Val)|RT]
3607		; Res = RT),
3608		lazy_exclude(T,ModVars,RT).
3609
3610
3611		:- use_module(kernel_tools,[ground_state_check/2]).
3612		% outermost while code:; at next iteration b_execute_while1 will be called.
3613		:- block b_execute_while(?,?,?,?,?,-, ?,?,?, ?). % we block on Variant Value int(VarVal)
3614		b_execute_while(COND,STMT,INV,VARIANT,ModVars,int(VarVal),LocalState,InState,OutState,WF) :-
3615		%kernel_waitflags:get_idle_wait_flag(b_execute_while,WF,LWF),
3616		(number(VarVal),VarVal =< 50
3617		-> LWF=VarVal % we will wait anyway on GrInState below; no danger for WD issues in in b_optimize
3618		; no_pending_waitflags(WF) -> get_wait_flag0(WF,LWF) %important for e.g. PerformanceTests/While/LiftExec_LIM.mch
3619		; kernel_waitflags:get_last_wait_flag(b_execute_while1,WF,LWF) % to do: maybe get largest waitflag to avoid as much as possible that new choice points get enumerated before while triggers?
3620		% see also tests 979, 981
3621		),
3622		% before entering while loop, we wait for co-routines to complete that may have activated b_execute_while
3623		b_execute_while_idle(COND,STMT,INV,VARIANT,ModVars,int(VarVal),LocalState,InState,OutState,WF,LWF).
3624
3625		:- block b_execute_while_idle(?,?,?,?,?,?, ?,?,?, ?,-). % we block on enumeration starting wait_flag
3626		b_execute_while_idle(COND,STMT,INV,VARIANT,ModVars,int(VarVal),LocalState,InState,OutState,WF,_) :-
3627		%ground_constraintprop_wait_flags(WF),
3628		(number(VarVal), VarVal>50, preference(compile_while_body,true)
3629		% if VarVal > 50 -> worthwhile to compile STMT
3630		% TO DO: also take size of body into account, and what if only a small part of the body is reachable in each iteration
3631	?	-> b_compiler:b_optimize(STMT,ModVars,LocalState,InState,CSTMT,WF),
3632		% print(compiled_while(ModVars)),nl, translate:print_subst(CSTMT),nl,
3633		OutState=WhileOutState,
3634		exclude(unused_variable(ModVars),LocalState,LS), % only keep modified vars; all other compiled
3635		exclude(unused_variable(ModVars),InState,IS) % only keep modified vars; all other compiled
3636		; CSTMT=STMT, LS=LocalState, IS=InState,
3637		lazy_exclude(WhileOutState,ModVars,OutState) % only copy over those variables (potentially) modified by While loop
3638		% Note: it is important that we only have one copy of each modified variable in OutState
3639		),
3640		ground_state_check(InState,GrInState),
3641	?	b_execute_while_loop_block(GrInState,COND,CSTMT,INV,VARIANT,none,VarVal,LS,IS,WhileOutState,WF).
3642
3643		:- block b_execute_while_loop_block(-,?,?,?,?,?,?,?,?,?,?).
3644		b_execute_while_loop_block(_,COND,CSTMT,INV,VARIANT,none,VarVal,LS,IS,WhileOutState,WF) :-
3645	?	b_execute_while_loop(COND,CSTMT,INV,VARIANT,none,VarVal,LS,IS,WhileOutState,WF).
3646
3647		:- block b_execute_while1(?,?,?,?,?,-,?,?,?,?).
3648		b_execute_while1(COND,STMT,INV,VARIANT,PrevVariantValue,int(VarVal),LocalState,InState,OutState,WF) :-
3649		% get_last_wait_flag(while(VarVal),WF,LWF),
3650		deref_wf(WF,FreshWF),
3651		%ground_constraintprop_wait_flags(FreshWF), % this is not a good idea, co-routine may be triggered while grounding WF; this subsidiary call will prevent grounding from completing and may trigger later waitflags before earlier ones are finished
3652		% this can lead to enumeration warnings; the same applies to other calls to ground_constraintprop_wait_flags below
3653		b_execute_while_loop(COND,STMT,INV,VARIANT,PrevVariantValue,VarVal,LocalState,InState,OutState,FreshWF).
3654
3655		% block on PrevVarVal and VarVal not yet needed here; but we need it for b_execute_while_body below
3656		:- block b_execute_while_loop(?,?,?,?,-,?,?,?,?,?), b_execute_while_loop(?,?,?,?,?,-,?,?,?,?).
3657		b_execute_while_loop(COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF) :-
3658	?	b_try_check_boolean_expression_c(INV,LocalState,InState,WF,INVRes),
3659		%ground_constraintprop_wait_flags(WF), % seems to slow down interpretation
3660	?	b_check_execute_while_loop1(INVRes,COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF).
3661
3662		:- block b_check_execute_while_loop1(-,?,?,?,?,?,?,?,?,?,?).
3663		b_check_execute_while_loop1(pred_false,_COND,_STMT,INV,_VAR,_PrevVarVal,VarVal,LocalState,InState,_OutState,WF) :-
3664		add_abort_error_span(while_invariant_violation,
3665		'While INVARIANT VIOLATED, current VARIANT value: ',VarVal,span_predicate(INV,LocalState,InState),WF).
3666		b_check_execute_while_loop1(pred_true,COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF) :-
3667		b_try_check_boolean_expression_c(COND,LocalState,InState,WF,CondRes),
3668		%ground_constraintprop_wait_flags(WF), % seems to slow down interpretation
3669	?	b_check_execute_while_loop2(CondRes,COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF).
3670
3671		:- block b_check_execute_while_loop2(-,?,?,?,?,?,?,?,?,?,?).
3672		b_check_execute_while_loop2(pred_false,_COND,_STMT,_INV,_VARIANT,_PrevVarVal,_VarVal,_LS,InState,OutState,_WF) :-
3673		OutState=InState. % we copy over the while InState: the updates will be computed at the end of the while loop
3674		b_check_execute_while_loop2(pred_true,COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF) :-
3675
3676		%hit_profiler:add_profile_hit(b_execute_while_body(STMT,VarVal,PrevVarVal,LocalState),2),
3677		% TO DO: maybe only compute VARIANT now and not above ??
3678		% b_compute_expression(VARIANT,LocalState,InState,VarVal,WF),
3679		% ground_constraintprop_wait_flags(WF), %% moved here because VARIANT computed later
3680	?	b_execute_while_body(COND,STMT,INV,VARIANT,PrevVarVal,VarVal,LocalState,InState,OutState,WF).
3681
3682		%:- block b_execute_while_body(?,?,?,?,-,?,?,?,?,?), b_execute_while_body(?,?,?,?,?,-,?,?,?,?).
3683		% we must ensure VarVal and PrevVaraintValue known
3684		% the block declaration above for b_execute_while_loop already ensures this
3685		b_execute_while_body(_COND,_STMT,_INVARIANT,VAR,_PV,VarVal,LocalState,InState,_OutState,WF) :-
3686		VarVal<0, !, % more efficient than is_not_natural(int(VarVal)),
3687		%ground_constraintprop_wait_flags(WF),
3688		% add_abort_error_span will fail; hence no need to set _OutState
3689		add_abort_error_span(while_variant_error,'While VARIANT not NATURAL:',VarVal,span_predicate(VAR,LocalState,InState),WF).
3690		b_execute_while_body(_COND,_STMT,_INVARIANT,VAR,PrevVariantValue,VarVal,LocalState,InState,_OutState,WF) :-
3691		% check no longer required VarVal>=0,%is_natural(int(VarVal),WF),
3692		PrevVariantValue \= none,
3693		PrevVariantValue =< VarVal, !, %less_than_equal(int(PrevVariantValue),int(VarVal)),
3694		%ground_constraintprop_wait_flags(WF),
3695		% add_abort_error_span will fail; hence no need to set _OutState
3696		ajoin(['VARIANT = ',VarVal,', previous value = ',PrevVariantValue],Details),
3697		add_abort_error_span(while_variant_error,'While VARIANT not decreasing:',
3698		Details,span_predicate(VAR,LocalState,InState),WF).
3699		b_execute_while_body(COND,STMT,INV,VARIANT,_PrevVariantValue,VarVal,LocalState,InState,OutState,WF) :-
3700		% check no longer required due to cuts above %VarVal>=0, %is_natural(int(VarVal),WF),
3701		%(PrevVariantValue==none -> true ; less_than(int(VarVal),int(PrevVariantValue))),
3702		%ground_constraintprop_wait_flags(WF), % seems to slow down interpretation
3703		copy_wf_start(WF,while_body,CWF),
3704	?	b_execute_statement(STMT,LocalState,InState,LHSUpdates,CWF,_Path1,output_required),
3705		copy_wf_finish(WF,CWF),
3706		ground_det_wait_flag(WF), % TODO: remove this
3707		store_intermediate_updates_wf(InState,LHSUpdates,IntermediateState,STMT,WF),
3708		check_state_skeleton_bound(LHSUpdates,Bound), % otherwise variable lookups will cause problems; ensures IntermediateState skeleton bound
3709		b_execute_while_when_state_set(COND,STMT,INV,VARIANT,VarVal,LocalState,IntermediateState,OutState,WF,Bound).
3710
3711		:- block b_execute_while_when_state_set(?,?,?,?,?,?,?,?,?,-).
3712		b_execute_while_when_state_set(COND,STMT,INV,VARIANT,PrevVariantValue,LocalState,State,Res,WF,_) :-
3713		copy_wf_start(WF,while2,CWF),
3714		b_compute_expression(VARIANT,LocalState,State,VarVal,CWF),
3715		copy_wf_finish(WF,CWF),
3716		b_execute_while1(COND,STMT,INV,VARIANT,PrevVariantValue,VarVal,LocalState,State,Res,WF).
3717
3718		% ------------- IF-THEN-ELSE
3719
3720		:- block b_execute_else_list2(-,?,?,?, ?,?,?,?,?,-,?). % should we also unblock if LWF set ? needed for seq. composition to set up state ??
3721		b_execute_else_list2(PredRes,Body,Rest,LocalState,InState,OutState,InnerWF,CaseNr,Path,LWF,OR) :-
3722		%(var(PredRes) -> print('IF-THEN-ELSE ENUMERATION: '), translate:print_subst(Body),nl ; true),
3723	?	b_execute_else_list3(PredRes,Body,Rest,LocalState,InState,OutState,InnerWF,CaseNr,Path,LWF,OR).
3724
3725		b_execute_else_list3(pred_true,Body,_,LocalState,InState,OutState,WF,CaseNr,if(CaseNr,Path),_,OR) :-
3726	?	push_wait_flag_call_stack_info(WF,b_expr_call(if_then_body,Body),WF2),
3727	?	b_execute_statement(Body,LocalState,InState,OutState,WF2,Path,OR).
3728		b_execute_else_list3(pred_false,_Body,Rest,LocalState,InState,OutState,WF,CaseNr,Path,LWF,OR) :-
3729		CaseNr1 is CaseNr+1,
3730	?	b_execute_else_list(Rest,LocalState,InState,OutState,WF,CaseNr1,Path,LWF,OR).
3731
3732		b_execute_else_list([],_,_State,[],_WF,_,if_skip,_LWF,_OR). /* skip */
3733		b_execute_else_list([TExpr|Rest],LocalState,InState,OutState,WF,CaseNr,Path,LWF,OR) :-
3734		get_texpr_expr(TExpr,if_elsif(Test,Body)), % Info field not used
3735		% get_enumeration_finished_wait_flag(WF,LWF),
3736		InnerWF=WF, %clone_wait_flags_from1(WF,InnerWF),
3737		push_wait_flag_call_stack_info(InnerWF,b_expr_call(if_elsif_test,Test),WF2),
3738	?	b_try_check_boolean_expression_lwf(Test,LocalState,InState,WF2,'$ENUMERATION',PredRes,LWF),
3739		%ground_wait_flag0(InnerWF),
3740		(nonvar(PredRes)
3741		-> b_execute_else_list3(PredRes,Body,Rest,LocalState,InState,OutState,InnerWF,CaseNr,Path,LWF,OR)
3742		; (LWF == '$GENERATE_ON_DEMAND' ->
3743		get_wait_flag0(WF,LWF1),
3744		get_wait_flag_if_necessary(PredRes,LWF1,OR,WF,LWF2)
3745		; LWF2=LWF),
3746	?	b_execute_else_list2(PredRes,Body,Rest,LocalState,InState,OutState,InnerWF,CaseNr,Path,LWF2,OR)
3747		).
3748
3749		% avoid calling get_wait_flag if possible (expensive)
3750		:- block get_wait_flag_if_necessary(-,-,?,?,?).
3751		get_wait_flag_if_necessary(PredRes,_,OR,WF,LWF2) :- var(PredRes), !, % we need waitflag
3752		(preferences:preference(use_smt_mode,true) -> Prio = 2 % was 2.0
3753		; OR == output_required -> Prio = 2000
3754		; Prio = 200000 %last_finite_priority(Prio)
3755		), % TO DO: check if there is a guard inside; if not we can wait much longer; unless we are in CBC mode
3756		get_wait_flag(Prio,if_else,WF,LWF2).
3757		get_wait_flag_if_necessary(_,_,_,_,_).
3758
3759		:- block b_execute_choice(?,?,?,?,?,?,-,?).
3760		b_execute_choice(ChoiceList,LocalState,InState,OutState,WF,choice(Nr,Path),_WFC,OR) :-
3761	?	nth1(Nr,ChoiceList,Choice),
3762		b_execute_statement(Choice,LocalState,InState,OutState,WF,Path,OR).
3763
3764		% execute ASSERT PreCond THEN Body
3765		b_execute_assertion(_PreCond,Body,LocalState,InState,OutState,WF,Path,OR) :-
3766		preference(do_assert_checking,false), % ASSERT checking disabled
3767		!,
3768		b_execute_statement(Body,LocalState,InState,OutState,WF,Path,OR).
3769		b_execute_assertion(PreCond,Body,LocalState,InState,OutState,WF,Path,OR) :-
3770	?	b_try_check_boolean_expression_lwf(PreCond,LocalState,InState,WF,'$ENUMERATION',PredRes,WFC),
3771		% enumeration of PredRes before WFE set make sense, Body can instantiate values
3772		(var(PredRes) -> get_last_wait_flag(assertion,WF,WFC) ; true),
3773		b_execute_assertion_block(PredRes,PreCond,Body,LocalState,InState,OutState,WF,Path,OR).
3774
3775		:- block b_execute_assertion_block(-, ?,?,?,?, ?,?,?,?).
3776		b_execute_assertion_block(pred_true,_PreCond,Body,LocalState,InState,OutState,WF,Path,OR) :-
3777		Path = assertion(IPath),
3778		b_execute_statement(Body,LocalState,InState,OutState,WF,IPath,OR).
3779		b_execute_assertion_block(pred_false,PreCond,_Body,LocalState,InState,_OutState,WF,Path,_OR) :-
3780		Path = assertion_violated,
3781		translate_bexpression(PreCond,PreString),
3782		add_abort_error_span(assert_error,'ASSERT violated: ',PreString,span_predicate(PreCond,LocalState,InState),WF).
3783
3784		:- block check_state_skeleton_bound(-,?).
3785		check_state_skeleton_bound([],true).
3786		check_state_skeleton_bound([bind(Var,_)|T],Res) :-
3787		check_state_skeleton_bound_aux(Var,T,Res).
3788
3789		:- block check_state_skeleton_bound_aux(-,?,?).
3790		check_state_skeleton_bound_aux(Var,T,Res) :-
3791		(atomic(Var) -> true ; print('*** variable name not atomic: '), print(Var),nl),
3792		check_state_skeleton_bound(T,Res).
3793
3794
3795		b_execute_statement_list_when_state_set(StmtList,LS,State,USoFar,Res,WF,Path,OR) :-
3796		check_state_skeleton_bound(State,Bound), % otherwise variable lookups will cause problems
3797	?	b_execute_statement_when_state_set2(StmtList,LS,State,USoFar,Res,WF,Path,Bound,OR).
3798		:- block b_execute_statement_when_state_set2(?,?,?,?,?,?,?,-,?).
3799		b_execute_statement_when_state_set2(StmtList,LS,State,UpdatesSofar,Res,WF,Path,_,OR) :-
3800		copy_wf_start(WF,while2,CWF),
3801	?	b_execute_sequence(StmtList,LS,State,StmtUpdates,CWF,Path,OR),
3802	?	copy_wf_finish(WF,CWF),
3803	?	merge_updates(UpdatesSofar,StmtUpdates,Res).
3804
3805
3806		store_values([], [], []).
3807		store_values([IDsHd|IDsTl], [VALsHd|VALsTl], [bind(IDsHd,VALsHd)|OutStateTl]) :-
3808		store_values(IDsTl, VALsTl, OutStateTl).
3809
3810
3811
3812
3813		/* the B syntax does allow multiple definitions in a LET: */
3814
3815		b_execute_let_definitions(Pred,LocalState,State,WF) :-
3816		is_a_conjunct(Pred,LHS,RHS),!,
3817		b_execute_let_definitions(LHS,LocalState,State,WF),
3818		b_execute_let_definitions(RHS,LocalState,State,WF).
3819		b_execute_let_definitions(b(equal(LHS,RHS),_,_),LocalState,State,WF) :- !,
3820		b_compute_expression(LHS,LocalState,State,LHSVal,WF),
3821		b_compute_expression(RHS,LocalState,State,RHSVal,WF),
3822		% TO DO: ideally we should check if LHS is a declared identifier and is only defined once
3823		kernel_objects:equal_object_optimized(LHSVal,RHSVal,b_execute_let_definitions).
3824		b_execute_let_definitions(b(lazy_let_pred(Id,AssignmentExpr,Body),_,_),LocalState,State,WF) :- !,
3825		add_lazy_let_id_and_expression(Id,AssignmentExpr,LocalState,State,NewLocalState,WF),
3826		b_execute_let_definitions(Body,NewLocalState,State,WF).
3827		b_execute_let_definitions(P,_L,_S,WF) :-
3828		add_internal_error_wf(b_interpreter,'Let contains a predicate which is not an equality: ',P,P,WF),fail.
3829
3830
3831		/* -----------------------------------------*/
3832		/* b_assign_function */
3833		/* -----------------------------------------*/
3834
3835		b_assign_values_or_functions([],[],_LS,_S,[],_WF,_OR).
3836		b_assign_values_or_functions([TExpr|ERest],[Value|VRest],LS,S,[bind(Id,New)|NRest],WF,OR) :-
3837		get_texpr_expr(TExpr,Expr),
3838	?	b_assign_value_or_function(Expr,Value,LS,S,Id,New,WF,OR),
3839		b_assign_values_or_functions(ERest,VRest,LS,S,NRest,WF,OR).
3840
3841		:- use_module(kernel_tools,[ground_value_check/2]).
3842		:- use_module(kernel_records,[overwrite_record_wf/5]).
3843		b_assign_value_or_function(identifier(Id),Value,_LS,_S,LHS_Id,FullValue,WF,_OR) :- !,
3844		LHS_Id=Id,
3845	?	equal_object_wf(FullValue,Value,b_assign_value_or_function(Id),WF).
3846		b_assign_value_or_function(function(Fun,Arg),Value,LocalState,InState,Id,FullValue,WF,OR) :- !,
3847		%b_compute_expression(Arg,LocalState,InState,ArgVal,WF),
3848		%expand_global_sets_but_not_closures(ArgVal,EArgVal),
3849		FunMNF = eval_must_not_fail('Assignment left-hand-side (or part thereof) could not be evaluated: ',Fun), % could be f(..)(..)
3850		b_compute_assign_expressions_when([Arg,FunMNF],LocalState,InState,[ArgVal,FunVal],WF,OR), % or should we pass the OR info around ?
3851		/* we do not examine local state: these vars cannot be modified by operations !? */
3852		(OR=output_required -> override(FunVal,ArgVal,Value,NewFun,WF)
3853		; ground_value_check((FunVal,ArgVal,Value),GRV),
3854		% wait until all arguments known so that we can effiently compute override
3855		blocking_override(GRV,FunVal,ArgVal,Value,NewFun,WF)),
3856		get_texpr_expr(Fun,Lhs),
3857		b_assign_value_or_function(Lhs,NewFun,LocalState,InState,Id,FullValue,WF,OR).
3858		b_assign_value_or_function(record_field(RecordExpr,FieldName),Value,LocalState,InState,LHS_Id,FullValue,WF,OR) :-
3859		!,
3860		% we allow nested record assignments: x'Field1'Field2 := Value
3861		b_compute_expression(RecordExpr,LocalState,InState,OldRecVal,WF),
3862		overwrite_record_wf(OldRecVal,FieldName,Value,NewRecVal,WF),
3863		get_texpr_expr(RecordExpr,Lhs),
3864		b_assign_value_or_function(Lhs,NewRecVal,LocalState,InState,LHS_Id,FullValue,WF,OR).
3865		b_assign_value_or_function(LHS,_Value,_LS,_InState,_Id,_FullValue,WF,_OR) :-
3866		add_internal_error_wf(b_interpreter,'Illegal LHS for assignment (must be ID(.) or ID\'Field or ID): ',LHS,LHS,WF),
3867		fail.
3868
3869		:- block blocking_override(-,?,?,?,?,?).
3870		blocking_override(_,FunVal,ArgVal,Value,NewFun,WF) :- override(FunVal,ArgVal,Value,NewFun,WF).
3871
3872
3873		/* -----------------------------------------*/
3874		/* b_execute_statements_in_parallel */
3875		/* -----------------------------------------*/
3876		/* execute a parallel composition of statements */
3877		:- assert_pre(b_interpreter:b_execute_statements_in_parallel(Ss,LS,State,_Os,WF,_Paths,_OR),
3878		(ground_check(Ss),type_check(LS,store),
3879		type_check(State,store),type_check(WF,wait_flag))).
3880		:- assert_post(b_interpreter:b_execute_statements_in_parallel(_Ss,_LS,_State,Os,WF,_Paths,_OR),
3881		(type_check(Os,store),type_check(WF,wait_flag))).
3882
3883		b_execute_statements_in_parallel([],_,_,[],_WF,[],_OR).
3884		b_execute_statements_in_parallel([Stmt|TS],LocalState,InState,OutState,WF,[Path1|TPath],OR) :-
3885	?	b_execute_statement(Stmt,LocalState,InState,OutState1,WF,Path1,OR),
3886	?	combine_updates(OutState1,OutState2,OutState), /* merge updates */
3887	?	b_execute_statements_in_parallel(TS,LocalState,InState,OutState2,WF,TPath,OR).
3888
3889
3890		%:- block combine_updates(-,-,?).
3891		%combine_updates(A,B,C) :- (B==[] -> A=C ; combine_updates_aux(A,B,C)).
3892
3893		% TO DO: investigate whether we could also unblock on second argument and copy it to result
3894		:- block combine_updates(-,?,?). % can also be used to merge states
3895		combine_updates([],X,R) :- !,R=X.
3896	?	combine_updates([H|T],Y,Res) :- !, Res=[H|Z], combine_updates(T,Y,Z).
3897		combine_updates(X,Y,Z) :- add_internal_error('Illegal call: ',combine_updates(X,Y,Z)),fail.
3898
3899
3900
3901		b_execute_initialisation_statement(Stmt,LS,In,Out,_OUTERWF,Path,OR) :-
3902		init_wait_flags(WF,[b_execute_initialisation_statement]),
3903		% each initialisation can be executed in isolation (except in CBC mode)
3904	?	b_execute_statement(Stmt,LS,In,Out,WF,Path,OR),
3905	?	ground_wait_flags(WF).
3906
3907		% replace certain parallels by init_parallel for better error reporting in INITIALISATION
3908		% will not be used in CBC mode (by set_up_initialisation or tc_initialise)
3909		translate_init_statements(b(Stmt,subst,I),b(TStmt,subst,I)) :-
3910		tp2(Stmt,I,TStmt).
3911		tp2(assign(LHS,RHS),I,parallel(S)) :- LHS=[_,_|_],
3912		% translate multiple assignment into parallel assignments
3913		maplist(generate_assignment(I),LHS,RHS,S),
3914		!.
3915		tp2(Stmt,I,init_statement(b(Stmt,subst,I))) :- %get_preference(provide_trace_information,true),
3916		wrap_stmt(Stmt),
3917		!.
3918		% TO DO: cover WHILE
3919		tp2(parallel(S),_,parallel(TS)) :- maplist(translate_init_statements,S,TS),
3920		!.
3921		tp2(sequence(A),_,sequence(LA)) :- !,maplist(translate_init_statements,A,LA).
3922		tp2(if(A),_,if(LA)) :- !, maplist(translate_init_statements,A,LA).
3923		tp2(if_elsif(Test,Body),_,if_elsif(Test,LBody)) :- !,
3924		translate_init_statements(Body,LBody).
3925		tp2(X,_,X). % :- functor(X,F,A), nl,nl,print(uncovered(F/A)),nl,nl.
3926
3927		wrap_stmt(assign(_,_)).
3928		wrap_stmt(becomes_element_of(_,_)).
3929		wrap_stmt(becomes_such(_,_)).
3930		wrap_stmt(assign_single_id(_,_)).
3931
3932		generate_assignment(I,V,RHS,b(init_statement(b(Assign,subst,I)),subst,I)) :-
3933		Assign = assign([V],[RHS]).
3934
3935
3936
3937		/* ---------------------------------------*/
3938		/* b_execute_top_level_statement */
3939		/* ---------------------------------------*/
3940
3941		/* this is just like b_execute_statement with the
3942		only difference that a PRE-condition is treated like
3943		a select, i.e., it does not generate an abort if used
3944		outside of its condition */
3945		b_execute_top_level_statement(TExpr,LocalState,InState,OutState,WF,Path,OR) :-
3946		get_texpr_expr(TExpr,Stmt),
3947	?	b_execute_top_level_statement2(Stmt,TExpr,LocalState,InState,OutState,WF,Path,OR).
3948		b_execute_top_level_statement2(precondition(PreCond,Body),TExpr,
3949		LocalState,InState,OutState,WF,Path,OR) :-
3950		preferences:preference(treat_outermost_pre_as_select,true),!,
3951		%debug_println(9,'Top level PRE treated as SELECT'),
3952		preference(ltsmin_do_not_evaluate_top_level_guards,NO_EVAL),
3953		(NO_EVAL=true, % do not evaluate guards detected by guard splitting
3954		get_texpr_info(TExpr,Info),member(prob_annotation('LTSMIN-GUARD'),Info)
3955		-> debug_println(9,ltsmin_guard_will_not_be_evaluated)
3956	?	; b_test_boolean_expression(PreCond,LocalState,InState,WF)
3957		),
3958		% b_tracetest_boolean_expression(PreCond,LocalState,InState,WF,one), % comment in for debugging
3959	?	b_execute_statement(Body,LocalState,InState,OutState,WF,Path,OR).
3960		b_execute_top_level_statement2(lazy_let_subst(Id,IdExpr,Body),_,
3961		LocalState,InState,OutState,WF,lazy_let(Path),OR) :-
3962		!,
3963		add_lazy_let_id_and_expression(Id,IdExpr,LocalState,InState,NewLocalState,WF),
3964		b_execute_top_level_statement(Body,NewLocalState,InState,OutState,WF,Path,OR).
3965		b_execute_top_level_statement2(_,TExpr,LocalState,InState,OutState,WF,Path,OR) :-
3966	?	b_execute_statement(TExpr,LocalState,InState,OutState,WF,Path,OR).
3967
3968
3969		/* -----------------------------*/
3970		/* b_execute_operation */
3971		/* -----------------------------*/
3972		/* execute a single operation */
3973
3974		try_get_op_name(FullOperation,_Name) :- var(FullOperation),!.
3975		try_get_op_name('-->'(FO,_),Name) :- !,try_get_op_name(FO,Name).
3976		try_get_op_name(FullOperation,Name) :- functor(FullOperation,Name,_).
3977
3978
3979
3980		:- assert_pre(b_interpreter:b_execute_top_level_operation_update(_Name,_FullOperation,InState,_NewState,_P),
3981		(ground_check(InState),type_check(InState,store))).
3982		:- assert_post(b_interpreter:b_execute_top_level_operation_update(Name,_FullOperation,_InState,NewState,_Path),
3983		(type_check(NewState,store),ground_check(Name))).
3984
3985
3986		b_execute_top_level_operation_update(Name,FullOperation,InState,Updates,Path) :-
3987	?	b_execute_top_level_operation_update_wf(Name,FullOperation,InState,Updates,Path,WF),
3988	?	ground_wait_flags(WF).
3989		%store:store_updates_and_normalise(Updates,InState,NewState).
3990
3991
3992		b_execute_top_level_operation_update_wf(Name,FullOperation,InState,Updates,Path,WF) :-
3993		init_wait_flags(WF,[]), % now treated by call_stack: [expansion_context(op(Name),[])]),
3994		% b_execute_operation2 below will push_wait_flag_call_stack_info
3995		try_get_op_name(FullOperation,Name), b_top_level_operation(Name),
3996		setup_result_input_values(Name,RIV),
3997		Info=unknown, % Info extracted later for top_level
3998	?	b_execute_operation2(Name,FullOperation,InState,Updates,_,RIV,_,true,Path,Info,WF,output_not_required).
3999
4000		% set up value of read output variables *before* operation call to some dummy value
4001		setup_result_input_values(Name,ResultInputValues) :-
4002		(get_preference(allow_operations_to_read_outputs,true),
4003		b_operation_reads_output_variables(Name,_Reads,TReadsInfo) ->
4004		maplist(setup_read_output_variable,TReadsInfo,ResultInputValues)
4005		%translate_bstate_limited(ResultInputValues,TS),
4006		%ajoin(['Warning: setting read output variables in ',Name,' to default values: ',TS],Msg),
4007		%add_warning(b_interpreter,Msg),
4008		%store_error_for_context_state(eventerror(Name,event_other_error(Msg),[]),_Id)
4009		; ResultInputValues=[]).
4010
4011		:- use_module(typing_tools,[any_value_for_type/2]).
4012		setup_read_output_variable(reads_result(_,Name,Type),bind(Name,Val)) :- any_value_for_type(Type,Val).
4013
4014		% for use by CBC:
4015		b_execute_top_level_operation_wf(Name,FullOperation,ParaVals,ResultVals,InState,NewState,Path,WF) :-
4016		try_get_op_name(FullOperation,Name),
4017		if(b_top_level_operation(Name),true,
4018		(add_internal_error('Unknown operation name for b_execute_top_level_operation_wf: ',Name),fail)
4019		),
4020		% call before execute operation to copy over results immediately in case b_execute_operation2 generates choice points:
4021		store_intermediate_updates_wf(InState,Updates,NewState,operation(Name),WF), % no normalising is better for constraint propagation
4022		% TO DO?: copy over unmodified variables b_get_machine_variables(Variables),copy_unmodified_variables(Variables,OpName,InState,NewState)
4023		setup_result_input_values(Name,RIV),
4024		Info=unknown, % Info extracted later for top_level
4025		b_execute_operation2(Name,FullOperation,InState,Updates,ParaVals,RIV,ResultVals,true,Path,Info,WF,output_required).
4026		% we should ensure that Operation part is executed to instantiate NewOutState skeleton
4027
4028
4029
4030		% Note : if the argument OR (OutputRequired) has value output_required this indicates that the output
4031		% an operation or its effect is required (e.g., because of sequential composition) and the constraint solver
4032		% should not delay computing the effect of the operation
4033		% Atelier-B Handbook 6.16: [R <- op (E)]P = [X := E ; S ; R :=Y] P where op defined by X <- op(Y) = S
4034		b_execute_operation_with_parameters(Name,LocalState,InState,Results,Parameters,OutState,ParamValues,ResultValues,
4035		Path,Info,WF,OR) :-
4036		(b_is_operation_name(Name)
4037		-> b_compute_expressions(Parameters,LocalState,InState,ParamValues,WF),
4038		% TO DO : remove local vars from InState
4039		(b_operation_reads_output_variables(Name,_Reads,TReadsInfo)
4040		-> % format('Transferring outputs ~w ~w~n ~w~n',[Name,_Reads,TReadsInfo]),
4041		maplist(output_parameters_value(LocalState,InState,Results,Info,WF),TReadsInfo,ResultInputValues)
4042		; ResultInputValues=[]),
4043	?	call_b_execute_operation2(Name,InState,OutState,ParamValues,ResultInputValues,ResultValues,false,
4044		Path,Info,WF,OR)
4045		; add_internal_error('Unknown B operation, cannot call: ',
4046		b_execute_operation_with_parameters(Name,LocalState,InState,Results,Parameters,
4047		OutState,ParamValues,ResultValues,Path,Info,WF,OR)),
4048		fail
4049		).
4050
4051
4052		%b_execute_operation_in_expression(Name,_LocalState,_InState,_Parameters,_Value,Info,_WF) :-
4053		% % This clause is disabled: sometimes variables are marked as read even though they are not:
4054		% % the analysis is not precise due to sequential composition, CASE statements, ...
4055		% b_operation_reads_output_variables(Name,_Reads,_TReadsInfo),!,
4056		% add_error(b_interpreter,'Operation that reads output cannot be called in expression: ',Name,Info),
4057		% fail.
4058		b_execute_operation_in_expression(Name,LocalState,InState,Parameters,Value,Info,WF) :-
4059		% TODO: check that this is a query operation; probably done in type checker
4060		OR=output_required, % alternative: OR=output_not_required,
4061		setup_result_input_values(Name,ResultInputValues),
4062		b_compute_expressions(Parameters,LocalState,InState,ParamValues,WF),
4063		(b_get_operation_normalized_read_write_info(Name,Read,_Modified)
4064		-> true % Modified should be []
4065		; member(reads(Read),Info)
4066		-> add_message(b_interpeter,'Unregistered operation in expression: ',Name) % prefixed operation not found
4067		; add_error(b_interpeter,'Cannot obtain read-write info for operation in expression:',Name),
4068		Read=[]
4069		),
4070		create_inner_wait_flags(WF,operation_call_in_expr,OpWF),
4071		ground_value_check(ParamValues,ParaGround),
4072		exclude(unused_variable(Read),InState,IS),
4073		ground_state_check(IS,StateGround),
4074		% TO DO: in case of recursion it may be good to delay executing sub-operation until some WF is set
4075		call_b_execute_operation2(Name,IS,_OutState,ParamValues,ResultInputValues,ResultValues,false,_Path,Info,OpWF,OR),
4076		ground_inner_wf(ParaGround,StateGround,OpWF),
4077		make_couplise(ResultValues,Value).
4078
4079		% ground inner waitflags when parameters and relevant read variables fully known
4080		:- block ground_inner_wf(-,?,?), ground_inner_wf(?,-,?).
4081		ground_inner_wf(_,_,WF) :-
4082	?	ground_inner_wait_flags(WF).
4083
4084		call_b_execute_operation2(Name,InState,OutState,ParamValues,ResultInputValues,ResultValues,false,Path,Info,WF,OR) :-
4085	?	runtime_profiler:profile_single_call(Name,unknownStateId, b_interpreter:
4086		b_execute_operation2(Name,_,InState,OutState,ParamValues,ResultInputValues,ResultValues,false,Path,Info,WF,OR)
4087		).
4088
4089		output_parameters_value(LocalState,InState,Results,_,WF,reads_result(Index,ID,_Type),bind(ID,Val)) :-
4090		nth1(Index,Results,ReadResultTID),!,
4091		def_get_texpr_id(ReadResultTID,ReadID),
4092		(lookup_value_without_check(ReadID,LocalState,InState,Val)
4093		-> true %check_not_undefined(Val,ReadID,ReadResultTID)
4094		; add_error_wf(output_parameters,'Could not obtain value for read output parameter: ',ReadID,ReadResultTID,WF),
4095		Val = term(undefined)).
4096		output_parameters_value(_LocalState,_InState,_Results,Info,WF,reads_result(_Index,ID,_Type),bind(ID,Val)) :-
4097		add_error_wf(output_parameters,'Could not obtain value for read output parameter: ',ID,Info,WF),
4098		Val = term(undefined).
4099
4100		% TO DO: use this ?
4101		%:- block check_not_undefined(-,?,?).
4102		%check_not_undefined(term(undefined),ReadID,ReadResultTID) :- !,
4103		% add_error(output_parameters_value,'Output parameter not assigned to: ',ReadID,ReadResultTID).
4104		%check_not_undefined(_,_,_).
4105
4106		:- use_module(probsrc(succeed_max),[assert_max_reached/1]).
4107		% ResultInputValues: in Atelier-B result parameters can also be read !
4108		b_execute_operation2(Name,Operation,InState,Updates,ParaValues,ResultInputValues,ResultValues,_TopLvl,TransInfo,_,_WF,_OR) :-
4109		ResultInputValues = [], % in this case the operation's behaviour also depends on current value of output variables
4110		lookup_cached_transitions(Name,InState,Info,Solutions),!,
4111		(member(max_reached,Info) -> assert_max_reached(Name) ; true),
4112	?	member(trans_cached(ParaValues,ResultValues,Updates,TransInfo),Solutions),
4113		create_full_operation(Name,ResultValues,ParaValues,ResultValues,Operation).
4114		% TODO: call operation with ParaValues if not found and max_reached is true !!
4115
4116		b_execute_operation2(Name,Operation,InState,NewOutState,ParaValues,ResultInputValues,ResultValues,
4117		TopLevel,TransInfo,Info,WF,OutputRequired) :-
4118		if(b_get_machine_operation_for_animation(Name,Results,Parameters,Body,OType,TopLevel,OpPos),
4119		true,
4120		(add_error_wf(b_interpreter,'Cannot find operation:',Name,Info,WF),fail)),
4121		%% % we do not want skip the evaluation of a guard of an operation with parameters
4122		(Info=unknown, TopLevel==true -> CallInfo=OpPos ; CallInfo=Info),
4123		push_wait_flag_call_stack_info(WF,operation_call(Name,ParaValues,CallInfo),WF2),
4124	?	b_execute_operation3(OType,Name,Operation,
4125		InState,NewOutState,
4126		Body,Parameters,ParaValues,Results,ResultInputValues,ResultValues,TopLevel,TransInfo,WF2,OutputRequired).
4127
4128		create_full_operation(Name,Results,ParaValues,ResultValues,FullOperation) :-
4129		Operation =.. [Name|ParaValues], % TO DO: catch if > 255 args (max_arity)
4130		( Results == [] -> /* we have an ordinary operation */
4131		FullOperation = Operation
4132		; FullOperation = '-->'(Operation,ResultValues)
4133		).
4134
4135		b_execute_operation3(classic,Name,Operation,InState,NewOutState,
4136		Body,Parameters,ParaValues,Results,ResultInputValues,NormalisedResultValues,TopLevel,
4137		[path(Path)], % as path is currently filtered out anyway and not stored !
4138		WF,OR) :-
4139		%print('Attempting Operation ----> '),print(Name),nl,
4140		empty_state(EmptyState),
4141	?	set_up_typed_localstate(Parameters,ParaValues,ParamTypedVals,EmptyState,LocalState,positive),
4142		l_expand_and_normalise_values(ParaValues,NormalisedParaValues,Parameters),
4143		% not useful for call_b_execute_operation2
4144		create_full_operation(Name,Results,NormalisedParaValues, % ditto
4145		NormalisedResultValues,Operation),
4146		set_up_undefined_localstate_with_predefined(Results,ResultInputValues,InState,NewInState),
4147		/* to avoid error messages with sequential composition (store_intermediate_updates) */
4148		check_additional_guard(TopLevel,LocalState,NewInState,WF),
4149		(TopLevel==true
4150	?	-> b_execute_top_level_statement(Body,LocalState,NewInState,OutState,WF,Path,OR)
4151	?	; b_execute_statement(Body,LocalState,NewInState,OutState,WF,Path,OR)
4152		),
4153		b_tighter_enumerate_all_values(ParamTypedVals,WF),
4154		% moved after execute for performance reasons; see PerformanceTests/ParameterEnumeration.mch
4155		% print_bt_message('Operation Successful ------> '),
4156		(preferences:preference(treat_outermost_pre_as_select,true),
4157		preferences:preference(require_operations_to_assign_all_outputs,true)
4158		-> ReportError = true ; ReportError = false),
4159		get_results(Results,OutState,NormalisedResultValues,NewOutState,ReportError,normalise_results,WF).
4160		b_execute_operation3(eventb_operation(ChangeSet,ParaValues,Operation),
4161		_Name,Operation, InState,Updates,
4162		TBody,Parameters,ParaValues,[],[],[],true,TransInfo,WF,OutputRequired) :-
4163		% TO DO: check if need to pass _OutputRequired to b_event
4164	?	b_execute_event_with_change_set_wf(TBody,Parameters,ParaValues,InState,ChangeSet,Updates,TransInfo,WF,OutputRequired).
4165
4166		:- use_module(b_global_sets,[add_prob_deferred_set_elements_to_store/3]).
4167		% additional guards can be set by the user to constrain/direct the execution of operations
4168		check_additional_guard(TopLevel,LocalState,State,WF) :-
4169		(TopLevel==true,
4170		bmachine:b_machine_temp_predicate(TempPred)
4171		/* an additional precondition typed in by the user */
4172		-> check_state_skeleton_bound(LocalState,LB),
4173		check_state_skeleton_bound(State,BB),
4174		check_additional_guard_when_bound(LB,BB,TempPred,LocalState,State,WF)
4175		; true
4176		).
4177
4178		:- block check_additional_guard_when_bound(-,?,?, ?,?,?), check_additional_guard_when_bound(?,-,?, ?,?,?).
4179		check_additional_guard_when_bound(_,_,TempPred,LocalState,State,WF) :-
4180		(debug_mode(on) -> print(check_additional_guard),nl, print_bexpr(TempPred),nl ; true),
4181		add_prob_deferred_set_elements_to_store(State,BState1,visible),
4182		b_test_boolean_expression(TempPred,LocalState,BState1,WF).
4183
4184		% additional properties can either be set by user or by command-line or by VALUES clause
4185		add_additional_properties(OldProperty,NewProperty) :-
4186		(bmachine:b_machine_temp_predicate(TempPred) % this overrides additional property !
4187		-> conjunct_predicates([TempPred,OldProperty],NewProperty)
4188		; findall(AddPred,b_machine_additional_property(AddPred),L),
4189		(L=[] -> NewProperty = OldProperty
4190		; conjunct_predicates([OldProperty|L],NewProperty)
4191		)
4192		).
4193
4194		% get removes results from OutState
4195		filter_results(Results,OutState,NewOutState,WF) :-
4196		get_results(Results,OutState,_ResultValues,NewOutState,false,do_not_normalise,WF).
4197		get_results(Results,OutState,ResultValues,NewOutState,ReportError,Normalise,WF) :-
4198		(Results==[] -> (ResultValues,NewOutState) = ([],OutState)
4199		; get_results1(Results,OutState,ResultValues,NewOutState,ReportError,Normalise,WF)).
4200		:- block get_results1(?,-,?,?,?,?,?).
4201		get_results1([],OutState,[],OutState,_ReportError,_Normalise,_WF).
4202		get_results1([R|Results],OutState,[NRV|ResultValues],NewOutState,ReportError,Normalise,WF) :-
4203		def_get_texpr_id(R,ResultId),
4204		lookup_and_delete_value(ResultId,RV,OutState,OutState2,ReportError,WF,Finished),
4205		get_results2(Finished,R,Results,RV,NRV,OutState2,ResultValues,NewOutState,ReportError,Normalise,WF).
4206		:- block get_results2(-,?,?,?,?,?,?,?,?,?,?).
4207		get_results2(_,R,Results,RV,NRV,OutState2,ResultValues,NewOutState,ReportError,Normalise,WF) :-
4208		(Normalise==normalise_results -> normalise_value_for_var(R,true,RV,NRV)
4209		;
4210		NRV=RV), % Maybe we should not normalise in CBC mode ?
4211		get_results1(Results,OutState2,ResultValues,NewOutState,ReportError,Normalise,WF).
4212
4213
4214
4215		/* ------------------------------------------------------------------ */
4216		/* SET UP CONSTANTS */
4217		/* ------------------------------------------------------------------ */
4218
4219		:- use_module(static_ordering).
4220
4221		:- volatile no_solution_found_for_constants/0, properties_were_filtered/1,
4222		unsat_properties_component/2, unsat_properties_enumeration_warning/1, unsat_properties_abort_error/1,
4223		unsat_properties_conjunct_inside_component/4.
4224		:- dynamic no_solution_found_for_constants/0,
4225		properties_were_filtered/1,
4226		unsat_properties_component/2, unsat_properties_enumeration_warning/1,
4227		unsat_properties_abort_error/1,
4228		unsat_properties_conjunct_inside_component/4.
4229
4230		reset_unsat_component_infos :-
4231		retractall(unsat_properties_component(_,_)),
4232		retractall(unsat_properties_enumeration_warning(_)),
4233		retractall(unsat_properties_abort_error(_)),
4234		retractall(unsat_properties_conjunct_inside_component(_,_,_,_)).
4235
4236		:- use_module(b_interpreter_components,[unsat_conjunct_inside_component/4, unsat_component_abort_error/1,
4237		unsat_component_enumeration_warning/1]).
4238		% store information about unsatisfiable components for later usage
4239		% will only be called when no solution found for components
4240		assert_unsat_component_infos(_) :-
4241		unsat_component(X,FalseOrUnknown), % from b_interpreter_components
4242		assertz(unsat_properties_component(X,FalseOrUnknown)),fail.
4243		assert_unsat_component_infos(_) :-
4244		unsat_component_enumeration_warning(X), % from b_interpreter_components
4245		assertz(unsat_properties_enumeration_warning(X)),fail.
4246		assert_unsat_component_infos(_) :-
4247		unsat_component_abort_error(X), % from b_interpreter_components
4248		assertz(unsat_properties_abort_error(X)),fail.
4249		assert_unsat_component_infos(_) :-
4250		unsat_conjunct_inside_component(X,BE,Status,Reason), % from b_interpreter_components
4251		assertz(unsat_properties_conjunct_inside_component(X,BE,Status,Reason)),fail.
4252		assert_unsat_component_infos(Status) :-
4253		(unsat_conjunct_inside_component(_,_,false,_) -> Status = false
4254		; unsat_component(X,false), \+ unsat_component_abort_error(X) -> Status = false % what about enumeration warnings?
4255		; Status=unknown).
4256
4257
4258		all_unsat_components_marked_prob_ignore :-
4259		unsat_properties_conjunct_inside_component(_,_,unknown,'prob-ignore'), % at least one prob-ignore was used
4260		!,
4261		\+ non_ignore_unsat_component.
4262
4263		non_ignore_unsat_component :-
4264		unsat_properties_conjunct_inside_component(_,_,Status,Reason),
4265		\+ (Status = unknown, Reason = 'prob-ignore').
4266
4267		tcltk_unsatisfiable_components_exist :- unsat_or_unknown_component_exists,!.
4268
4269		%tcltk_unsatisfiable_components(list(UnsatComponents)) :-
4270		% findall(C,unsat_properties_component(C),UnsatComponents), UnsatComponents\=[].
4271
4272		get_property_components(Components) :-
4273		b_machine_has_constants_or_properties,
4274		b_get_properties_from_machine(Properties),
4275		add_additional_properties(Properties,NewProperty),
4276		bsyntaxtree:predicate_components(NewProperty,Components),!.
4277		get_property_components([]).
4278
4279		:- dynamic uses_implementable_integers/0.
4280		:- dynamic min_max_integer_value_used/2.
4281
4282
4283		tcltk_quick_describe_unsat_properties(list(FullDescr),STATUS) :-
4284		retractall(uses_implementable_integers),
4285		retractall(min_max_integer_value_used(_,_)), assertz(min_max_integer_value_used(none,none)),
4286		get_property_components(Components),
4287		(unsat_properties_conjunct_inside_component(_,_,false,_)
4288		-> STATUS='FALSE'
4289		; all_unsat_components_marked_prob_ignore
4290		-> STATUS = 'prob-ignore'
4291		; STATUS='UNKNOWN'
4292		),
4293		findall(TP, (unsat_properties_conjunct_inside_component(CompNr,P,_Status,_ReasonMsg), % find individual conjuncts
4294		% Status can be false or unknown
4295		nth1(CompNr,Components,component(FullPred,_Vars)),
4296		check_uses_implementable_integers(FullPred), % for the min-max one may need to look at the entire component !
4297		translate_bexpression_with_limit(P,TrP),
4298		get_component_enum_warning_message(CompNr,EnumWarningAbortMsg),
4299		(EnumWarningAbortMsg = '' -> Prefix = '' ; Prefix = '\n '),
4300		get_span_msg(P,'\n ',SpanMsg),
4301		ajoin([' * ',TrP,Prefix,EnumWarningAbortMsg,SpanMsg,'\n'],TP)),
4302		D1),
4303		findall([Msg1,PS|DescrVars],
4304		(get_unsat_component_description(Components,CompNr,MaxCompNr,
4305		Size,PS,DescrVars,EnumWarningAbortMsg,SpanMsg),
4306		ajoin([' * Predicate Component ',EnumWarningAbortMsg,CompNr,'/',MaxCompNr,
4307		' (with ',Size,' conjunct(s))',SpanMsg, ':'],Msg1)),
4308		UC),
4309		append(UC,UCL), % join all component descriptions
4310		(D1=[]
4311		% TO DO: adapt message for enumeration warning
4312		-> Descr = D2,
4313		(UCL=[] -> D2 = ['The properties were satisfiable']
4314		; D2 = ['No solution found for the following predicates: '|UCL]
4315		)
4316		; Descr = ['The following properties prevented finding a solution:\n'|D12],
4317		% Comment: the predicate can trigger the computation of another earlier registered predicate
4318		% Example f = {1|->2} & f: A --> B & A = 1..5; A=1..5 triggers the check for f
4319		(UCL=[] -> D2=[]
4320		; D2 = ['\nIn addition no solution was found for the following predicates: '|UCL]
4321		),
4322		append(D1,D2,D12)),
4323		findall(W,other_warning(W),Warnings),
4324		(Warnings = [] -> FullDescr=Descr ; append(Descr,['\nWARNINGS/MESSAGES:'|Warnings],FullDescr)).
4325
4326		% called by predicate_debugger:
4327		get_unsat_component_predicate(CompNr,Predicate,Vars) :-
4328		unsat_properties_component(CompNr,_FalseOrUnknown),
4329		get_property_components(Components),
4330		nth1(CompNr,Components,component(Predicate,Vars)).
4331
4332		get_unsat_component_description(Components,CompNr,MaxCompNr,Size,PS,DescrVars,EnumWarningAbortMsg,SpanMsg) :-
4333		unsat_properties_component(CompNr,_),
4334		\+ unsat_properties_conjunct_inside_component(CompNr,_,_,_), % we have not yet dealt with this component in first findall above
4335		nth1(CompNr,Components,component(Pred,Vars)),
4336		length(Components,MaxCompNr),
4337		size_of_conjunction(Pred,Size),
4338		describe_constants(Vars,DescrVars),
4339		check_uses_implementable_integers(Pred), % store information in case it does use implementable integers for later user messages
4340		(debug_mode(on) -> Lim = 1500 ; Lim = 250),
4341		translate_bexpression_with_limit(Pred,Lim,PS),
4342		get_component_enum_warning_message(CompNr,EnumWarningAbortMsg),
4343		% note: sometimes we have a conjunction with empty span info, but different conjuncts (possibly from different files):
4344		get_span_msg(Pred,'\n ',SpanMsg).
4345
4346		get_span_msg(Pred,Prefix,SpanMsg) :-
4347		(extract_span_description(Pred,SpanStr) -> ajoin([Prefix,SpanStr],SpanMsg) ; SpanMsg = '').
4348
4349		get_component_enum_warning_message(CompNr,EnumWarningAbortMsg) :-
4350		(unsat_properties_enumeration_warning(CompNr)
4351		->(unsat_properties_abort_error(CompNr)
4352		-> EnumWarningAbortMsg = '[** with Enumeration Warning and WD-ERROR **] '
4353		; EnumWarningAbortMsg = '[* with Enumeration Warning *] ')
4354		; (unsat_properties_abort_error(CompNr)
4355		-> EnumWarningAbortMsg = '[** with WD-ERROR **] '
4356		; EnumWarningAbortMsg = '')
4357		).
4358
4359		describe_constants([],R) :- !,R=[].
4360		describe_constants(Vars,['* over identifiers : '|Vars]).
4361
4362		check_uses_implementable_integers(_) :- specfile:eventb_mode,!. % cannot use implementable integers
4363		check_uses_implementable_integers(_) :- uses_implementable_integers,!. % no need to check another component
4364		check_uses_implementable_integers(Pred) :-
4365		(uses_implementable_integers(Pred)
4366		-> assertz(uses_implementable_integers),
4367		retract(min_max_integer_value_used(Min,Max)),
4368		min_max_integer_value_used(Pred,Min,Max,NewMin,NewMax),
4369		assertz(min_max_integer_value_used(NewMin,NewMax))
4370		; true).
4371
4372		other_warning(W) :- uses_implementable_integers,
4373		preferences:get_preference(minint,MININT),
4374		preferences:get_preference(maxint,MAXINT),
4375		min_max_integer_value_used(Min,Max),
4376		( (number(Min),Min<MININT ; number(Max),Max>MAXINT)
4377		-> ajoin(['\n MININT...MAXINT only set to ',MININT,'..',MAXINT,' but integers used at least from ',Min,'..',Max],W)
4378		; (MAXINT < 127 ; MININT > -128)
4379		-> ajoin(['\n MININT...MAXINT possibly too small: ',MININT,'..',MAXINT],W)).
4380		% TO DO: we could also extract explicit integer values used in the component and compare them against MININT/MAXINT
4381		other_warning(W) :- bmachine_eventb:deferred_set_equality_without_enumeration_axioms(X,_Set),
4382		translate_bexpression_with_limit(X,XS),
4383		ajoin(['\n Set not recognized as enumerated: ',XS],W).
4384		% TO DO: generate warning if MAXINT/MININT small and NAT,NAT1 or INT was used in component(s) above
4385
4386		% call if tcltk_quick_describe_unsat_properties fails:
4387		% TODO: maxint warning above
4388		generate_unsat_properties_warnings :- uses_implementable_integers,
4389		preferences:get_preference(minint,MININT),
4390		preferences:get_preference(maxint,MAXINT),
4391		min_max_integer_value_used(Min,Max),
4392		(number(Min),Min<MININT ; number(Max),Max>MAXINT),
4393		ajoin(['MININT...MAXINT only set to ',MININT,'..',MAXINT,' but integers used at least from ',Min,'..',Max],Msg),
4394		add_warning(setup_constants_unknown,Msg),
4395		fail.
4396		generate_unsat_properties_warnings :-
4397		bmachine_eventb:deferred_set_equality_without_enumeration_axioms(X,Set),
4398		translate_bexpression_with_limit(X,TX),
4399		Eq = b(equal(X,Set),pred,[]),
4400		ajoin(['Deferred SET ',TX,' was not recognized as an enumerated set, you may want to use partition instead of the equality: '],Msg),
4401		add_warning(setup_constants_unknown,Msg,Eq,X),
4402		fail.
4403		generate_unsat_properties_warnings.
4404
4405		% -------------
4406
4407		% Complete is either complete_properties or partial_properties if properties were marked as ignore
4408		b_set_up_concrete_constants(NormalisedConstantsState,Complete) :-
4409		reset_unsat_component_infos,
4410		retractall(properties_were_filtered(_)),
4411		(no_solution_found_for_constants -> true ; assertz(no_solution_found_for_constants)),
4412		% preference(allow_incomplete_partial_setup_constants,AllowSkipping),
4413		reset_component_info(true),
4414		b_machine_has_constants_or_properties,
4415		b_get_machine_constants(UnsortedConstants),
4416		!,
4417		silent_mode(SilentMode),
4418	?	(SilentMode=on -> true ; bt_start_ms_timer('SETUP_CONSTANTS')), % TO DO: store time for unsat core
4419		b_get_properties_from_machine(MProperties),
4420		(get_preference(use_ignore_pragmas,true) % filter out prob-ignore predicates here
4421		-> conjunction_to_list(MProperties,LMP), % TO DO avoid this conversion and back
4422		exclude_count(predicate_has_ignore_pragma, LMP,LMP2,Excluded), % exclude props marked as prob-ignore
4423		conjunct_predicates(LMP2,MProperties2),
4424		%format('FILTERED (~w): ',[Excluded]),translate:print_bexpr(MProperties2),nl,
4425		(Excluded=0 -> Complete=complete_properties
4426		; assertz(properties_were_filtered(Excluded)), Complete=partial_properties)
4427		; MProperties2=MProperties,
4428		Complete=complete_properties
4429		),
4430		add_additional_properties(MProperties2,Properties),
4431		project_onto_static_assertions(Properties,UnsortedConstants,PProperties,PUnsortedConstants),
4432	?	solve_properties(PProperties,PUnsortedConstants,ConstantsState),
4433	?	(SilentMode=on -> true ; bt_stop_ms_timer('SETUP_CONSTANTS')),
4434		normalise_store(ConstantsState,NormalisedConstantsState),
4435		retractall(no_solution_found_for_constants). /* ensure that b_partial_set_up_concrete_constants fails */
4436		b_set_up_concrete_constants([],complete).
4437
4438
4439		% solve already projected and filtered properties and constants, return state with solution for constants
4440		% cbc_solve_timed almost does what we want; but looks at current state; see solve_free_aux
4441		% TODO: move this to a separate module and add cdclt
4442		solve_properties(PProperties,PUnsortedConstants,ConstantsState) :-
4443		get_preference(use_solver_on_load,Solver),
4444	?	solve_properties(Solver,PProperties,PUnsortedConstants,ConstantsState).
4445
4446		solve_properties(sat,Properties,_TypedConstants,ConstantsState) :- !,
4447	?	b2sat:solve_predicate_with_satsolver_free(Properties, ConstantsState,Result,[]),
4448		Result=solution(_).
4449		solve_properties('sat-z3',Properties,_TypedConstants,ConstantsState) :- !,
4450		b2sat:solve_predicate_with_satsolver_free(Properties, ConstantsState,Result,[use_satsolver(z3)]),
4451		Result=solution(_).
4452		solve_properties(cdclt,Properties,_TypedConstants,ConstantsState) :- !,
4453		cdclt_solver:cdclt_solve_predicate(Properties,_,Result),
4454		Result=solution(ConstantsState).
4455		solve_properties(clingo,Properties,_TypedConstants,ConstantsState) :- !,
4456		get_preference(maxNrOfInitialisations,MaxNrSols),
4457		b2asp:solve_pred_with_clingo(Properties,MaxNrSols,_,Result,_Exhaustive),
4458		% TODO: check if non_exhaustive and assert max_reached ?
4459		Result=solution(ConstantsState).
4460		solve_properties(kodkod,PProperties,PUnsortedConstants,ConstantsState) :- !,
4461	?	solve_properties(prob,PProperties,PUnsortedConstants,ConstantsState). % Kodkod processing is done elswehere
4462		solve_properties(prob,PProperties,PUnsortedConstants,ConstantsState) :- !,
4463		(preferences:preference(use_static_ordering,true)
4464		-> sort_ids_by_usage(PUnsortedConstants,PProperties,Constants,no_warnings), % no_warnings as Ids could be used in operations, assertions, ...
4465		set_up_typed_localstate(Constants,_FreshVars,TypedVals,[],SortedState,positive),
4466	?	reorder_state(PUnsortedConstants,SortedState,ConstantsState)
4467		; Constants = PUnsortedConstants,
4468	?	set_up_typed_localstate(Constants,_FreshVars,TypedVals,[],ConstantsState,positive)
4469		),
4470		% now try and load saved constants from file for sub-machines when -cache is used:
4471		load_partial_constants(ConstantsState,PProperties,LPProperties), % Note: this can backtrack
4472		reset_component_info(true), % reset in case load_partial_constants backtracks! relevant for test 2112
4473		b_global_sets:static_symmetry_reduction_for_global_sets(ConstantsState),
4474	?	b_trace_test_components_full(LPProperties,ConstantsState,TypedVals).
4475		solve_properties(SolverName,Properties,_TypedConstants,ConstantsState) :-
4476		temporary_set_preference(z3_solve_for_animation, true,Chng),
4477		call_cleanup(smt_solvers_interface:smt_solve_predicate_free(SolverName, Properties, ConstantsState),
4478		reset_temporary_preference(z3_solve_for_animation,Chng)).
4479
4480
4481		b_trace_test_components_full(LPProperties,ConstantsState,TypedVals) :-
4482		init_wait_flags_and_push_call_stack(no_wf_available,operation_call('SETUP_CONSTANTS',[],unknown),WF),
4483	?	b_trace_test_components_wf(LPProperties,ConstantsState,TypedVals,WF),
4484		ground_wait_flags(WF), % WF is just a dummy waitflag to pass call stack info
4485		(unsat_or_unknown_component_exists -> (!,fail) ; true). % otherwise some expressions were skipped; use partial_set_up
4486
4487		:- volatile project_properties_on_identifiers/1.
4488		:- dynamic project_properties_on_identifiers/1.
4489		set_projection_on_static_assertions(ALL) :-
4490		% set interpreter in mode which projects out all constants not needed
4491		% for static assertion checking; all variables are also projected out
4492		retractall(project_properties_on_identifiers(_)),
4493		(b_get_assertions(ALL,dynamic,[]) -> true
4494		; nl,print('*** WARNING: DYNAMIC B ASSERTIONS NOT EMPTY'),nl,nl),
4495	?	b_get_assertions(ALL,static,L),
4496		(L=[] -> nl,print('*** WARNING: NO STATIC B ASSERTIONS ***'),nl,nl ; true),
4497		conjunct_predicates(L,Conj),
4498		(debug_mode(on) -> print('Static Assertion: '),translate:print_bexpr(Conj),nl ; true),
4499		bsyntaxtree:predicate_identifiers(Conj,IDs),
4500		(debug_mode(on) -> print('IDS: '), print(IDs),nl ; true),
4501		assertz(project_properties_on_identifiers(IDs)).
4502
4503		% optionally project properties onto those required for checking assertions
4504		project_onto_static_assertions(Properties,Constants,NewProperties,NewConstants) :-
4505		%% set_projection_on_static_assertions(main), %% main or all %% set by probcli if we_need_only_static_assertions
4506		project_properties_on_identifiers(ProjIDs),
4507		bsyntaxtree:project_predicate_on_identifiers(Properties,ProjIDs,NewProperties,PIDs,_),
4508		sort(PIDs,SIPDs),
4509		debug_println(9,projecting(SIPDs)),
4510		include(keep_constant(SIPDs),Constants,NewConstants),!. % Constants is a typed identifier list.
4511		project_onto_static_assertions(Properties,Constants,Properties,Constants).
4512
4513		keep_constant(SIPDs,TypedID) :- get_texpr_id(TypedID,ID),ord_member(ID,SIPDs).
4514
4515
4516
4517		/* can be called if b_set_up_concrete_constants failed; will partially set up the state using values found in first ground value propagation phase */
4518		:- use_module(specfile,[get_specification_description/2]).
4519		b_partial_set_up_concrete_constants(NormalisedConstantsState) :-
4520		assert_unsat_component_infos(Status), % Status is false or unknown
4521		no_solution_found_for_constants,
4522		(b_partial_set_up_concrete_constants2(NormalisedConstantsState,Status)
4523		-> generate_unsat_properties_warnings
4524		; generate_unsat_properties_warnings,fail).
4525
4526		b_partial_set_up_concrete_constants2(NormalisedConstantsState,Status) :-
4527		b_get_machine_constants(Constants),
4528		Constants \= [],
4529	?	(det_solution_for_constant_was_stored(Cst1) -> true), % we have found a solution for at least one constant
4530		%set_up_typed_localstate(Constants,[],ConstantsState), -> can create call_residue due to typing fd/2 values
4531		findall(bind(ID,_),(member(TID,Constants),def_get_texpr_id(TID,ID)),ConstantsState),
4532		formatsilent('SETUP_CONSTANTS not successful, but solutions were found for some constants (e.g., ~w):~n',[Cst1]),
4533		(fill_in_det_solutions(ConstantsState,FC)
4534		-> All=all, TMSG = [')']
4535		; All=some, TMSG = [', e.g., ',Cst1,')']
4536		),
4537		(preference(allow_incomplete_partial_setup_constants,true)
4538		-> true
4539		; % fill_in_det_solutions will fail if not all constants valued and
4540		% if allow_incomplete_partial_setup_constants is false
4541		get_specification_description(properties,PS),
4542		% TO DO: determine if time-out occurred or not
4543		(Status=false
4544		-> ajoin([PS,' are unsatisfiable (but ',All,' CONSTANTS valued'|TMSG],Msg),
4545		add_error(setup_constants_inconsistent,Msg)
4546		; unsat_properties_abort_error(_)
4547		-> ajoin([PS,' are unknown due to well-definedness error(s) (but ',All,' CONSTANTS valued'|TMSG],Msg),
4548		add_error(setup_constants_unknown,Msg)
4549		; unsat_component_enumeration_warning(_)
4550		-> ajoin([PS,' are unknown due to enumeration warning(s) (but ',All,' CONSTANTS valued'|TMSG],Msg),
4551		add_error(setup_constants_unknown,Msg)
4552		; all_unsat_components_marked_prob_ignore
4553		-> ajoin([PS,' are unknown due to prob-ignore pragmas (but ',All,' CONSTANTS valued'|TMSG],Msg),
4554		add_message(setup_constants_unknown,Msg)
4555		;
4556		ajoin([PS,' are unknown (but ',All,' CONSTANTS valued'|TMSG],Msg),
4557		% typical message: but some CONSTANTS valued
4558		add_error(setup_constants_unknown,Msg)
4559		),
4560		All=all % only continue if all constants valued
4561		),
4562		normalise_store(FC,NormalisedConstantsState).
4563
4564
4565		:- use_module(store,[no_value_for_variable/2]).
4566		fill_in_det_solutions([],[]).
4567		fill_in_det_solutions([bind(Var,Val)|T],[bind(Var,FVal)|FT]) :-
4568		(det_solution_for_constant(Var,Val)
4569		-> (silent_mode(on) -> true ; write(' --det--> '),print_term_summary(bind(Var,Val))),
4570		FVal=Val
4571		; %format('No (deterministic) solution was found or stored for constant: ~w~n',[Var]), % message printed by det_solution_for_constant
4572		(preference(allow_incomplete_partial_setup_constants,true)
4573		-> no_value_for_variable(FVal,Var)
4574		; format('Aborting SETUP_CONSTANTS (set preference ALLOW_INCOMPLETE_SETUP_CONSTANTS to TRUE to allow ProB to proceed without having values for all CONSTANTS)~n',[]),
4575		fail
4576		)
4577		),
4578		fill_in_det_solutions(T,FT).
4579
4580
4581
4582		/* --------------------------------- */
4583
4584		:- use_module(b_state_model_check, [b_check_valid_state/1]).
4585
4586		% note: set_up_initialisation for CBC checks does not use this predicate
4587		b_initialise_machine(ConstantsState,NormalisedInitialVarsState,FullInitialState,Path) :-
4588	?	if(b_initialise_machine2(ConstantsState,NormalisedInitialVarsState,FullInitialState,Path),
4589		true,
4590		(\+ logged_error(initialisation_fails,_,_,_), % we have already provided a more precise error message
4591		\+ abort_error_exists_in_context_state(initialisation_fails), % ditto as a state error
4592		(bmachine:b_machine_temp_predicate(TempPred)
4593		-> add_message(initialisation_fails,'INITIALISATION FAILS with provided predicate: ',TempPred,TempPred)
4594		; b_get_initialisation_from_machine(Stmt,_OType)
4595		-> add_error(initialisation_fails,'INITIALISATION FAILS','',Stmt)
4596		; add_error(initialisation_fails,'MACHINE has no INITIALISATION clause')
4597		),
4598		fail)
4599		).
4600
4601		b_initialise_machine2(ConstantsState,NormalisedInitialVarsState,FullInitialState,Path) :-
4602		/* InitialVarsState is an ouput */
4603		b_get_initialisation_from_machine(InitStatement,OType),
4604		( InitStatement=[] ->
4605		Path = [],
4606		add_message(b_initialise_machine,'Machine has no INITIALISATION statement(s)!'),
4607		NormalisedInitialVarsState = [],
4608		FullInitialState = ConstantsState
4609		; OType == classic ->
4610		Path = [path(PathInfo)],
4611		b_get_machine_variables(DeclaredVars),
4612		set_up_undefined_localstate(DeclaredVars,ConstantsState,NewInState),
4613		/* this is if the INITIALISATION has a sequential composition; to avoid error messages */
4614		get_texpr_info(InitStatement,PosInfo),
4615		init_wait_flags_with_call_stack(WF,[operation_call('INITIALISATION',[],PosInfo)]),
4616		(bmachine:b_machine_temp_predicate(_)
4617		-> InitStatement2=InitStatement /* avoid enumerating each init statement in parallel in case additional guard links them */
4618		; translate_init_statements(InitStatement,InitStatement2)
4619		),
4620		check_additional_guard(true,InitialVarsState,ConstantsState,WF),
4621	?	b_execute_statement(InitStatement2,[],NewInState,InitialVarsState,WF,PathInfo),
4622		% Warning: in Z mode (e.g. test 565) the variable skeleton may not yet be set up !
4623		sort_variable_binding(InitialVarsState,NormalisedInitialVarsState),
4624		append(NormalisedInitialVarsState,ConstantsState,FullInitialState), % put constants at end to make sharing of complete tail-list easier for successor states; should be compatible with order in expand_const_and_vars
4625		split_names_and_types(DeclaredVars,DeclaredNames,DeclaredTypes),
4626	?	ground_wait_flags(WF),
4627
4628		b_enumerate_values_in_store(DeclaredNames,DeclaredTypes,_,InitialVarsState,WF) %% MOVED HERE TO AVOID that target values are enumerated before initialisation effect computed
4629		; OType = eventb_operation(_ChangeSet,ParaValues,_Operation) ->
4630		prepare_eventb_initialisation(ConstantsState,InitialVarsUnNormState,FullInitialUnNormState),
4631		get_texpr_expr(InitStatement,
4632		rlevent(_Name,_Sec,_Stat,Parameters,_Grd,_Thm,_Act,_VWit,_PWit,_Unmod,_AbsEv)),
4633	?	b_execute_event('initialisation',InitStatement,Parameters,ParaValues,ConstantsState,FullInitialUnNormState,Path),
4634		normalise_store(InitialVarsUnNormState,NormalisedInitialVarsState),
4635		normalise_store(FullInitialUnNormState,FullInitialState) % a bit of redundant work here; we do the work twice and try to normalise constants again !
4636		),
4637		b_check_valid_state(FullInitialState).
4638
4639		% ensure that the variables always appear in the same order as reported by b_get_machine_variables:
4640		% this is important for e.g., state_packing TO DO: we could sort them according to the variable names, but would there be a gain ??
4641		sort_variable_binding(Store,SortedStore) :- %print(sort_variable_binding(Store,SortedStore)),nl,
4642		b_get_machine_variables(Variables),
4643		sort_aux(Variables,Store,[],SortedStore).
4644		sort_aux([],S,Acc,NormRes) :- reverse(Acc,Res),
4645		normalise_store(Res,NormRes),
4646		(S=[] -> true ; add_internal_error('Unknown variable bindings: ',S)).
4647		sort_aux([TVar|T],Store,Acc,Res) :- def_get_texpr_id(TVar,ID),
4648		bselect(ID,Val,Store,Rest),
4649		sort_aux(T,Rest,[bind(ID,Val)|Acc],Res).
4650
4651		:- block bselect(?,?,-,?). % in Z mode (e.g. test 565) the variable skeleton may not yet be set up !
4652		bselect(ID,Val,[bind(ID1,Val1)|T],Rest) :- % we assume ID1 is nonvar
4653		(ID=ID1 -> Val=Val1,T=Rest
4654		; Rest = [bind(ID1,Val1)|RT],
4655		bselect(ID,Val,T,RT)).
4656
4657		prepare_eventb_initialisation(ConstantsState,InitialVarsState,FullInitialState) :-
4658		b_get_machine_variables(Variables),
4659		empty_state(Empty),
4660		set_up_typed_localstate(Variables,_,_,Empty,InitialVarsState,positive),
4661		% NormalisedInitialVarsState = InitialVarsState, % TO DO : check that b_event normalises this
4662		combine_updates(InitialVarsState,ConstantsState,FullInitialState).
4663		% put constants at end, to be compatible with b_initialise_machine2 and expand_const_and_vars order and e.g. ltsmin
4664
4665
4666
4667		reset_b_interpreter :-
4668		%reset_partial_evaluator,
4669		retractall(project_properties_on_identifiers(_)),
4670		reset_unsat_component_infos,
4671		retractall(no_solution_found_for_constants).
4672
4673		:- use_module(eventhandling,[register_event_listener/3]).
4674		:- register_event_listener(clear_specification,reset_b_interpreter,
4675		'Reset B-Interpreter Memo Table & Unsat Components.').