scripts/cpa.sh -svcomp23 -heap 4000M -benchmark -timelimit '900 s' -stats -spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp -64 /mnt/goblint-svcomp/goblint-bench/bench/concrat/fzy/main.c


--------------------------------------------------------------------------------


Running CPAchecker with Java heap of size 4000M.
Running CPAchecker with default stack size (1024k). Specify a larger value with -stack if needed.
Language C detected and set for analysis (CPAMain.detectFrontendLanguageIfNecessary, INFO)

Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO)

CPAchecker 2.2 (OpenJDK 64-Bit Server VM 17.0.8.1) started (CPAchecker.run, INFO)

Parsing CFA from file(s) "/mnt/goblint-svcomp/goblint-bench/bench/concrat/fzy/main.c" (CPAchecker.parse, INFO)

line 732: Dead code detected: __res = toupper((int )c); (CFACreationUtils.addEdgeToCFA, INFO)

line 809: Dead code detected: __res = tolower((int )*(needle + i)); (CFACreationUtils.addEdgeToCFA, INFO)

line 820: Dead code detected: __res___0 = tolower((int )*(haystack + i___0)); (CFACreationUtils.addEdgeToCFA, INFO)

line 2763: Dead code detected: return (state->exit); (CFACreationUtils.addEdgeToCFA, INFO)

Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING)

program contains concurrency, cloning functions... (CFACreator.postProcessingOnMutableCFAs, INFO)

Using predicate analysis with MathSAT5 version 5.6.8 (27814677e16f) (Jun 28 2022 17:03:19, gmp 6.1.2, gcc 6.3.0, 64-bit, reentrant) and JFactory 1.21. (PredicateCPA:PredicateCPA.<init>, INFO)

Starting analysis ... (CPAchecker.runAlgorithm, INFO)

Assuming external function getopt_long to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function realloc to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function sysconf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function isatty to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function open to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function perror to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function fopen to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function setvbuf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function tcgetattr to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function tcsetattr to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function fileno to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function ioctl to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function fread to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

line 1290: Ignoring parameters passed as varargs to function tty_printf: tty_printf(tty, "%c%c%im", 27, '[', code) (PredicateCPA:CtoFormulaConverter.makeFunctionCall, WARNING)

Assuming external function __builtin_va_start to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Cannot get declaration of function __builtin_va_start, ignoring calls to it. (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING)

Assuming external function vfprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

line 1395: Return type of function __builtin_va_end is void, but result is used as type int: __builtin_va_end(args); (PredicateCPA:CtoFormulaConverter.getReturnType, WARNING)

Assuming external function __builtin_va_end to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function signal to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function strcpy to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function strncpy to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function pthread_mutex_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Error: line 1853: Unrecognized C code (unsupported thread join access): (workers + 0)->thread_id (ThreadingTransferRelation.extractParamName, SEVERE)


PredicateCPA statistics
-----------------------
Number of abstractions:            1323 (17% of all post computations)
  Times abstraction was reused:    0
  Because of function entry/exit:  1002 (76%)
  Because of loop head:            321 (24%)
  Because of join nodes:           0 (0%)
  Because of threshold:            0 (0%)
  Because of target state:         0 (0%)
  Times precision was empty:       1323 (100%)
  Times precision was {false}:     0 (0%)
  Times result was cached:         0 (0%)
  Times cartesian abs was used:    0 (0%)
  Times boolean abs was used:      0 (0%)
  Times result was 'false':        0 (0%)
Number of strengthen sat checks:   0
Number of coverage checks:         22436
  BDD entailment checks:           21515
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       40
Avg ABE block size:                                4.46 (sum: 5897, count: 1323, min: 0, max: 40)
Number of predicates discovered:          0

Time for post operator:                                2.129s
  Time for path formula creation:                      2.118s
Time for strengthen operator:                          0.024s
Time for prec operator:                                0.122s
  Time for abstraction:                  0.017s (Max:     0.005s, Count: 1323)
    Solving time:                        0.000s (Max:     0.000s)
    Model enumeration time:              0.000s
    Time for BDD construction:           0.000s (Max:     0.000s)
Time for merge operator:                               0.142s
Time for coverage checks:                              0.043s
  Time for BDD entailment checks:                      0.042s
Total time for SMT solver (w/o itp):     0.000s

Number of path formula cache hits:   2908 (34%)

