ocarina-analyzer-real.adb 105 KB
Newer Older
1
2
3
4
5
6
7
8
------------------------------------------------------------------------------
--                                                                          --
--                           OCARINA COMPONENTS                             --
--                                                                          --
--                O C A R I N A . A N A L Y Z E R . R E A L                 --
--                                                                          --
--                                 B o d y                                  --
--                                                                          --
9
--          Copyright (C) 2009-2011, European Space Agency (ESA).           --
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
--                                                                          --
-- Ocarina  is free software;  you  can  redistribute  it and/or  modify    --
-- it under terms of the GNU General Public License as published by the     --
-- Free Software Foundation; either version 2, or (at your option) any      --
-- later version. Ocarina is distributed  in  the  hope  that it will be    --
-- useful, but WITHOUT ANY WARRANTY;  without even the implied warranty of  --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received  a copy of the --
-- GNU General Public License distributed with Ocarina; see file COPYING.   --
-- If not, write to the Free Software Foundation, 51 Franklin Street, Fifth --
-- Floor, Boston, MA 02111-1301, USA.                                       --
--                                                                          --
-- As a special exception,  if other files  instantiate  generics from this --
-- unit, or you link  this unit with other files  to produce an executable, --
-- this  unit  does not  by itself cause  the resulting  executable to be   --
-- covered  by the  GNU  General  Public  License. This exception does not  --
-- however invalidate  any other reasons why the executable file might be   --
-- covered by the GNU Public License.                                       --
--                                                                          --
--                 Ocarina is maintained by the Ocarina team                --
--                       (ocarina-users@listes.enst.fr)                     --
--                                                                          --
------------------------------------------------------------------------------

with Namet;
with Errors;

with Ocarina.Analyzer.Messages;
with Ocarina.Analyzer.REAL.Finder;
with Ocarina.Builder.REAL;
with Ocarina.Instances.REAL_Checker.Queries;
with Ocarina.ME_REAL.Tokens;
with Ocarina.ME_REAL.REAL_Tree.Nodes;
with Ocarina.ME_REAL.REAL_Tree.Utils;
with Ocarina.ME_REAL.REAL_Tree.Nutils;
with Ocarina.ME_REAL.REAL_Tree.Debug;
with Ocarina.ME_AADL.AADL_Tree.Nodes;
with Ocarina.ME_AADL.AADL_Instances.Nodes;
with Ocarina.REAL_Values;
with Ocarina.REAL_Expander;
with Ocarina.REAL_Expander.Flow_Analysis;

