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/C-Thread-Pool/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/C-Thread-Pool/main.c" (CPAchecker.parse, INFO)

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

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

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

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

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

Error: line 470: Unrecognized C code (unsupported thread assignment): (pthread_t *)(&((*thread_p)->pthread)) (ThreadingTransferRelation.startNewThread, SEVERE)


PredicateCPA statistics
-----------------------
Number of abstractions:            32 (10% of all post computations)
  Times abstraction was reused:    0
  Because of function entry/exit:  27 (84%)
  Because of loop head:            5 (16%)
  Because of join nodes:           0 (0%)
  Because of threshold:            0 (0%)
  Because of target state:         0 (0%)
  Times precision was empty:       32 (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:         39
  BDD entailment checks:           25
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       14
Avg ABE block size:                                4.63 (sum: 148, count: 32, min: 0, max: 14)
Number of predicates discovered:          0

Time for post operator:                                0.247s
  Time for path formula creation:                      0.243s
Time for strengthen operator:                          0.009s
Time for prec operator:                                0.011s
  Time for abstraction:                  0.001s (Max:     0.001s, Count: 32)
    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.011s
Time for coverage checks:                              0.009s
  Time for BDD entailment checks:                      0.009s
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.233s

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: 58, 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:                     3.52 (sum: 1087, count: 309, min: 0, max: 9)
Number of global variables per state:              1.36 (sum: 419, count: 309, min: 0, max: 2)
Number of assumptions:                                   54
Number of deterministic assumptions:                      0
Level of Determinism:                              0%

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

CPA algorithm statistics
------------------------
Number of iterations:            310
Max size of waitlist:            8
Average size of waitlist:        3
Number of computed successors:   318
Max successors for one state:    2
Number of times merged:          7
Number of times stopped:         10
Number of times breaked:         0

Total time for CPA algorithm:         0.680s (Max:     0.680s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.041s
  Time for transfer relation:         0.578s
  Time for merge operator:            0.032s
  Time for stop operator:             0.013s
  Time for adding to reached set:     0.003s

CPAchecker general statistics
-----------------------------
Number of program locations:                       2240
Number of CFA edges (per node):                        2388 (count: 2240, min: 0, max: 2, avg: 1.07)
Number of relevant variables:                      369
Number of functions:                               133
Number of loops (and loop nodes):                        73 (sum: 486, min: 2, max: 25, avg: 6.66)
Size of reached set:             309
  Number of partitions:          302
    Avg size of partitions:      1
    Max size of partitions:      3 (with key [{main=N393 (before line 740) Function main called from node N383, stack depth 1 [6e9a0bea], stack [main] @@ 0}])
  Number of target states:       0
  Size of final wait list:       7

Time for analysis setup:          2.453s
  Time for loading CPAs:          0.572s
  Time for loading parser:        0.290s
  Time for CFA construction:      1.497s
    Time for parsing file(s):     0.528s
    Time for AST to CFA:          0.375s
    Time for CFA sanity check:    0.000s
    Time for post-processing:     0.527s
      Time for function pointers resolving:            0.030s
        Function calls via function pointers:             1 (count: 1, min: 1, max: 1, avg: 1.00)
        Instrumented function pointer calls:              1 (count: 1, min: 1, max: 1, avg: 1.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.269s
        Time for collecting variables:                 0.170s
        Time for solving dependencies:                 0.008s
        Time for building hierarchy:                   0.003s
        Time for building classification:              0.086s
        Time for exporting data:                       0.000s
Time for Analysis:                0.680s
CPU time for analysis:            0.680s
Total time for CPAchecker:        3.134s
Total CPU time for CPAchecker:    3.130s
Time for statistics:              0.099s

Time for Garbage Collector:       0.075s (in 8 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".