Inside post operator:                  
  Inside path formula creation:        
    Time for path formula computation:     1.989s

Total number of created targets for pointer analysis: 0


Number of BDD nodes:                               202
Size of BDD node table:                            202729
Size of BDD cache:                                 20287
Size of BDD node cleanup queue:                    0.00 (sum: 0, count: 22839, min: 0, max: 0)
Time for BDD node cleanup:                             0.007s
Time for BDD garbage collection:                       0.000s (in 0 runs)

KeyValue statistics
-------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

ValueAnalysisCPA statistics
---------------------------
Number of variables per state:                     2.86 (sum: 21443, count: 7508, min: 0, max: 7)
Number of global variables per state:              0.00 (sum: 4, count: 7508, min: 0, max: 1)
Number of assumptions:                                 1646
Number of deterministic assumptions:                      0
Level of Determinism:                              0%

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    7849
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.013s
Total time for path thresholds:                        0.000s

ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA:     0.000s
Replaced symbolic expressions: 0

AutomatonAnalysis (DataRace) statistics
---------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.013s
Total time for strengthen operator:                    0.687s
Automaton transfers with branching:                0
Automaton transfer successors:                     1.00 (sum: 7849, count: 7849, min: 1, max: 1) [1 x 7849]
Number of states with assumption transitions:      0

AutomatonAnalysis (svcompTerminatingFunctions) statistics
---------------------------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.040s
Automaton transfers with branching:                0
Automaton transfer successors:                     1.00 (sum: 7849, count: 7849, min: 1, max: 1) [1 x 7849]
Number of states with assumption transitions:      0

CPA algorithm statistics
------------------------
Number of iterations:            7386
Max size of waitlist:            214
Average size of waitlist:        125
Number of computed successors:   7849
Max successors for one state:    2
Number of times merged:          91
Number of times stopped:         342
Number of times breaked:         0

Total time for CPA algorithm:         4.873s (Max:     4.873s)
  Time for choose from waitlist:      0.009s
  Time for precision adjustment:      0.196s
  Time for transfer relation:         4.028s
  Time for merge operator:            0.360s
  Time for stop operator:             0.133s
  Time for adding to reached set:     0.051s

CPAchecker general statistics
-----------------------------
Number of program locations:                       11706
Number of CFA edges (per node):                       12949 (count: 11706, min: 0, max: 13, avg: 1.11)
Number of relevant variables:                      2499
Number of functions:                               565
Number of loops (and loop nodes):                       230 (sum: 3433, min: 3, max: 74, avg: 14.93)
Size of reached set:             7508
  Number of partitions:          6272
    Avg size of partitions:      1
    Max size of partitions:      27 (with key [{main=N935 (before line 1526) Function choices_fread called from node N242, stack depth 2 [4f3db580], stack [main, choices_fread] @@ 0}])
  Number of target states:       0
  Size of final wait list:       209

Time for analysis setup:          3.967s
  Time for loading CPAs:          0.839s
  Time for loading parser:        0.293s
  Time for CFA construction:      2.761s
    Time for parsing file(s):     0.628s
    Time for AST to CFA:          0.816s
    Time for CFA sanity check:    0.000s
    Time for post-processing:     1.217s
      Time for function pointers resolving:            0.014s
        Function calls via function pointers:             3 (count: 1, min: 3, max: 3, avg: 3.00)
        Instrumented function pointer calls:              3 (count: 1, min: 3, max: 3, avg: 3.00)
        Function calls with function pointer arguments:        0 (count: 1, min: 0, max: 0, avg: 0.00)
        Instrumented function pointer arguments:          0 (count: 1, min: 0, max: 0, avg: 0.00)
      Time for classifying variables:                  0.659s
        Time for collecting variables:                 0.444s
        Time for solving dependencies:                 0.024s
        Time for building hierarchy:                   0.001s
        Time for building classification:              0.190s
        Time for exporting data:                       0.000s
Time for Analysis:                4.874s
CPU time for analysis:            4.870s
Total time for CPAchecker:        8.842s
Total CPU time for CPAchecker:    8.840s
Time for statistics:              0.152s

Time for Garbage Collector:       0.264s (in 26 runs)
Garbage Collector(s) used:    Copy, MarkSweepCompact

Verification result: UNKNOWN, incomplete analysis.
More details about the verification run can be found in the directory "./output".