package body Ocarina.Analyzer.REAL is

   use Namet;
   use Errors;
   use Ocarina.Analyzer.REAL.Finder;
   use Ocarina.Analyzer.Messages;
   use Ocarina.Builder.REAL;
   use Ocarina.ME_REAL;
   use Ocarina.ME_REAL.REAL_Tree.Nodes;
   use Ocarina.ME_REAL.REAL_Tree.Utils;
   use Ocarina.ME_REAL.REAL_Tree.Nutils;
   use Ocarina.ME_REAL.REAL_Tree.Debug;

   package ATN renames Ocarina.ME_AADL.AADL_Tree.Nodes;
   package AIN renames Ocarina.ME_AADL.AADL_Instances.Nodes;
   package RN renames Ocarina.ME_REAL.REAL_Tree.Nodes;
   package RT renames Ocarina.ME_REAL.Tokens;
   package RNU renames Ocarina.ME_REAL.REAL_Tree.Nutils;

   procedure Compute_Selection_Subprogram_Calls
     (R : Node_Id; Success : out Boolean);
   --  Check selection expression correctness

   procedure Compute_Verification_Subprogram_Calls
     (R : Node_Id; Success : out Boolean);
   --  Check verification expression correctness

   procedure Compute_Return_Subprogram_Calls
     (R : Node_Id; Success : out boolean);
   --  Check return expression correctness

   procedure Check_Requirements_Existance
     (E : Node_Id; Success : out Boolean);
   --  Check weither the requirements are registered as theorems,
   --  and merge the trees.

   function Analyze_Sub_Theorem (R : Node_Id) return Boolean;
   --  Analyze a subtheorem tree

   procedure Analyze_Verification_Expression
     (E : Node_Id; Success : out Boolean);
   --  Check if the verification expression is well-formed,
   --  and then link all set references in parameters to existing sets.
   --  Check verification expression type consistency.

   procedure Analyze_Check_Subprogram_Call
     (S : Node_Id; Success : out Boolean);
   --  Bind sets reference to their related set
   --  Put each kind of parameter in the corresponding list
   --  Determine subprogram real return type

   procedure Get_Property_Type
     (E : Node_Id; Success : out Boolean; Result : out Return_Type);
   --  Ask Ocarina for the property real type

   procedure Analyze_Subtheorem_Parameters
     (E : Node_Id; Success : out Boolean);
   --  Analyze subtheorem parameters

   function Find_Variable (E : Name_Id) return Node_Id;
   --  returns a variable, searched by name from both used_var list
   --  (theorem-scoped) and global_variables list (global scope).

   AADL_Tree     : Node_Id;
   AADL_Instance : Node_Id;

   ----------
   -- Init --
   ----------

   procedure Init is
   begin
      AADL_Tree := No_Node;
      AADL_Instance := No_Node;
      Ocarina.ME_REAL.REAL_Tree.Nutils.Init;
      Ocarina.Analyzer.Register_Analyzer
        (RT.Language, Analyze_Model'Access);
   end Init;

   -----------
   -- Reset --
   -----------

   procedure Reset is
   begin
      AADL_Tree := No_Node;
      Ocarina.ME_REAL.REAL_Tree.Nutils.Reset;
   end Reset;

   -------------------------------
   -- Register_Library_Theorems --
   -------------------------------

145
   procedure Register_Library_Theorems (REAL_Library : Node_Id) is
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
      pragma Assert (Kind (REAL_Library) = K_Root_Node);
      package RNU renames Ocarina.ME_REAL.REAL_Tree.Nutils;

      N : Node;
      T : Node_Id;
   begin
      if Is_Empty (Theorems (REAL_Library)) then
         return;
      end if;

      T := First_Node (Theorems (REAL_Library));
      while Present (T) loop
         N.Node := T;
         Set_Related_Entity (N.Node, No_Node);
         RNU.Node_List.Append (Library_Theorems, N);
         T := Next_Node (T);
      end loop;
   end Register_Library_Theorems;

   ------------------------
   -- Build_Theorem_List --
   ------------------------

169
   procedure Build_Theorem_List (AADL_Root : Node_Id) is
170
171
172
173
174
175
      NL : RNU.Node_List.Instance;
      N  : Node;
      A  : Node_Id;
      T  : Node_Id;
      It : Natural := RNU.Node_List.First;
   begin
176
177
178
      if Main_Theorem = No_Name then
         --  We walk through all annex clauses to build the list of
         --  theorems to be checked.
179

180
181
182
         NL := Get_REAL_Annexes_List (AADL_Root);
         while It <= RNU.Node_List.Last (NL) loop
            A := ATN.Corresponding_Annex (NL.Table (It).Node);
183

184
185
186
            T := First_Node (Theorems (A));
            while Present (T) loop
               N.Node := T;
187

188
189
               --  Set link to the container AADL component for each
               --  theorem in the annex
190

191
192
               Set_Related_Entity
                 (N.Node, ATN.Container_Component (NL.Table (It).Node));
193

194
               --  Append to the list of theorems to be run
195

196
197
198
199
200
201
               RNU.Node_List.Append (To_Run_Theorem_List, N);

               T := Next_Node (T);
            end loop;

            It := It + 1;
202
203
         end loop;

204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
      else
         for J in RNU.Node_List.First ..
           RNU.Node_List.Last (Library_Theorems) loop
            A := Library_Theorems.Table (J).Node;

            if Main_Theorem = Name (Identifier (A)) then
               N.Node := A;
               Set_Related_Entity (N.Node, AADL_Root);

               --  Append to the list of theorems to be run

               RNU.Node_List.Append (To_Run_Theorem_List, N);
            end if;
         end loop;
      end if;
219
220
221
222
223
224
   end Build_Theorem_List;

   -------------------
   -- Analyze_Model --
   -------------------

225
   function Analyze_Model (Root : Node_Id) return Boolean is
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
      use AIN;
      use ATN;
      use Ocarina.Analyzer.REAL;
      use Ocarina.REAL_Expander;
      use Ocarina.REAL_Expander.Flow_Analysis;

      pragma Assert (AIN.Kind (Root) = AIN.K_Architecture_Instance);

      Node      : Node_Id;
      It        : Natural := RNU.Node_List.First;
      Success   : Boolean;
   begin
      AADL_Tree := ATN.Parent
        (ATN.Namespace (Corresponding_Declaration (Root_System (Root))));

      AADL_Instance := Root;

      --  Build the theorem list

      Build_Theorem_List (AADL_Tree);

      --  Build flows

      Explore_Flows;
      Store_Flows (Root);

      --  Init queries

      Ocarina.Instances.REAL_Checker.Queries.Init (Root);

      while It <= RNU.Node_List.Last (To_Run_Theorem_List) loop
         Node := To_Run_Theorem_List.Table (It).Node;
         RNU.REAL_Root := Node;

         --  Expansion step

         Ocarina.REAL_Expander.Expand (Node, Success);
         if not Success then
            Display_Analyzer_Error
              (RN.Related_Entity (Node),
               "could not proceed to theorem expansion");
            return False;
         end if;

         --  Analyze step

272
         Ocarina.Analyzer.REAL.Analyze_Theorem (RNU.REAL_Root, Root, Success);
273
274
275
276
277
278
279
280
281
282
283
284
285
         if not Success then
            Display_Analyzer_Error
              (RN.Related_Entity (Node),
               "theorem analysis failed");
            return False;
         end if;

         It := It + 1;
      end loop;

      --  For non-used library theorems, we still analyze them,
      --  since they can be called directly through the API

286
287
288
      --  for J in RNU.Node_List.First ..
      --    RNU.Node_List.Last (Library_Theorems) loop
      --     Node := Library_Theorems.Table (J).Node;
289

290
      --     RNU.REAL_Root := Node;
291

292
293
294
295
296
297
      --     if not Analyze_Sub_Theorem (RNU.REAL_Root) then
      --        Display_Analyzer_Error
      --          (Root, "could not proceed to theorem analysis");
      --        return False;
      --     end if;
      --  end loop;
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397

      return True;
   end Analyze_Model;

   ---------------------
   -- Analyze_Theorem --
   ---------------------

   procedure Analyze_Theorem
     (Theorem   : Node_Id;
      AADL_Root : Node_Id;
      Success   : out Boolean)
   is
      use AIN;

      pragma Assert (RN.Kind (Theorem) = RN.K_Theorem);
      pragma Assert (AIN.Kind (AADL_Root) = AIN.K_Architecture_Instance);
   begin
      AADL_Instance := AADL_Root;

      Compute_Selection_Subprogram_Calls (Theorem, Success);
      if not Success then
         return;
      end if;

      if Present (Return_Expression (Theorem)) then
         Compute_Return_Subprogram_Calls (Theorem, Success);
      else
         Compute_Verification_Subprogram_Calls (Theorem, Success);
      end if;
      if not Success then
         return;
      end if;

      Check_Requirements_Existance (Theorem, Success);
      if not Success then
         return;
      end if;
   end Analyze_Theorem;

   ----------------------------------
   -- Check_Requirements_Existance --
   ----------------------------------

   procedure Check_Requirements_Existance
     (E : Node_Id; Success : out Boolean)
   is
      pragma Assert (Kind (E) = K_Theorem);

      use Ocarina.REAL_Expander;

      R      : constant List_Id := Required_Theorems (E);
      N, T   : Node_Id;
      Caller : constant Node_Id := RNU.REAL_Root;
   begin
      if not Is_Empty (R) then
         N := First_Node (R);
      else
         N := No_Node;
      end if;

      while Present (N) loop
         T := Find_Declared_Theorem (Theorem_Name (N));

         if No (T) then
            Display_Analyzer_Error
              (No_Node, Get_Name_String (Theorem_Name (N)) &
               " is not a declared theorem", Loc => Loc (N));
            Success := False;
            return;
         else
            RNU.REAL_Root := T;
            if not Analyze_Sub_Theorem (RNU.REAL_Root) then
               Display_Analyzer_Error
                 (RN.Related_Entity (E),
                  "could not proceed to sub-theorem analysis");
               Success := False;
               return;
            end if;
            Set_Related_Theorem (N, RNU.REAL_Root);
         end if;

         N := Next_Node (N);
      end loop;
      RNU.REAL_Root := Caller;

      Success := True;
   end Check_Requirements_Existance;

   -------------------------------------------
   -- Compute_Verification_Subprogram_Calls --
   -------------------------------------------

   procedure Compute_Verification_Subprogram_Calls
     (R : Node_Id; Success : out boolean)
   is
      pragma Assert (Kind (R) = K_Theorem);
   begin
      Analyze_Verification_Expression (Check_Expression (R), Success);
      if Success and then
398
399
400
        Returned_Type (Check_Expression (R)) /= RT_Boolean
        and then Returned_Type (Check_Expression (R)) /= RT_Unknown
      then
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
         Display_Analyzer_Error
           (No_Node,
            "Top-level check expression must be a boolean value",
            Loc => Loc (Check_Expression (R)));
         Success := False;
      end if;

   end Compute_Verification_Subprogram_Calls;

   -------------------------------------
   -- Compute_Return_Subprogram_Calls --
   -------------------------------------

   procedure Compute_Return_Subprogram_Calls
     (R : Node_Id; Success : out boolean)
   is
      pragma Assert (Kind (R) = K_Theorem);

      T : Return_Type;
      C : constant Node_Id := Check_Expression (Return_Expression (R));
   begin
      Analyze_Verification_Expression (C, Success);
      T := Returned_Type (C);

      case Range_Function (Return_Expression (R)) is
         when FC_MMax | FC_MMin | FC_MSum | FC_MProduct =>
            case T is
               when RT_Unknown =>
                  T := RT_Float;
                  Error_Loc (1) := Loc (C);
                  DW ("Unable to determine actualy returned type.");

               when RT_Float | RT_Integer =>
                  null;

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "aggregate function expected a numeric value",
                     Loc => Loc (C));
                  Success := False;
            end case;

         when FC_MAll_Equals =>
            case T is
               when RT_Unknown =>
                  T := RT_Boolean;
                  Error_Loc (1) := Loc (C);
                  DW ("Unable to determine actualy returned type.");

               when RT_Float | RT_Integer =>
                  T := RT_Boolean;

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "aggregate function expected a numeric value",
                     Loc => Loc (C));
                  Success := False;
            end case;

         when others =>
            Display_Analyzer_Error
              (No_Node, "aggregate function unknown", Loc => Loc (C));
            Success := False;
            T := RT_Error;
      end case;

      if Success then
         case T is
            when RT_Float =>
               null;

            when RT_Integer =>
               Error_Loc (1) := Loc (Return_Expression (R));
474
               DW ("Returned integer value will be cast to a float "
475
476
477
478
                   & "at runtime");

            when RT_Boolean =>
               Error_Loc (1) := Loc (Return_Expression (R));
479
               DW ("Returned boolean value will be cast to a float "
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
                   & "at runtime");

            when others =>
               Display_Analyzer_Error
                 (No_Node,
                  "Top-level return expression must be a numeric value",
                  Loc => Loc (Return_Expression (R)));
               Success := False;
         end case;
      end if;
   end Compute_Return_Subprogram_Calls;

   -------------------------
   -- Analyze_Sub_Theorem --
   -------------------------

