scripts/cpa.sh -svcomp24 -heap 10000M -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/Mirai-Source-Code/main.c


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


Running CPAchecker with Java heap of size 10000M.
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.3 (OpenJDK 64-Bit Server VM 17.0.9) started (CPAchecker.run, INFO)

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

Undefined function __sync_fetch_and_add found, first called in line 835 (CheckBindingVisitor.visit, WARNING)

Undefined function __sync_fetch_and_sub found, first called in line 1431 (CheckBindingVisitor.visit, WARNING)

line 1666: Dead code detected: close(epollFD); (CFACreationUtils.addEdgeToCFA, INFO)

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

Using predicate analysis with MathSAT5 version 5.6.10 (9293adc746be) (May 31 2023 12:38:06, gmp 6.2.0, gcc 7.5.0, 64-bit, reentrant) and JFactory 1.21. (PredicateCPA:PredicateCPA.<init>, INFO)

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

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

Assuming external function epoll_create 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 atoi to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Assuming external function pthread_mutex_init 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 read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO)

Error: line 1785: Unrecognized C code (unsupported thread assignment): (pthread_t *)(&thread) (ThreadingTransferRelation.startNewThread, SEVERE)


PredicateCPA statistics
-----------------------
Number of abstractions:            10 (4% of all post computations)
  Times abstraction was reused:    0
  Because of function entry/exit:  4 (40%)
  Because of loop head:            6 (60%)
  Because of join nodes:           0 (0%)
  Because of threshold:            0 (0%)
  Because of target state:         0 (0%)
  Times precision was empty:       10 (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:         19
  BDD entailment checks:           15
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       42
Avg ABE block size:                                15.70 (sum: 157, count: 10, min: 2, max: 42)
Number of predicates discovered:          0

Time for post operator:                                0.141s
  Time for path formula creation:                      0.140s
Time for strengthen operator:                          0.004s
Time for prec operator:                                0.003s
  Time for abstraction:                  0.001s (Max:     0.001s, Count: 10)
    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.003s
Time for coverage checks:                              0.006s
  Time for BDD entailment checks:                      0.006s
Total time for SMT solver (w/o itp):     0.000s

Number of path formula cache hits:   0 (0%)

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

Total number of created targets for pointer analysis: 0


Number of BDD nodes:                               202
Size of BDD node table:                            524309
Size of BDD cache:                                 52433
Size of BDD node cleanup queue:                    0.00 (sum: 0, count: 26, min: 0, max: 0)
Time for BDD node cleanup:                             0.000s
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:                     6.08 (sum: 1466, count: 241, min: 0, max: 15)
Number of global variables per state:              5.74 (sum: 1383, count: 241, min: 0, max: 13)
Number of assumptions:                                   12
Number of deterministic assumptions:                      0
Level of Determinism:                              0%

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                     242
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.001s
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.001s
Total time for strengthen operator:                    0.047s
Automaton transfers with branching:                0
Automaton transfer successors:                     1.00 (sum: 242, count: 242, min: 1, max: 1) [1 x 242]
Number of states with assumption transitions:      0

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

CPA algorithm statistics
------------------------
Number of iterations:            238
Max size of waitlist:            4
Average size of waitlist:        1
Number of computed successors:   242
Max successors for one state:    2
Number of times merged:          0
Number of times stopped:         2
Number of times breaked:         0

Total time for CPA algorithm:         0.271s (Max:     0.271s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.008s
  Time for transfer relation:         0.239s
  Time for merge operator:            0.011s
  Time for stop operator:             0.005s
  Time for adding to reached set:     0.002s

CPAchecker general statistics
-----------------------------
Number of program locations:                       7669
Number of CFA edges (per node):                        9169 (count: 7669, min: 0, max: 23, avg: 1.20)
Number of relevant variables:                      972
Number of functions:                               109
Number of loops (and loop nodes):                       268 (sum: 10751, min: 6, max: 526, avg: 40.12)
Size of reached set:             241
  Number of partitions:          235
    Avg size of partitions:      1
    Max size of partitions:      2 (with key [{main=N1387 (before line 1778) Function main called from node N1357, stack depth 1 [81cd90e], stack [main] @@ 0}, ABS0: true])
  Number of target states:       0
  Size of final wait list:       4

Time for analysis setup:          1.852s
  Time for loading CPAs:          0.473s
  Time for loading parser:        0.171s
  Time for CFA construction:      1.180s
    Time for parsing file(s):     0.234s
    Time for AST to CFA:          0.301s
    Time for CFA sanity check:    0.001s
    Time for post-processing:     0.564s
    Time for loop structure:      0.151s
    Time for AST structure:       0.000s
      Time for function pointers resolving:            0.003s
        Function calls via function pointers:             0 (count: 1, min: 0, max: 0, avg: 0.00)
        Instrumented function pointer calls:              0 (count: 1, min: 0, max: 0, avg: 0.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.274s
        Time for collecting variables:                 0.185s
        Time for solving dependencies:                 0.007s
        Time for building hierarchy:                   0.001s
        Time for building classification:              0.081s
        Time for exporting data:                       0.000s
Time for Analysis:                0.272s
CPU time for analysis:            0.980s
Total time for CPAchecker:        2.124s
Total CPU time for CPAchecker:    6.960s
Time for statistics:              0.041s

Time for Garbage Collector:       0.041s (in 6 runs)
Garbage Collector(s) used:    G1 Old Generation, G1 Young Generation

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