./deagle --no-assertions --datarace --32 /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c


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


Deagle version 2.1 64-bit x86_64 linux
which contains:
CBMC version 5.67.0 (SVCOMP2023_221122-2-g2121ef1a2) 64-bit x86_64 linux
Parsing /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c
Converting
Type-checking popl20-bad-counter-queue2.wvr
Generating GOTO Program
Adding CPROVER library (x86_64)
file <builtin-library-pthread_create> line 20: warning: pointer parameter types differ between declaration and definition "pthread_create"
old definition in module popl20-bad-counter-queue2.wvr file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 22
signed int (pthread_t *, const pthread_attr_t *, void * (*)(void *), void *)
new definition in module <built-in-library> file <builtin-library-pthread_create> line 20
signed int (pthread_t *thread, const pthread_attr_t *attr, void * (*start_routine)(void *), void *arg)
Removal of function pointers and virtual functions
file <builtin-library-__spawned_thread> line 34 function __spawned_thread: replacing function pointer by 2 possible targets
Generic Property Instrumentation
Running with 8 object bits, 24 offset bits (default)
Starting Bounded Model Checking
[Warning][Unknown] Invalidating expressions: AddrOf(Var(N,
                                     NoOffset)) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:71:3)
[Warning][Unknown] Invalidating expressions: IndexPI(Lval(Var(arr, NoOffset)), Lval(Var(i, NoOffset))) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:92:5)
[Warning][Race] Memory location counter@popl20-bad-counter-queue2.wvr.c:42:5 (race with conf. 110):
  read with {thread:([thread1@/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:76:3, main], {})} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:51:5)
  read with {thread:([thread2@/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:77:3, main], {})} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:61:5)
  read with {thread:([main], {})} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:80:3)
  write with {thread:([thread1@/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:76:3, main], {})} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:51:5)
  write with {thread:([thread2@/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:77:3, main], {})} (conf. 110) (/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c:61:5)

Summary for all memory locations:
	safe:            3
	vulnerable:      0
	unsafe:          1
	-------------------
	total:           4
plus::b's upper bound is 0
minus::b's upper bound is 0
Use SV-COMP unwinding strategy: 3
Deagle's solver is set!!!!!!
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 0
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 0
Unwinding loop create_fresh_int_array.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 91 function create_fresh_int_array thread 0
Unwinding loop create_fresh_int_array.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 91 function create_fresh_int_array thread 0
Not unwinding loop create_fresh_int_array.0 iteration 3 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 91 function create_fresh_int_array thread 0
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 0
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
Unwinding loop thread1.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 49 function thread1 thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
Unwinding loop thread1.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 49 function thread1 thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 1
Not unwinding loop thread1.0 iteration 3 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 49 function thread1 thread 1
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
Unwinding loop thread2.0 iteration 1 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 59 function thread2 thread 2
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
Unwinding loop thread2.0 iteration 2 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 59 function thread2 thread 2
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
aborting path on assume(false) at file <builtin-library-abort> line 6 function abort thread 2
Not unwinding loop thread2.0 iteration 3 file /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c line 59 function thread2 thread 2
Handling datarace, passing the problem to goblint first
getcwd: /mnt/goblint-svcomp/benchexec/tools-pldi/deagle
/mnt/goblint-svcomp/benchexec/tools-pldi/deagle/goblint/goblint /mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c | tee goblint/goblint_output: 0
Lines where datarace may occur: 51 52 61 62 71 72 80 81 
The number of races before goblint filter: 72
The number of races after goblint filter: 18
Race categories: 4
	72(1) - 52(1) A:
		A#2 A#3
		A#2 A#5
		A#2 A#7
	72(1) - 62(1) A:
		A#2 A#9
		A#2 A#11
		A#2 A#13
	80(1) - 52(1) counter:
		counter#2 counter#6
		counter#2 counter#9
		counter#2 counter#12
		counter#3 counter#6
		counter#3 counter#9
		counter#3 counter#12
	80(1) - 62(1) counter:
		counter#2 counter#15
		counter#2 counter#18
		counter#2 counter#21
		counter#3 counter#15
		counter#3 counter#18
		counter#3 counter#21
Runtime Symex: 0.309415s
Adding SC constraints
Shared __CPROVER_threads_exited: 4R/3W
Shared __CPROVER_next_thread_id: 3R/3W
Shared A: 6R/2W
Shared counter: 8R/7W
Shared N: 6R/2W
Shared main::1::t1!0@1: 2R/2W
Shared main::1::t2!0@1: 2R/2W
Shared symex_dynamic::dynamic_object1: 6R/4W
size of program expression: 729 steps
no slicing due to threads
Generated 0 VCC(s), 0 remaining after simplification
Runtime Postprocess Equation: 0.00329497s
Passing problem to propositional reduction
converting SSA
Runtime Convert SSA: 0.00653086s
Set Deagle solver's graph
Running propositional reduction
Post-processing
Runtime Post-process: 0.00496796s
Solving with Deagle's Closure solver
17403 variables, 53160 clauses
ClosureSolver finishes with 35 conflicts, 115 decisions, and 21264 propagations. 79 theory propagations and 10 cycles included.
SAT checker: instance is UNSATISFIABLE
Runtime Solver: 0.0073634s
Runtime decision procedure: 0.0221715s

** Results:
/mnt/goblint-svcomp/benchexec/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c function main
[nodatarace.assertion.0] line 77 No data races on variable A between line 72 and line 52: SUCCESS
[nodatarace.assertion.1] line 77 No data races on variable A between line 72 and line 62: SUCCESS
[nodatarace.assertion.2] line 77 No data races on variable counter between line 80 and line 52: SUCCESS
[nodatarace.assertion.3] line 77 No data races on variable counter between line 80 and line 62: SUCCESS

** 0 of 4 failed (1 iterations)
VERIFICATION SUCCESSFUL