496
   function Analyze_Sub_Theorem (R : Node_Id) return Boolean is
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
      use Ocarina.REAL_Expander;

      pragma Assert (Kind (R) = K_Theorem);

      Success : Boolean := True;
   begin
      --  If the used set is not empty then that theorem has already
      --  been analyzed.

      if not Is_Empty (Used_Set (R)) then
         return True;
      end if;

      --  Proceed to expansion and analysis

      Expand (R, Success);
      if Success then
         Analyze_Theorem (R, AADL_Instance, Success);
      end if;

      return Success;
   end Analyze_Sub_Theorem;

   ----------------------------------------
   -- Compute_Selection_Subprogram_Calls --
   ----------------------------------------

   procedure Compute_Selection_Subprogram_Calls
     (R : Node_Id; Success : out Boolean)
   is
      pragma Assert (Kind (R) = K_Theorem);

      D : Node_Id := First_Node (Declarations (R));
   begin
      Success := True;
      while Present (D) loop
         case Kind (D) is

            when K_Set_Declaration =>
               Is_Dependant := False;

               --  Set local set to the local stack

               Append_Node_To_List (Referenced_Var (Local_Variable (D)),
                                    Local_Var (Real_Root));

               --  Performs analysis

               Analyze_Verification_Expression
                 (Selection_Expression (D), Success);
               if not Success then
                  Display_Analyzer_Error
                    (No_Node, "Could not analyze set declaration",
                     Loc => Loc (D));
                  return;
               end if;

               --  remove local variable from the local stack

               Remove_Node_From_List (Referenced_Var (Local_Variable (D)),
                                      Local_Var (Real_Root));

            when K_Variable_Decl_Expression =>
               --  Analyze variable declaration

               Analyze_Verification_Expression
                 (Check_Expression (Return_Expr (D)), Success);
               if not Success then
                  Display_Analyzer_Error
                    (No_Node, "Could not analyze variable declaration",
                     Loc => Loc (D));
                  return;
               end if;

               Set_Var_Type (Referenced_Var
                             (Var_Ref (D)),
                             Returned_Type
                             (Check_Expression
                              (Return_Expr (D))));

            when K_Variable_Decl_Compute =>
               declare
                  T : constant Name_Id := Theorem_Name (D);
                  R : constant Node_Id := Find_Declared_Theorem (T);
                  Stored : constant Node_Id := Real_Root;
               begin
                  if No (R) then
                     W_Line ("Error : Theorem " & Get_Name_String (T)
                             & " not found");
                     Success := False;
                     return;
                  end if;

                  REAL_Root := R;
                  if not Analyze_Sub_Theorem (Real_Root) then
                     W_Line ("analyze of sub-theorem " &
                             Get_Name_String
                             (Name (Identifier (Real_Root)))
                             & " failed");
                     Success := False;
                     return;
                  end if;
                  Real_Root := Stored;

                  Set_Related_Theorem (D, R);
                  Set_Var_Type (Referenced_Var (Var_Ref (D)), RT_Float);
                  if Parameters (D) /= No_List then
                     Analyze_Subtheorem_Parameters (D, Success);
                  end if;
               end;

            when others =>
               Display_Analyzer_Error
                 (No_Node, "unexpected node kind in selection expression",
                  Loc => Loc (D));
               Success := False;
               return;

         end case;

         D := Next_Node (D);
      end loop;
   end Compute_Selection_Subprogram_Calls;

   -----------------------------------
   -- Analyze_Subtheorem_Parameters --
   -----------------------------------

   procedure Analyze_Subtheorem_Parameters
     (E : Node_Id; Success : out Boolean)
   is
      pragma Assert (Kind (E) = K_Variable_Decl_Compute);

      ------------------------
      -- Find_Set_Reference --
      ------------------------

      procedure Find_Set_Reference
        (N : Node_Id;
         S : Node_Id;
         Success : out Boolean)
      is
         M, D : Node_Id;
      begin
         Success := True;

         case Kind (N) is

            when K_Set_Reference =>
               declare
                  TV : Value_Id;
               begin
                  --  We register the predefined set

                  pragma Unreferenced (TV);
                  TV := Get_Set_Type (N);
                  Set_Domain (S, N);
               end;

            when K_Identifier =>
               D := Find_Node_By_Name (To_Lower (Name (N)),
                                       Used_Set (Real_Root));
               if Present (D) then

                  --  Add to set reference list

                  M := Make_Set_Reference;
                  Set_Referenced_Set (M, D);
                  Set_Domain (S, M);
               else

                  --  Can be :
                  --  * a reference on "range" variable
                  --  * any element variable
                  --  * a predefined set (including local_set)

                  --  Search related variable in global list

                  D := Find_Variable (To_Lower (Name (N)));
                  if Present (D) then
                     if Var_Type (D) = RT_Element then
                        M := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (M, D);
                        Set_Domain (S, M);
                     else
                        Display_Analyzer_Error
                          (No_Node, Get_Name_String (Name (N)) &
                           " variable is not an element of a set",
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;

                  elsif Get_Name_String (Name (N)) = "local_set" then
                     declare
                        T    : Value_Id;
                        NM   : Name_Id;
                        Set  : Node_Id;
                     begin
                        M := Make_Set_Reference;

                        T := SV_Local_Set;
                        Set_Str_To_Name_Buffer
                          (Ocarina.ME_REAL.Tokens.Image
                           (Translate_Predefined_Sets (T)));
                        NM := Name_Find;

                        --  Create a set in order to register actual use
                        --  of the predefined set

                        Set := Make_Set (NM, T);
                        Set_Predefined_Type (Set, T);
                        Set_Referenced_Set (M, Set);
                        Set_Set_Type (Set, T);
                        Append_Node_To_List (Set, Used_Set (REAL_Root));

                        Set_Domain (S, M);
                     end;
                  else
                        Display_Analyzer_Error
                          (No_Node, Get_Name_String (Name (N)) &
                           " is not a declared set or variable",
                           Loc => Loc (N));
                        Success := False;
                        return;
                  end if;
               end if;

            when others =>
               Display_Analyzer_Error (No_Node, "wrong parameter type",
                                       Loc => Loc (N));
               Success := False;
         end case;
      end Find_Set_Reference;

      N : Node_Id := First_Node (Parameters (E));
      P : Node_Id;
      D : Node_Id;
   begin
      Success := True;

      if not Present (N) then
         Set_Domain (E, No_Node);
         return;
      end if;

      Find_Set_Reference (N, E, Success);
      Set_True_Params (E, New_List (K_List_Id, Loc (E)));
      if not Success then
         Display_Analyzer_Error (No_Node, "First parameter of subprogram " &
                                 "call is not a set",
                                 Loc => Loc (N));
         return;
      end if;

      N := Next_Node (N);
      while Present (N) loop
         case Kind (N) is

            when K_Literal =>
               P := New_Node (K_Literal, Loc (N));
               Set_Value (P, Value (N));
               declare
                  use Ocarina.REAL_Values;
                  V : constant Value_Type := Get_Value_Type (Value (N));
               begin
                  case V.T is
                     when LT_Integer =>
                        Set_Returned_Type (P, RT_Integer);

                     when LT_Real =>
                        Set_Returned_Type (P, RT_Float);

                     when LT_String =>
                        Set_Returned_Type (P, RT_String);

                     when  LT_Boolean =>
                        Set_Returned_Type (P, RT_Boolean);

                     when LT_Enumeration =>
                        Set_Returned_Type (P, RT_String);

                     when others =>  -- Can't happen
                        Display_Analyzer_Error
                        (No_Node, "unexpected value type in literal",
                         Loc => Loc (N));
                        Success := False;
                        return;
                  end case;
               end;
               Append_Node_To_List (P, True_params (E));

            when K_Identifier =>
               D := Find_Variable (To_Lower (Name (N)));
               if Present (D) then
                  P := Make_Var_Reference (Name (N));
                  Set_Referenced_Var (P, D);
                  Append_Node_To_List (P, True_params (E));
               else
                  Display_Analyzer_Error
797
                    (No_Node, "could not find variable " &
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
                     Get_Name_String (To_Lower (Name (N))),
                     Loc => Loc (N));
                  Success := False;
                  return;
               end if;

            when others =>
               Display_Analyzer_Error
                 (No_Node, "subtheorem parameter "
                  & "must be a literal or an identifier", Loc => Loc (N));
               Success := False;
               return;
         end case;

         N := Next_Node (N);
      end loop;
   end Analyze_Subtheorem_Parameters;

   -------------------------------------
   -- Analyze_Verification_Expression --
   -------------------------------------

   procedure Analyze_Verification_Expression
     (E : Node_Id; Success : out Boolean)
   is
      use Ocarina.REAL_Values;

      pragma Assert (Kind (E) = K_Check_Expression or else
                     Kind (E) = K_Ternary_Expression or else
                     Kind (E) = K_Literal or else
                     Kind (E) = K_Var_Reference or else
                     Kind (E) = K_Check_Subprogram_Call);

      T1, T2 : Return_Type;
      V      : Value_Type;
      Part_Unknown : Boolean;
   begin
      Success := True;

837
      case Kind (E) is
838
839
840
841
842
843
844
845
846
847
848
849
850
851
         when K_Var_Reference =>  --  Found a variable
            declare
               N : Node_Id;
            begin
               N := Find_Variable (To_Lower (Name (E)));

               --  The variable must have been previsously
               --  defined andd analyzed.

               if No (N) then
                  N := Find_Node_By_Name
                    (To_Lower (Name (E)), Local_Var (Real_Root));
                  if No (N) then
                     Display_Analyzer_Error
852
                       (No_Node, "could not find variable " &
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
                        Get_Name_String (To_Lower (Name (E))),
                        Loc => Loc (E));
                     Success := False;
                     return;
                  end if;
               end if;

               if Var_Type (N) = No_Value then
                  Display_Analyzer_Error
                    (No_Node, Get_Name_String (To_Lower (Name (E)))
                     & " is being used before being defined",
                     Loc => Loc (E));
                  Success := False;
                  return;
               end if;
               Set_Referenced_Var (E, N);
               Set_Returned_Type (E, Var_Type (N));
            end;

         when K_Check_Subprogram_Call =>
            Analyze_Check_Subprogram_Call (E, Success);

         when K_Literal =>
            V := Get_Value_Type (Value (E));
            case V.T is
               when LT_Integer =>
                  Set_Returned_Type (E, RT_Integer);

               when LT_Real =>
                  Set_Returned_Type (E, RT_Float);

               when LT_String =>
                  Set_Returned_Type (E, RT_String);

               when  LT_Boolean =>
                  Set_Returned_Type (E, RT_Boolean);

               when LT_Enumeration =>
                  Set_Returned_Type (E, RT_String);

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "unexpected value type in literal",
                     Loc => Loc (E));
                  Success := False;
                  return;
            end case;

         when K_Ternary_Expression =>
            Analyze_Verification_Expression (Left_Expr (E), Success);
            if Success then
               Analyze_Verification_Expression (Right_Expr (E), Success);
            end if;
906

907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
            if Success then
               Analyze_Verification_Expression (Third_Expr (E), Success);
            end if;
            if Success then
               T1 := Returned_Type (Left_Expr (E));
               if T1 /= RT_Boolean then
                  Display_Analyzer_Error
                    (No_Node, "Ternary expression must begin by a boolean "
                     & "expression ",
                     Loc => Loc (E));
                  Success := False;
                  return;
               end if;
               T1 := Returned_Type (Right_Expr (E));
               T2 := Returned_Type (Third_Expr (E));
               if T1 = T2 then
                  Set_Returned_Type (E, T1);
               else
                  Set_Returned_Type (E, RT_Unknown);
               end if;
            end if;
            if not Success then
               return;
            end if;

         when K_Check_Expression =>
933
            if Present (Left_Expr (E)) and then Present (Right_Expr (E)) then
934
               Analyze_Verification_Expression (Left_Expr (E), Success);
935

936
937
938
               if Success then
                  Analyze_Verification_Expression (Right_Expr (E), Success);
               end if;
939

940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
               if not Success then
                  return;
               end if;
               T1 := Returned_Type (Left_Expr (E));
               T2 := Returned_Type (Right_Expr (E));
               Part_Unknown := (T1 = RT_Unknown or else T2 = RT_Unknown);

               case Operator (E) is
                  when OV_And | OV_Or =>
                     if not Part_Unknown then
                        if T1 /= RT_Boolean or else
                          T2 /= RT_Boolean then
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent types in expression "
                              & "<boolean_operator> : "
                              & "must be boolean sub-expressions",
                              Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Boolean);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Boolean);
                     end if;

                  when OV_Equal =>
                     if not Part_Unknown then
                        if T1 /= T2 then
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent types in expression '='",
                              Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Boolean);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Boolean);
                     end if;

                  when OV_Different =>
                     if not Part_Unknown then
                        if T1 /= T2 then
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent types in expression '<>'",
                              Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Boolean);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Boolean);
                     end if;

                  when OV_Greater | OV_Less |
                    OV_Less_Equal | OV_Greater_Equal =>
                     if not Part_Unknown then
                        if (T2 /= RT_Float
                            and then T2 /= RT_Integer)
                          or else
                          (T1 /= RT_Float
1003
1004
                             and then T1 /= RT_Integer)
                        then
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent types in expression "
                              & "<comparator>", Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Boolean);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Boolean);
                     end if;

                  when OV_Plus =>
                     if not Part_Unknown
                       and then ((T1 /= T2
                                  and then ((T1 /= RT_Float
                                             and then T1 /= RT_Integer)
                                            or else (T2 /= RT_Float
                                                     and then T2 /=
                                                     RT_Integer)))
                                 or else (T1 = RT_Boolean
                                          or else T1 = RT_Element
                                          or else T1 = RT_Range
                                          or else T1 = RT_String
                                          or else T1 = RT_Error)) then
                        Display_Analyzer_Error
                          (No_Node, "Inconsistent types in expression +|-",
                           Loc => Loc (E));
                        Success := False;
                        return;
                     else
                        if T1 = T2 and then T1 = RT_Integer then
                           Set_Returned_Type (E, RT_Integer);
                        elsif T1 = RT_Float or else T2 = RT_Float then
                           Set_Returned_Type (E, RT_Float);
                        else
                           Set_Returned_Type (E, T1);
                        end if;
                     end if;

                  when OV_Modulo =>
                     if not Part_Unknown
                       and then (T2 /= RT_Integer
                        or else T1 /= RT_Integer) then
                        Display_Analyzer_Error
                          (No_Node, "Inconsistent types for operator ",
                           Loc => Loc (E));
                        Success := False;
                        return;
                     else
                        Set_Returned_Type (E, RT_Integer);
                     end if;

                  when OV_Minus | OV_Star | OV_Slash | OV_Power =>
                     if not Part_Unknown
                       and then ((T2 /= RT_Float
                                  and then T2 /= RT_Integer)
                                 or else (T1 /= RT_Float
                                          and then T1 /= RT_Integer)) then
                        Display_Analyzer_Error
                          (No_Node, "Inconsistent types in expression +|-",
                           Loc => Loc (E));
                        Success := False;
                        return;
                     else
                        if T1 = T2 and then T1 = RT_Integer then
                           Set_Returned_Type (E, RT_Integer);
                        else
                           Set_Returned_Type (E, RT_Float);
                        end if;
                     end if;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected operator", Loc => Loc (E));
                     Success := False;
                     return;
               end case;

            elsif Present (Right_Expr (E)) then
               Analyze_Verification_Expression (Right_Expr (E), Success);
               if not Success then
                  return;
               end if;
               T1 := Returned_Type (Right_Expr (E));

               case Operator (E) is

                  when OV_Not =>
                     if not Part_Unknown then
                        if T1 /= RT_Boolean then
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent type in expression, "
                              & "must be boolean",
                              Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Boolean);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Boolean);
                     end if;

                  when OV_Minus =>
                     if not Part_Unknown then
                        if T1 /= RT_Integer and then T1 /= RT_Float then
                           Display_Analyzer_Error
                             (No_Node, "Inconsistent type in expression, "
                              & "must be numeric", Loc => Loc (E));
                           Success := False;
                           return;
                        else
                           Set_Returned_Type (E, RT_Unknown);
                        end if;
                     else
                        Set_Returned_Type (E, RT_Float);
                     end if;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected operator", Loc => Loc (E));
                     Success := False;
                     return;
               end case;
            end if;

         when others =>
            Display_Analyzer_Error
              (No_Node, "unexpected node kind", Loc => Loc (E));
            Success := False;
            return;
      end case;
   end Analyze_Verification_Expression;

   -----------------------------------
   -- Analyze_Check_Subprogram_Call --
   -----------------------------------

   procedure Analyze_Check_Subprogram_Call
     (S : Node_Id; Success : out Boolean)
   is
      pragma Assert (Kind (S) = K_Check_Subprogram_Call);

      N : Node_Id := First_Node (Parameters (S));
      M : Node_Id;
      P : Node_Id;
      D : Node_Id;
      T : Return_Type;

      ------------------------
      -- Find_Set_Reference --
      ------------------------

      procedure Find_Set_Reference
        (N : Node_Id;
         S : Node_Id;
         Is_Set : out Boolean;
         Success : out Boolean)
      is
         M : Node_Id;
      begin
         Success := True;
         Is_Set := True;
         case Kind (N) is

            when K_Set_Reference =>
               --  We register the predefined set

               declare
                  TV : Value_Id;
               begin
                  pragma Unreferenced (TV);
                  TV := Get_Set_Type (N);
                  Append_Node_To_List (N, Referenced_Sets (S));
               end;

            when K_Identifier =>
               D := Find_Node_By_Name (To_Lower (Name (N)),
                                      Used_Set (Real_Root));
               if Present (D) then
                  --  Add to set reference list

                  M := Make_Set_Reference;
                  Set_Referenced_Set (M, D);
                  Append_Node_To_List (M, Referenced_Sets (S));
               else
                  --  Must be a reference on "range" variable
                  --  or a variable referencing an element of a
                  --  set.

                  if Get_Name_String
                    (Name
                     (Identifier
                      (Range_Variable
                       (Range_Declaration (Real_Root))))) =
                    Get_Name_String (To_Lower (Name (N))) then

                     M := Make_Set_Reference;
                     Set_Referenced_Set
                       (M,
                        Referenced_Set
                        (Set_Reference
                         (Range_Variable
                          (Range_Declaration (Real_Root)))));
                     Append_Node_To_List (M, Referenced_Sets (S));
                     Is_Set := False;
                  else
                     --  Search related variable

                     declare
                        Found  : Boolean := False;
                        Ignore : Boolean := False;
                     begin
                        --  1/ In global and theorem lists

                        D := Find_Variable (To_Lower (Name (N)));
                        if Present (D) and then
                          Var_Type (D) = RT_Element then
                           Is_Set := False;
                           M := Make_Var_Reference (Name (N));
                           Set_Referenced_Var (M, D);
                           Append_Node_To_List (M, True_parameters (S));
                           Found := True;
                        else
1230
1231
1232
                           if Present (D)
                             and then Var_Type (D) = RT_Unknown
                           then
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
                              DW (Get_Name_String (Name (N)) &
                                  " variable cannot be typed.");
                              Ignore := True;
                           end if;
                        end if;

                        --  1/ In local list

                        if not Found and then not Ignore then
                           D := Find_Node_By_Name (To_Lower (Name (N)),
                                                   Local_Var (Real_Root));
                           if Present (D) and then
                             Var_Type (D) = RT_Element then
                              --  Set the variable position

                              if Variable_Position (S) = Value_Id (0) then
                                 if N = First_Node (Parameters (S)) then
                                    Set_Variable_Position (S, Value_Id (1));
                                 else
                                    Set_Variable_Position (S, Value_Id (2));
                                 end if;
                              else
                                 Display_Analyzer_Error
                                   (No_Node, Get_Name_String (Name (N))
                                    & " variable is already referenced",
                                    Loc => Loc (N));
                                 Success := False;
                                 return;
                              end if;

                              Is_Set := False;
                              M := Make_Var_Reference (Name (N));
                              Set_Referenced_Var (M, D);
                              Append_Node_To_List (M, True_parameters (S));
                              Found := True;
                           else
1269
1270
1271
                              if Present (D)
                                and then Var_Type (D) = RT_Unknown
                              then
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
                                 DW (Get_Name_String (Name (N)) &
                                     " variable cannot be typed.");
                                 Ignore := True;
                              end if;
                           end if;
                        end if;

                        if not Found then
                           if not Ignore then
                              Display_Analyzer_Error
                                (No_Node, Get_Name_String (Name (N))
                                 & " variable is not a "
                                 & "declared set or variable",
                                 Loc => Loc (N));
                              Success := False;
                              return;
                           else
                              Is_Set := False;
                              M := Make_Var_Reference (Name (N));
                              Set_Referenced_Var (M, D);
                              Append_Node_To_List (M, True_parameters (S));
                           end if;
                        end if;
                     end;
                  end if;
               end if;

            when others =>
               Display_Analyzer_Error
                 (No_Node, "unexpected node kind as a parameter",
                  Loc => Loc (N));
               Success := False;
               return;
         end case;
      end Find_Set_Reference;

      Var : Node_Id;
   begin
      Success := True;
      Set_Referenced_Sets (S, New_List (K_List_Id, Loc (S)));
      Set_True_Parameters (S, New_List (K_List_Id, Loc (S)));

1314
      --  There are three kinds of verification subprogram :
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427

      --  Set-based subprogram, which always takes a  set or
      --  element as first parameter, and can have others
      --  parameters (usually literal). They always returns
      --  a value or a list of values. eg : Cardinal,
      --  Get_Property_Value, Property_Exists.

      --  Value manipulation subprograms (eg. Max, Sum, First,
      --  Last...), where the single parameter is a value or a
      --  list of values, and which returns another value.

      --  The Expr subprogram (iterative expression) compute an
      --  expression on all the elements of the parameter-passed
      --  set, and returns a list of values.

      case Code (S) is

         when FC_Expr =>
            if Present (N)
              and then Present (Next_Node (N))
              and then Present (Next_Node (Next_Node (N))) then

               --  The first parameter must be a set

               case Kind (N) is

                  when K_Set_Reference =>

                     --  We register the predefined set

                     declare
                        TV : Value_Id;
                     begin
                        pragma Unreferenced (TV);
                        TV := Get_Set_Type (N);
                        Append_Node_To_List (N, Referenced_Sets (S));
                     end;

                  when K_Identifier =>
                     D := Find_Node_By_Name (To_Lower (Name (N)),
                                             Used_Set (Real_Root));
                     if Present (D) then

                        --  Add to set reference list

                        M := Make_Set_Reference;
                        Set_Referenced_Set (M, D);
                        Append_Node_To_List (M, Referenced_Sets (S));
                     else
                        Display_Analyzer_Error
                          (No_Node, Get_Name_String (Name (N))
                           & " is not a declared set or variable",
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;

               --  The second parameter must be a new variable

               N := Next_Node (N);
               case Kind (N) is
                  when K_Identifier =>
                     --  Check weither the variable is already used

                     D := Find_Variable (To_Lower (Name (N)));
                     if No (D) then

                        --  Declare the new variable

                        P := Make_Variable (Name (N));
                        Set_Var_Type (P, RT_Element);
                        Append_Node_To_List (P, Used_Var (Real_Root));

                        --  Bind the new variable to the expression

                        M := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (M, P);
                        Append_Node_To_List (M, True_Parameters (S));
                     else
                        Display_Analyzer_Error
                          (No_Node, Get_Name_String (Name (Identifier (N)))
                           & " is already declared",
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;

               --  The last parameter must be an expression

               N := Next_Node (N);
               case Kind (N) is

                  when K_Check_Subprogram_Call
                    | K_Check_Expression
                    | K_Ternary_Expression =>
                     Analyze_Verification_Expression (N, Success);
                     if Success then
1428
                        case Returned_Type (N) is
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
                           when RT_Float =>
                              Set_Returned_Type (S, RT_Float_List);
                           when RT_Integer =>
                              Set_Returned_Type (S, RT_Int_List);
                           when RT_String =>
                              Set_Returned_Type (S, RT_String_List);
                           when RT_Boolean =>
                              Set_Returned_Type (S, RT_Bool_List);
                           when RT_Range =>
                              Set_Returned_Type (S, RT_Range_List);
                           when others =>
                              Display_Analyzer_Error
                                (No_Node, "could not resolve expression type",
                                 Loc => Loc (N));
                              Success := False;
                              return;
                        end case;
                        Remove_Node_From_List (N, Parameters (S));
                        Append_Node_To_List (N, True_Parameters (S));
                     else
                        return;
                     end if;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error (No_Node, "expected 3 parameters",
                                       Loc => Loc (S));
               Success := False;
               return;
            end if;

         when FC_Get_Property_Value =>
1467
            if Present (N) and then Present (Next_Node (N)) then
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
               declare
                  Is_Set : Boolean;
               begin
                  --  Search related set

                  if Kind (N) = K_Identifier then
                     Find_Set_Reference (N, S, Is_Set, Success);
                  else
                     Success := False;
                  end if;

                  if not Success then
                     Display_Analyzer_Error
                       (No_Node, "first parameter must be a declared set",
                        Loc => Loc (N));
                     return;
                  end if;

                  N := Next_Node (N);
                  if Kind (N) = K_Literal then
                     Get_Property_Type (N, Success, T);
                     if not Success then
                        Display_Analyzer_Error
                          (No_Node, "could not analyze second parameter type",
                           Loc => Loc (N));
                        return;
                     end if;
                     Set_Returned_Type (S, T);

                     P := New_Node (K_Literal, Loc (N));
                     Set_Value (P, Value (N));
                     Append_Node_To_List (P, True_parameters (S));
                  else
                     Display_Analyzer_Error
                       (No_Node, "second parameter must be a literal",
                        Loc => Loc (N));
                     Success := False;
                     return;
                  end if;

                  if Is_Set then
                     case Value_Id (T) is
                        when RT_Float =>
                           Set_Returned_Type (S, RT_Float_List);
                        when RT_Integer =>
                           Set_Returned_Type (S, RT_Int_List);
                        when RT_String =>
                           Set_Returned_Type (S, RT_String_List);
                        when RT_Boolean =>
                           Set_Returned_Type (S, RT_Bool_List);
                        when RT_Range =>
                           Set_Returned_Type (S, RT_Range_List);
                        when RT_String_List =>
                           Set_Returned_Type (S, RT_String_List);
                        when RT_Float_List =>
                           Set_Returned_Type (S, RT_Float_List);
                        when RT_Int_List =>
                           Set_Returned_Type (S, RT_Int_List);
                        when RT_Bool_List =>
                           Set_Returned_Type (S, RT_Bool_List);
                        when RT_Range_List =>
                           Set_Returned_Type (S, RT_Range_List);
1530
1531
                        when RT_Element_List =>
                           Set_Returned_Type (S, RT_Element_List);
1532
1533
                        when others =>
                           Display_Analyzer_Error
1534
1535
                             (No_Node, "Could not resolve list type "
                                & Value_Id (T)'Img,
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
                              Loc => Loc (N));
                           Success := False;
                           return;
                     end case;
                  else
                     Set_Returned_Type (S, Value_Id (T));
                  end if;
               end;
            else
               Display_Analyzer_Error (No_Node, "expected a parameter",
                                       Loc => Loc (S));
               Success := False;
               return;
            end if;

         when FC_Property_Exists =>
            if Present (N) and then
              Present (Next_Node (N)) then
               declare
                  Is_Set : Boolean;
               begin

                  Find_Set_Reference (N, S, Is_Set, Success);
                  if not Success then
                     Display_Analyzer_Error
                       (No_Node, "Could not find back set related to "
                        & Get_Name_String (Name (N)), Loc => Loc (N));
                     Success := False;
                     return;
                  end if;

                  N := Next_Node (N);
                  case Kind (N) is

                     when K_Literal =>
                        P := New_Node (K_Literal, Loc (N));
                        Set_Value (P, Value (N));
                        Append_Node_To_List (P, True_parameters (S));

                     when others =>
                        Display_Analyzer_Error
                          (No_Node, "unexpected node kind as a parameter",
                           Loc => Loc (N));
                        Success := False;
                        return;
                  end case;
                  Set_Returned_Type (S, RT_Boolean);
               end;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (N));
               Success := False;
               return;
            end if;

         when FC_First | FC_Last =>
            if Present (N) then
               case Kind (N) is
                  when K_Check_Subprogram_Call =>
                     Analyze_Check_Subprogram_Call (N, Success);
                     if not Success then
                        return;
                     end if;

1600
                     case Returned_Type (N) is
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
                        when RT_Range =>
                           Set_Returned_Type (S, RT_Float);

                        when RT_Range_List =>
                           Set_Returned_Type (S, RT_Float_List);

                        when others =>
                           Display_Analyzer_Error
                             (No_Node, "expected a range value for "
                              & "expression return", Loc => Loc (N));
                           Success := False;
                           return;
                     end case;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (S));
               Success := False;
               return;
            end if;

         when FC_Size =>
            if Present (N) then
               case Kind (N) is

                  when K_Check_Expression
                    | K_Check_Subprogram_Call
                    | K_Ternary_Expression =>
                     Analyze_Verification_Expression (N, Success);

                  when K_Identifier =>
                     Var := Find_Variable (Name (N));
                     if No (Var) then
                        Display_Analyzer_Error
                          (No_Node,
                           "Could not find variable " &
                           Get_Name_String (Name (N)),
                           Loc => Loc (N));
                        return;
                     end if;
                     P := Make_Var_Reference (Name (N));
                     Set_Referenced_Var (P, Var);
                     Replace_Node_To_List (Parameters (S), N, P);
                     N := P;
                     Analyze_Verification_Expression (N, Success);

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (S));
               Success := False;
               return;
            end if;

            if not Success then
               return;
            end if;
            case Returned_Type (N) is
               when RT_Float_List
                 | RT_Int_List
                 | RT_String_List
                 | RT_Bool_List
                 | RT_Range_List
                 | RT_Element_List =>
                  Set_Returned_Type (S, RT_Integer);

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "expected a list value for "
                     & "expression return", Loc => Loc (N));
                  Success := False;
                  return;
            end case;

         when FC_Queue =>
            if Present (N) then
               case Kind (N) is

                  when K_Check_Expression
                    | K_Check_Subprogram_Call
                    | K_Ternary_Expression =>
                     Analyze_Verification_Expression (N, Success);

                  when K_Identifier =>
                     Var := Find_Variable (Name (N));
                     if No (Var) then
                        Display_Analyzer_Error
                          (No_Node,
                           "Could not find variable " &
                           Get_Name_String (Name (N)),
                           Loc => Loc (N));
                        return;
                     end if;
                     P := Make_Var_Reference (Name (N));
                     Set_Referenced_Var (P, Var);
                     Replace_Node_To_List (Parameters (S), N, P);
                     N := P;
                     Analyze_Verification_Expression (N, Success);

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (S));
               Success := False;
               return;
            end if;

            if not Success then
               return;
            end if;
            case Returned_Type (N) is
               when RT_Float_List
                 | RT_Int_List
                 | RT_String_List
                 | RT_Bool_List
                 | RT_Range_List
                 | RT_Element_List =>
                  Set_Returned_Type (S, Returned_Type (N));

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "expected a list value for "
                     & "expression return", Loc => Loc (N));
                  Success := False;
                  return;
            end case;

         when FC_Head =>
            if Present (N) then
               case Kind (N) is

                  when K_Check_Expression
                    | K_Check_Subprogram_Call
                    | K_Ternary_Expression =>
                     Analyze_Verification_Expression (N, Success);

                  when K_Identifier =>
                     Var := Find_Variable (Name (N));
                     if No (Var) then
                        Display_Analyzer_Error
                          (No_Node,
                           "Could not find variable " &
                           Get_Name_String (Name (N)),
                           Loc => Loc (N));
                        return;
                     end if;
                     P := Make_Var_Reference (Name (N));
                     Set_Referenced_Var (P, Var);
                     Replace_Node_To_List (Parameters (S), N, P);
                     N := P;
                     Analyze_Verification_Expression (N, Success);

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "unexpected node kind as a parameter",
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (S));
               Success := False;
               return;
            end if;

            if not Success then
               return;
            end if;
            case Returned_Type (N) is

               when RT_Float_List =>
                  Set_Returned_Type (S, RT_Float);

               when RT_Int_List =>
                  Set_Returned_Type (S, RT_Integer);

               when RT_String_List =>
                  Set_Returned_Type (S, RT_String);

               when RT_Bool_List =>
                  Set_Returned_Type (S, RT_Boolean);

               when RT_Range_List =>
                  Set_Returned_Type (S, RT_Range);

               when RT_Element_List =>
                  Set_Returned_Type (S, RT_Element);

               when others =>
                  Display_Analyzer_Error
                    (No_Node, "expected a list value for "
                     & "expression return", Loc => Loc (N));
                  Success := False;
                  return;
            end case;

         when FC_Float | FC_Int =>
            if Code (S) = FC_Int then
               Set_Returned_Type (S, RT_Integer);
            else
               Set_Returned_Type (S, RT_Float);
            end if;
            if Present (N) then
               case Kind (N) is

                  when K_Check_Subprogram_Call
                    | K_Check_Expression
                    | K_Ternary_Expression =>
                     Analyze_Verification_Expression (N, Success);
                     if Success then
1831
1832
                        if Returned_Type (N) /= RT_Integer
                          and then Returned_Type (N) /=
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
                          RT_Float then
                           Display_Analyzer_Error
                             (No_Node,
                              "expected a numeric return for expression",
                              Loc => Loc (N));
                           Success := False;
                           return;
                        end if;
                     else
                        return;
                     end if;

                  when K_Identifier =>
                     D := Find_Variable (Name (N));
                     if No (D) then
                        Display_Analyzer_Error
                          (No_Node,
                           "Could not find variable " &
                           Get_Name_String (Name (N)),
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;
                     P := Make_Var_Reference (Name (N));
                     Set_Referenced_Var (P, D);
                     Replace_Node_To_List (Parameters (S), N, P);
                     Analyze_Verification_Expression (P, Success);
                     if not Success
                       or else (Returned_Type (P) /= RT_Float
                                and then Returned_Type (P) /= RT_Integer)
                     then
                        Success := False;
                        Display_Analyzer_Error
                          (S, "expected a numeric value");
                        return;
                     end if;

                  when K_Literal =>
                     declare
                        use Ocarina.REAL_Values;

                        V : constant Value_Type := Get_Value_Type (Value (N));
                     begin
                        if V.T /= LT_Real and then V.T /= LT_Integer then
                           Display_Analyzer_Error
                             (No_Node, "expected a numeric value");
                           Success := False;
                           return;
                        end if;
                     end;

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "expected a numeric value", Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error
                 (No_Node, "expected a parameter", Loc => Loc (S));
               Success := False;
               return;
            end if;

         when FC_List =>
            --  Turns a set into a list of elements or
            --  create a list from a collection of elements or
            --  create a list from a collection of values

            declare
               use Ocarina.REAL_Values;

               Is_List_Decl : Boolean := False;
               V            : Value_Type;
               Last_Found   : Value_Id := Value_Id (RT_Unknown);
               Inconsistant : Boolean := False;
               M, D, P      : Node_Id;
            begin
               while Present (N) loop
                  case Kind (N) is
                     when K_Set_Reference =>
                        if Is_List_Decl then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not put a set reference into "
                              & "a list of elements",
                              Loc => Loc (N));
                           return;
                        end if;
                        declare
                           TV : Value_Id;
                        begin
                           pragma Unreferenced (TV);
                           TV := Get_Set_Type (N);
                           Append_Node_To_List (N, Referenced_Sets (S));
                        end;

                     when K_Identifier =>
                        D := Find_Node_By_Name (To_Lower (Name (N)),
                                                Used_Set (Real_Root));
                        if Present (D) then

                           --  Add to set reference list

                           M := Make_Set_Reference;
                           Set_Referenced_Set (M, D);
                           Append_Node_To_List (M, Referenced_Sets (S));
                        else
                           D := Find_Variable (Name (N));
                           if Present (D) then
                              Is_List_Decl := True;
                              P := Make_Var_Reference (Name (N));
                              Set_Referenced_Var (P, D);
                              Replace_Node_To_List (Parameters (S), N, P);
                              Analyze_Verification_Expression (P, Success);
                              if Success then
                                 case Returned_Type (P) is
                                    when RT_Float =>
                                       if Last_Found = RT_Unknown then
                                          Last_Found := RT_Float_List;
                                       else
                                          Inconsistant :=
                                            (Last_Found /=
                                             Value_Id (RT_Float_List));
                                       end if;
                                    when RT_Integer =>
                                       if Last_Found = RT_Unknown then
                                          Last_Found := RT_Int_List;
                                       else
                                          Inconsistant :=
                                            (Last_Found /=
                                             Value_Id (RT_Int_List));
                                       end if;
                                    when RT_String =>
                                       if Last_Found = RT_Unknown then
                                          Last_Found := RT_String_List;
                                       else
                                          Inconsistant :=
                                            (Last_Found /=
                                             Value_Id (RT_String_List));
                                       end if;
                                    when RT_Boolean =>
                                       if Last_Found = RT_Unknown then
                                          Last_Found := RT_Bool_List;
                                       else
                                          Inconsistant :=
                                            (Last_Found /=
                                             Value_Id (RT_Bool_List));
                                       end if;
                                    when RT_Range =>
                                       if Last_Found = RT_Unknown then
                                          Last_Found := RT_Range_List;
                                       else
                                          Inconsistant :=
                                            (Last_Found /=
                                             Value_Id (RT_Range_List));
                                       end if;
                                    when others =>
                                       Display_Analyzer_Error
                                         (No_Node,
                                          "Could not resolve list type",
                                          Loc => Loc (N));
                                       Success := False;
                                       return;
                                 end case;
                              end if;
                           else
                              Display_Analyzer_Error
                                (No_Node,
                                 "Could not find set or variable " &
                                 Get_Name_String (Name (N)),
                                 Loc => Loc (N));
                              return;
                           end if;
                        end if;

                     when K_Literal =>
                        Is_List_Decl := True;
                        V := Get_Value_Type (Value (N));
                        case V.T is
                           when LT_Real =>
                              if Last_Found = RT_Unknown then
                                 Last_Found := RT_Float_List;
                              else
                                 Inconsistant := (Last_Found /=
                                                  Value_Id (RT_Float_List));
                              end if;
                           when LT_Integer =>
                              if Last_Found = RT_Unknown then
                                 Last_Found := RT_Int_List;
                              else
                                 Inconsistant := (Last_Found /=
                                                  Value_Id (RT_Int_List));
                              end if;
                           when LT_String =>
                              if Last_Found = RT_Unknown then
                                 Last_Found := RT_String_List;
                              else
                                 Inconsistant := (Last_Found /=
                                                  Value_Id (RT_String_List));
                              end if;

                           when LT_Boolean =>
                              if Last_Found = RT_Unknown then
                                 Last_Found := RT_Bool_List;
                              else
                                 Inconsistant := (Last_Found /=
                                                  Value_Id (RT_Bool_List));
                              end if;

                           when LT_Range =>
                              if Last_Found = RT_Unknown then
                                 Last_Found := RT_Range_List;
                              else
                                 Inconsistant := (Last_Found /=
                                                  Value_Id (RT_Range_List));
                              end if;

                           when others =>
                              Display_Analyzer_Error
2053
                                (No_Node, "Could not resolve list type ",
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
                                 Loc => Loc (N));
                              Success := False;
                              return;
                        end case;

                     when others =>
                        Display_Analyzer_Error
                          (No_Node,
                           "expected a set, a set identifier or a list "
                           & "of literal",
                           Loc => Loc (N));
                        Success := False;
                        return;
                  end case;

                  N := Next_Node (N);
               end loop;

               if Inconsistant then
                  Display_Analyzer_Error
                    (No_Node, "Inconsistant elements type "
                     & "in list declaration",
                     Loc => Loc (S));
                  Success := False;
                  return;
               end if;

               if Is_List_Decl then
                  Set_Returned_Type (S, Last_Found);
               else
                  Set_Returned_Type (S, Value_Id (RT_Element_List));
               end if;
            end;

         when FC_GCD | FC_LCM =>
            --  Takes as parameters :
            --  a couple of integer
            --  or a list of integer

            Set_Returned_Type (S, Value_Id (RT_Integer));

            declare
               Is_List : Boolean := False;
               Iter    : Int := 0;
               P, Var  : Node_Id;
            begin
               Success := True;
               while Present (N) and then Success loop
                  case Kind (N) is
                     when K_Check_Subprogram_Call
                       | K_Check_Expression
                       | K_Ternary_Expression
                       | K_Var_Reference =>

                        Analyze_Verification_Expression (N, Success);
                        if not Success then
                           return;
                        end if;
                        if Returned_Type (N) = RT_Integer then
                           null;
                        elsif Returned_Type (N) = RT_Int_List then
                           if Iter = 0 then
                              Is_List := True;
                           else
                              Success := False;
                           end if;
                        else
                           Success := False;
                           return;
                        end if;

                     when K_Literal =>
                        declare
                           use Ocarina.REAL_Values;

                           V : constant Value_Type :=
                             Get_Value_Type (Value (N));
                        begin
                           Success :=  (V.T = LT_Integer);
                        end;

                     when K_Identifier =>
                        Var := Find_Variable (Name (N));
                        if No (Var) then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not find variable " &
                              Get_Name_String (Name (Identifier (N))),
                              Loc => Loc (N));
                           Success := False;
                           exit;
                        end if;
                        P := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (P, Var);
                        Replace_Node_To_List (Parameters (S), N, P);
                        Analyze_Verification_Expression (P, Success);
                        if Success then
                           if Returned_Type (P) = RT_Integer then
                              Success := not Is_List;
                           elsif Returned_Type (P) = RT_Int_List then
                              Is_List := True;
                           else
                              Success := False;
                           end if;
                        else
                           return;
                        end if;

                     when others =>
                        Success := False;
                  end case;

                  Iter := Iter + 1;
                  N := Next_Node (N);
               end loop;

               if not Success
                 or else (Iter < 1 and then not Is_List) then
                  Display_Analyzer_Error
                    (No_Node,
                     "expected a list of integers or an integer list"
                     & " as parameters",
                     Loc => Loc (S));
                  return;
               end if;
            end;

         when FC_Non_Null =>
            --  Takes as parameters an integer

            Set_Returned_Type (S, Value_Id (RT_Integer));

            declare
               Iter    : Int := 0;
               P, Var  : Node_Id;
            begin
               while Present (N) and then Success loop

                  case Kind (N) is

                     when K_Check_Subprogram_Call
                       | K_Check_Expression
                       | K_Ternary_Expression
                       | K_Var_Reference =>
                        Analyze_Verification_Expression (N, Success);
                        Success := Success and then
                          (Returned_Type (N) = RT_Integer);
                        if not Success then
                           return;
                        end if;

                     when K_Literal =>
                        declare
                           use Ocarina.REAL_Values;

                           V : constant Value_Type :=
                             Get_Value_Type (Value (N));
                        begin
                           Success :=  (V.T = LT_Integer);
                        end;

                     when K_Identifier =>
                        Var := Find_Variable (Name (N));
                        if No (Var) then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not find variable " &
                              Get_Name_String (Name (Identifier (N))),
                              Loc => Loc (N));
                           Success := False;
                           exit;
                        end if;
                        P := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (P, Var);
                        Replace_Node_To_List (Parameters (S), N, P);
                        Analyze_Verification_Expression (P, Success);
                        Success := Success
                          and then (Returned_Type (P) = RT_Integer);

                     when others =>
                        Success := False;
                  end case;

                  Iter := Iter + 1;
                  N := Next_Node (N);
               end loop;

               if not Success or else Iter /= 1  then
                  Display_Analyzer_Error
                    (No_Node,
                     "expected an integer as parameter",
                     Loc => Loc (S));
                  return;
               end if;
            end;

         when FC_Is_In =>
            --  Expects parameters which can be either a list, a set
            --  or a single element
            declare
               Nb_Params : Natural := 0;
               P, Var    : Node_Id;
               Is_Set    : Boolean;
               Find_Set  : Boolean := False;
            begin
               Set_Returned_Type (S, RT_Boolean);
               while Present (N) loop
                  case Kind (N) is
                     when K_Identifier =>
                        Var := Find_Variable (Name (N));
                        if No (Var) then
                           Find_Set_Reference (N, S, Is_Set, Success);
                           if not Success then
                              Display_Analyzer_Error
                                (No_Node,
                                 "Could not find back set or variable named "
                                 & Get_Name_String (Name (N)),
                                 Loc => Loc (N));
                              Success := False;
                              return;
                           end if;
                           Find_Set := True;
                           N := Next_Node (N);
                        else
                           if Find_Set then
                              Display_Analyzer_Error
                                (No_Node,
                                 "cannot call is_in on heterogenous types",
                                 Loc => Loc (N));
                           end if;
                           Set_Variable_Position (S, Value_Id (1 - Nb_Params));
                           P := Make_Var_Reference (Name (N));
                           Set_Referenced_Var (P, Var);
                           Remove_Node_From_List (N, Parameters (S));
                           Append_Node_To_List (P, True_Parameters (S));
                           N := Next_Node (N);
                        end if;

                     when K_Check_Subprogram_Call =>
                        if Find_Set then
                           Display_Analyzer_Error
                             (No_Node,
                              "cannot call is_in on heterogenous types",
                              Loc => Loc (N));
                        end if;
                        Analyze_Check_Subprogram_Call (N, Success);
                        if not Success then
                           return;
                        end if;
2303

2304
2305
2306
2307
2308
                        if Returned_Type (N) /= RT_Int_List
                          and then Returned_Type (N) /= RT_Float_List
                          and then Returned_Type (N) /= RT_String_List
                          and then Returned_Type (N) /= RT_Element_List
                          and then Returned_Type (N) /= RT_Bool_List
2309
2310
2311
2312
2313
2314
2315
                          and then Nb_Params = 1
                        then
                           if Returned_Type (N) = RT_Unknown then
                              Success := True;
                              return;
                           end if;

2316
2317
                           Display_Analyzer_Error
                             (No_Node,
2318
                              "expected a list return expression ",
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
                              Loc => Loc (N));
                           Success := False;
                           return;
                        end if;
                        P := Next_Node (N);
                        Remove_Node_From_List (N, Parameters (S));
                        Set_Next_Node (N, No_Node);
                        Append_Node_To_List (N, True_Parameters (S));
                        N := P;
                        Set_Variable_Position (S, Value_Id (1 - Nb_Params));

                     when K_Set_Reference =>
                        Find_Set_Reference (N, S, Is_Set, Success);
                        if not Success then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not find back set or variable named "
                              & Get_Name_String (Name (N)),
                              Loc => Loc (N));
                           Success := False;
                           return;
                        end if;
                        N := Next_Node (N);

                     when others =>
                        Display_Analyzer_Error
                          (No_Node, "expected a list return expression",
                           Loc => Loc (N));
                        Success := False;
                        return;
                  end case;
                  Nb_Params := Nb_Params + 1;
               end loop;

               if Nb_Params /= 2 then
                  Display_Analyzer_Error
                    (No_Node,
                     "expected two parameters for 'is_in' function",
                     Loc => Loc (S));
                  Success := False;
                  return;
               end if;
            end;

         when FC_Max | FC_Min | FC_Sum | FC_Product =>
            Set_Returned_Type (S, Get_Returned_Type (Code (S)));
            declare
               Var : Node_Id;
            begin
               if Present (N) then
                  case Kind (N) is
                     when K_Check_Expression
                       | K_Check_Subprogram_Call
                       | K_Ternary_Expression =>
                        Analyze_Verification_Expression (N, Success);
                        if not Success then
                           return;
                        end if;

                     when K_Identifier =>
                        Var := Find_Variable (Name (N));
                        if No (Var) then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not find variable " &
                              Get_Name_String (Name (N)),
                              Loc => Loc (N));
                           return;
                        end if;
                        P := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (P, Var);
                        Replace_Node_To_List (Parameters (S), N, P);
                        N := P;
                        Analyze_Verification_Expression (N, Success);

                     when others =>
                        Display_Analyzer_Error
                          (No_Node,
                           "expected a numeric list return expression",
                           Loc => Loc (N));
                        Success := False;
                        return;
                  end case;

                  if Returned_Type (N) /= RT_Int_List
2404
2405
2406
2407
2408
2409
2410
                    and then Returned_Type (N) /= RT_Float_List
                  then
                     if Returned_Type (N) = RT_Unknown then
                        Success := True;
                        return;
                     end if;

2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
                     Display_Analyzer_Error
                       (No_Node,
                        "expected a numeric list return expression",
                        Loc => Loc (N));
                     Success := False;
                     return;
                  end if;
               else
                  Display_Analyzer_Error (No_Node, "expected a parameter",
                                          Loc => Loc (S));
                  Success := False;
                  return;
               end if;
            end;

         when FC_All_Equals =>
            Set_Returned_Type (S, RT_Boolean);
            if Present (N) then
               case Kind (N) is
                  when K_Check_Subprogram_Call =>
                     Analyze_Check_Subprogram_Call (N, Success);
                     if not Success then
                        return;
                     end if;
2435
2436
                     if Returned_Type (N) /= RT_Int_List
                       and then Returned_Type (N) /= RT_Float_List
2437
                     then
2438
2439
2440
2441
2442
                        if Returned_Type (N) = RT_Unknown then
                           Success := True;
                           return;
                        end if;

2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
                        Display_Analyzer_Error
                          (No_Node,
                           "expected a numeric list return expression",
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;

                  when others =>
                     Display_Analyzer_Error
2453
2454
                       (No_Node,
                        "expected a numeric list return expression",
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
                        Loc => Loc (N));
                     Success := False;
                     return;
               end case;
            else
               Display_Analyzer_Error (No_Node, "expected a parameter",
                                       Loc => Loc (S));
               Success := False;
               return;
            end if;

         when FC_Get_System_Property_Value =>
            if Present (N) then
               case Kind (N) is

                  when K_Literal =>
                     Get_Property_Type (N, Success, T);
                     if not Success then
                        Display_Analyzer_Error
                          (No_Node, "could not resolve property type",
                           Loc => Loc (N));
                        Success := False;
                        return;
                     end if;
                     Set_Returned_Type (S, T);

                     P := New_Node (K_Literal, Loc (N));
                     Set_Value (P, Value (N));
                     Append_Node_To_List (P, True_parameters (S));

                  when others =>
                     Display_Analyzer_Error
                       (No_Node, "expected a literal", Loc => Loc (N));
                     Success := False;
                     return;
               end case;
               Set_Returned_Type (S, Value_Id (T));
            else
               Display_Analyzer_Error (No_Node, "expected a parameter",
                                       Loc => Loc (S));
               Success := False;
               return;
            end if;

2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
         when FC_Cos | FC_Sin | FC_Tan | FC_Cosh | FC_Sinh | FC_Tanh
           | FC_Ln | FC_Exp | FC_Sqrt =>
            Set_Returned_Type (S, RT_Float);

            declare
               Is_List : Boolean := False;
               Iter    : Int := 0;
               P, Var  : Node_Id;
            begin
               while Present (N) and then Success loop
                  case Kind (N) is
                     when K_Check_Subprogram_Call
                       | K_Check_Expression
                       | K_Ternary_Expression
                       | K_Var_Reference =>

                        Analyze_Verification_Expression (N, Success);
                        if not Success then
                           return;
                        end if;
                        if Returned_Type (N) = RT_Integer then
                           null;
                        elsif Returned_Type (N) = RT_Int_List then
                           if Iter = 0 then
                              Is_List := True;
                           else
                              Success := False;
                           end if;
                        else
                           Success := False;
                           return;
                        end if;

                     when K_Literal =>
                        declare
                           use Ocarina.REAL_Values;

                           V : constant Value_Type
                             := Get_Value_Type (Value (N));
                        begin
                           Success :=  (V.T = LT_Real);
                        end;

                     when K_Identifier =>
                        Var := Find_Variable (Name (N));
                        if No (Var) then
                           Display_Analyzer_Error
                             (No_Node,
                              "Could not find variable " &
                                Get_Name_String (Name (Identifier (N))),
                              Loc => Loc (N));
                           Success := False;
                           exit;
                        end if;
                        P := Make_Var_Reference (Name (N));
                        Set_Referenced_Var (P, Var);