./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:41:41,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:41:41,485 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:41:41,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:41:41,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:41:41,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:41:41,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:41:41,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:41:41,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:41:41,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:41:41,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:41:41,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:41:41,548 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:41:41,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:41:41,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:41:41,550 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:41:41,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:41:41,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:41:41,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:41:41,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:41:41,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:41:41,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:41:41,559 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:41:41,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:41:41,560 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:41:41,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:41:41,561 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:41:41,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:41:41,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:41:41,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:41:41,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:41,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:41:41,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:41:41,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:41:41,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:41:41,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:41:41,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:41:41,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:41:41,567 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:41:41,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:41:41,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:41:41,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b71c781c26c072fdf5838e0877462128517513c3df1f3bde9f2474cb4533ecb [2023-11-26 10:41:41,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:41:41,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:41:41,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:41:41,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:41:41,978 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:41:41,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2023-11-26 10:41:45,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:41:45,655 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:41:45,656 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/sv-benchmarks/c/pthread-atomic/read_write_lock-2b.i [2023-11-26 10:41:45,678 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/data/e260dfac6/3c8ea86a21aa43018250b545ce7732a2/FLAG419b4aae5 [2023-11-26 10:41:45,697 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/data/e260dfac6/3c8ea86a21aa43018250b545ce7732a2 [2023-11-26 10:41:45,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:41:45,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:41:45,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:45,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:41:45,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:41:45,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:45" (1/1) ... [2023-11-26 10:41:45,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e2c92a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:45, skipping insertion in model container [2023-11-26 10:41:45,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:41:45" (1/1) ... [2023-11-26 10:41:45,789 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:41:46,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:46,164 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:41:46,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:41:46,278 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:41:46,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46 WrapperNode [2023-11-26 10:41:46,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:41:46,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:46,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:41:46,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:41:46,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,373 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 168 [2023-11-26 10:41:46,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:41:46,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:41:46,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:41:46,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:41:46,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:41:46,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:41:46,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:41:46,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:41:46,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (1/1) ... [2023-11-26 10:41:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:41:46,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:41:46,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:41:46,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:41:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:41:46,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:41:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:41:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-26 10:41:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-26 10:41:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:41:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:41:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:41:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:41:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:41:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-26 10:41:46,516 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-26 10:41:46,518 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:41:46,671 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:41:46,674 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:41:47,127 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:41:47,221 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:41:47,221 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:41:47,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:47 BoogieIcfgContainer [2023-11-26 10:41:47,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:41:47,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:41:47,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:41:47,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:41:47,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:41:45" (1/3) ... [2023-11-26 10:41:47,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d54a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:47, skipping insertion in model container [2023-11-26 10:41:47,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:41:46" (2/3) ... [2023-11-26 10:41:47,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d54a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:41:47, skipping insertion in model container [2023-11-26 10:41:47,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:47" (3/3) ... [2023-11-26 10:41:47,235 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2b.i [2023-11-26 10:41:47,246 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:41:47,259 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:41:47,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-26 10:41:47,259 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:41:47,463 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-26 10:41:47,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 216 transitions, 460 flow [2023-11-26 10:41:47,653 INFO L124 PetriNetUnfolderBase]: 4/212 cut-off events. [2023-11-26 10:41:47,654 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:41:47,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 212 events. 4/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 451 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 163. Up to 2 conditions per place. [2023-11-26 10:41:47,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 216 transitions, 460 flow [2023-11-26 10:41:47,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 198 transitions, 417 flow [2023-11-26 10:41:47,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:41:47,707 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29689133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:41:47,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-26 10:41:47,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:41:47,716 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-11-26 10:41:47,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:41:47,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:47,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:47,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:41:47,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1833587175, now seen corresponding path program 1 times [2023-11-26 10:41:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007350281] [2023-11-26 10:41:47,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:47,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007350281] [2023-11-26 10:41:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007350281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:41:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521265007] [2023-11-26 10:41:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:48,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:41:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:41:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:41:48,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 216 [2023-11-26 10:41:48,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 198 transitions, 417 flow. Second operand has 2 states, 2 states have (on average 187.0) internal successors, (374), 2 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:48,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 216 [2023-11-26 10:41:48,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:48,477 INFO L124 PetriNetUnfolderBase]: 51/884 cut-off events. [2023-11-26 10:41:48,477 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-26 10:41:48,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 884 events. 51/884 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5664 event pairs, 51 based on Foata normal form. 38/766 useless extension candidates. Maximal degree in co-relation 883. Up to 96 conditions per place. [2023-11-26 10:41:48,497 INFO L140 encePairwiseOnDemand]: 200/216 looper letters, 11 selfloop transitions, 0 changer transitions 0/176 dead transitions. [2023-11-26 10:41:48,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 176 transitions, 395 flow [2023-11-26 10:41:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:41:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:41:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 399 transitions. [2023-11-26 10:41:48,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9236111111111112 [2023-11-26 10:41:48,521 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 399 transitions. [2023-11-26 10:41:48,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 399 transitions. [2023-11-26 10:41:48,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:48,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 399 transitions. [2023-11-26 10:41:48,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,547 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,549 INFO L175 Difference]: Start difference. First operand has 207 places, 198 transitions, 417 flow. Second operand 2 states and 399 transitions. [2023-11-26 10:41:48,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 176 transitions, 395 flow [2023-11-26 10:41:48,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-26 10:41:48,563 INFO L231 Difference]: Finished difference. Result has 183 places, 176 transitions, 360 flow [2023-11-26 10:41:48,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=183, PETRI_TRANSITIONS=176} [2023-11-26 10:41:48,571 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -24 predicate places. [2023-11-26 10:41:48,572 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 176 transitions, 360 flow [2023-11-26 10:41:48,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 187.0) internal successors, (374), 2 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:48,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:48,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:41:48,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:41:48,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:48,575 INFO L85 PathProgramCache]: Analyzing trace with hash -961952738, now seen corresponding path program 1 times [2023-11-26 10:41:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:48,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020447551] [2023-11-26 10:41:48,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:48,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020447551] [2023-11-26 10:41:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020447551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:48,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:48,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288418932] [2023-11-26 10:41:48,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:48,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:48,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:48,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-11-26 10:41:48,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:48,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:48,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-11-26 10:41:48,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:50,390 INFO L124 PetriNetUnfolderBase]: 1206/6432 cut-off events. [2023-11-26 10:41:50,390 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-26 10:41:50,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8474 conditions, 6432 events. 1206/6432 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 71318 event pairs, 825 based on Foata normal form. 0/5194 useless extension candidates. Maximal degree in co-relation 8471. Up to 1501 conditions per place. [2023-11-26 10:41:50,505 INFO L140 encePairwiseOnDemand]: 207/216 looper letters, 26 selfloop transitions, 8 changer transitions 0/189 dead transitions. [2023-11-26 10:41:50,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 189 transitions, 458 flow [2023-11-26 10:41:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-11-26 10:41:50,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8688271604938271 [2023-11-26 10:41:50,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-11-26 10:41:50,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-11-26 10:41:50,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:50,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-11-26 10:41:50,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:50,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:50,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:50,524 INFO L175 Difference]: Start difference. First operand has 183 places, 176 transitions, 360 flow. Second operand 3 states and 563 transitions. [2023-11-26 10:41:50,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 189 transitions, 458 flow [2023-11-26 10:41:50,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 189 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:41:50,536 INFO L231 Difference]: Finished difference. Result has 187 places, 183 transitions, 422 flow [2023-11-26 10:41:50,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=187, PETRI_TRANSITIONS=183} [2023-11-26 10:41:50,538 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -20 predicate places. [2023-11-26 10:41:50,538 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 183 transitions, 422 flow [2023-11-26 10:41:50,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:50,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:50,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:50,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:41:50,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:41:50,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1021328312, now seen corresponding path program 1 times [2023-11-26 10:41:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:50,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756129549] [2023-11-26 10:41:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:50,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756129549] [2023-11-26 10:41:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756129549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:50,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:50,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603661764] [2023-11-26 10:41:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:50,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:50,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2023-11-26 10:41:50,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 183 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:50,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:50,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2023-11-26 10:41:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:52,152 INFO L124 PetriNetUnfolderBase]: 846/6698 cut-off events. [2023-11-26 10:41:52,153 INFO L125 PetriNetUnfolderBase]: For 175/228 co-relation queries the response was YES. [2023-11-26 10:41:52,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8669 conditions, 6698 events. 846/6698 cut-off events. For 175/228 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 79931 event pairs, 528 based on Foata normal form. 2/5338 useless extension candidates. Maximal degree in co-relation 8664. Up to 821 conditions per place. [2023-11-26 10:41:52,276 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 19 selfloop transitions, 7 changer transitions 0/192 dead transitions. [2023-11-26 10:41:52,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 192 transitions, 496 flow [2023-11-26 10:41:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-11-26 10:41:52,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875 [2023-11-26 10:41:52,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-11-26 10:41:52,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-11-26 10:41:52,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:52,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-11-26 10:41:52,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:52,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:52,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:52,290 INFO L175 Difference]: Start difference. First operand has 187 places, 183 transitions, 422 flow. Second operand 3 states and 567 transitions. [2023-11-26 10:41:52,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 192 transitions, 496 flow [2023-11-26 10:41:52,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 192 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:52,306 INFO L231 Difference]: Finished difference. Result has 189 places, 189 transitions, 460 flow [2023-11-26 10:41:52,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=189, PETRI_TRANSITIONS=189} [2023-11-26 10:41:52,308 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -18 predicate places. [2023-11-26 10:41:52,309 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 189 transitions, 460 flow [2023-11-26 10:41:52,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:52,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:52,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:41:52,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:41:52,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 142273567, now seen corresponding path program 1 times [2023-11-26 10:41:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510175901] [2023-11-26 10:41:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510175901] [2023-11-26 10:41:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510175901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:41:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649176331] [2023-11-26 10:41:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:41:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:41:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:41:52,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 216 [2023-11-26 10:41:52,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 189 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:52,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:52,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 216 [2023-11-26 10:41:52,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:41:58,160 INFO L124 PetriNetUnfolderBase]: 7346/32738 cut-off events. [2023-11-26 10:41:58,161 INFO L125 PetriNetUnfolderBase]: For 6803/8092 co-relation queries the response was YES. [2023-11-26 10:41:58,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52991 conditions, 32738 events. 7346/32738 cut-off events. For 6803/8092 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 473789 event pairs, 2151 based on Foata normal form. 38/26642 useless extension candidates. Maximal degree in co-relation 52985. Up to 6420 conditions per place. [2023-11-26 10:41:58,803 INFO L140 encePairwiseOnDemand]: 202/216 looper letters, 45 selfloop transitions, 15 changer transitions 0/216 dead transitions. [2023-11-26 10:41:58,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 216 transitions, 680 flow [2023-11-26 10:41:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:41:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:41:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-26 10:41:58,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2023-11-26 10:41:58,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-26 10:41:58,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-26 10:41:58,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:41:58,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-26 10:41:58,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:58,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:58,814 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:58,814 INFO L175 Difference]: Start difference. First operand has 189 places, 189 transitions, 460 flow. Second operand 3 states and 564 transitions. [2023-11-26 10:41:58,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 216 transitions, 680 flow [2023-11-26 10:41:58,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 216 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:41:58,849 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 596 flow [2023-11-26 10:41:58,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2023-11-26 10:41:58,852 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -16 predicate places. [2023-11-26 10:41:58,852 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 596 flow [2023-11-26 10:41:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:58,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:41:58,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:41:58,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:41:58,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:41:58,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:41:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 654782796, now seen corresponding path program 1 times [2023-11-26 10:41:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:41:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062914184] [2023-11-26 10:41:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:41:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:41:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:41:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:41:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:41:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062914184] [2023-11-26 10:41:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062914184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:41:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:41:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:41:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612206857] [2023-11-26 10:41:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:41:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:41:59,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:41:59,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:41:59,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:41:59,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2023-11-26 10:41:59,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 596 flow. Second operand has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:41:59,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:41:59,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2023-11-26 10:41:59,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:06,651 INFO L124 PetriNetUnfolderBase]: 10227/46861 cut-off events. [2023-11-26 10:42:06,651 INFO L125 PetriNetUnfolderBase]: For 12378/18283 co-relation queries the response was YES. [2023-11-26 10:42:06,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78087 conditions, 46861 events. 10227/46861 cut-off events. For 12378/18283 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 720511 event pairs, 2393 based on Foata normal form. 70/38780 useless extension candidates. Maximal degree in co-relation 78080. Up to 6188 conditions per place. [2023-11-26 10:42:07,356 INFO L140 encePairwiseOnDemand]: 206/216 looper letters, 31 selfloop transitions, 17 changer transitions 0/232 dead transitions. [2023-11-26 10:42:07,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 232 transitions, 781 flow [2023-11-26 10:42:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:42:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:42:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 945 transitions. [2023-11-26 10:42:07,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875 [2023-11-26 10:42:07,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 945 transitions. [2023-11-26 10:42:07,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 945 transitions. [2023-11-26 10:42:07,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:07,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 945 transitions. [2023-11-26 10:42:07,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:07,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:07,373 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:07,373 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 596 flow. Second operand 5 states and 945 transitions. [2023-11-26 10:42:07,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 232 transitions, 781 flow [2023-11-26 10:42:07,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 232 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:07,417 INFO L231 Difference]: Finished difference. Result has 196 places, 218 transitions, 689 flow [2023-11-26 10:42:07,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=196, PETRI_TRANSITIONS=218} [2023-11-26 10:42:07,421 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -11 predicate places. [2023-11-26 10:42:07,421 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 689 flow [2023-11-26 10:42:07,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 181.2) internal successors, (906), 5 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:07,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:07,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:07,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:42:07,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:42:07,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2027329442, now seen corresponding path program 2 times [2023-11-26 10:42:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661377803] [2023-11-26 10:42:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:07,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:07,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661377803] [2023-11-26 10:42:07,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661377803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:07,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:42:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974757118] [2023-11-26 10:42:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:07,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:07,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:07,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2023-11-26 10:42:07,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:07,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:07,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2023-11-26 10:42:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:10,815 INFO L124 PetriNetUnfolderBase]: 2580/18703 cut-off events. [2023-11-26 10:42:10,816 INFO L125 PetriNetUnfolderBase]: For 4201/4951 co-relation queries the response was YES. [2023-11-26 10:42:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29162 conditions, 18703 events. 2580/18703 cut-off events. For 4201/4951 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 266789 event pairs, 740 based on Foata normal form. 124/15416 useless extension candidates. Maximal degree in co-relation 29153. Up to 2615 conditions per place. [2023-11-26 10:42:11,092 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 19 selfloop transitions, 7 changer transitions 0/213 dead transitions. [2023-11-26 10:42:11,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 213 transitions, 699 flow [2023-11-26 10:42:11,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 572 transitions. [2023-11-26 10:42:11,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2023-11-26 10:42:11,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 572 transitions. [2023-11-26 10:42:11,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 572 transitions. [2023-11-26 10:42:11,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:11,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 572 transitions. [2023-11-26 10:42:11,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:11,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:11,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:11,105 INFO L175 Difference]: Start difference. First operand has 196 places, 218 transitions, 689 flow. Second operand 3 states and 572 transitions. [2023-11-26 10:42:11,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 213 transitions, 699 flow [2023-11-26 10:42:11,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 213 transitions, 685 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:11,121 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 631 flow [2023-11-26 10:42:11,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2023-11-26 10:42:11,125 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -10 predicate places. [2023-11-26 10:42:11,125 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 631 flow [2023-11-26 10:42:11,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:11,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:11,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:11,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:42:11,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:42:11,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1023131579, now seen corresponding path program 1 times [2023-11-26 10:42:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:11,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074709533] [2023-11-26 10:42:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074709533] [2023-11-26 10:42:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074709533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:11,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341233149] [2023-11-26 10:42:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:11,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2023-11-26 10:42:11,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:11,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:11,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2023-11-26 10:42:11,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:15,823 INFO L124 PetriNetUnfolderBase]: 5696/32229 cut-off events. [2023-11-26 10:42:15,823 INFO L125 PetriNetUnfolderBase]: For 12391/13563 co-relation queries the response was YES. [2023-11-26 10:42:16,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54606 conditions, 32229 events. 5696/32229 cut-off events. For 12391/13563 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 491346 event pairs, 2140 based on Foata normal form. 3/26222 useless extension candidates. Maximal degree in co-relation 54597. Up to 3938 conditions per place. [2023-11-26 10:42:16,204 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 33 selfloop transitions, 5 changer transitions 0/220 dead transitions. [2023-11-26 10:42:16,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 220 transitions, 761 flow [2023-11-26 10:42:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-26 10:42:16,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2023-11-26 10:42:16,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-26 10:42:16,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-26 10:42:16,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:16,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-26 10:42:16,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:16,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:16,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:16,215 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 631 flow. Second operand 3 states and 564 transitions. [2023-11-26 10:42:16,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 220 transitions, 761 flow [2023-11-26 10:42:16,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 220 transitions, 741 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:16,240 INFO L231 Difference]: Finished difference. Result has 199 places, 212 transitions, 655 flow [2023-11-26 10:42:16,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=199, PETRI_TRANSITIONS=212} [2023-11-26 10:42:16,241 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -8 predicate places. [2023-11-26 10:42:16,241 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 212 transitions, 655 flow [2023-11-26 10:42:16,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:16,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:16,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:16,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:42:16,245 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:42:16,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1214123678, now seen corresponding path program 1 times [2023-11-26 10:42:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172940824] [2023-11-26 10:42:16,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:16,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:16,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172940824] [2023-11-26 10:42:16,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172940824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848684485] [2023-11-26 10:42:16,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:16,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 216 [2023-11-26 10:42:16,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 212 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:16,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:16,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 216 [2023-11-26 10:42:16,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:22,891 INFO L124 PetriNetUnfolderBase]: 6966/41333 cut-off events. [2023-11-26 10:42:22,891 INFO L125 PetriNetUnfolderBase]: For 17662/22469 co-relation queries the response was YES. [2023-11-26 10:42:23,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72246 conditions, 41333 events. 6966/41333 cut-off events. For 17662/22469 co-relation queries the response was YES. Maximal size of possible extension queue 1791. Compared 663353 event pairs, 2442 based on Foata normal form. 115/34051 useless extension candidates. Maximal degree in co-relation 72236. Up to 6960 conditions per place. [2023-11-26 10:42:23,721 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 43 selfloop transitions, 12 changer transitions 0/225 dead transitions. [2023-11-26 10:42:23,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 225 transitions, 827 flow [2023-11-26 10:42:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-26 10:42:23,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8626543209876543 [2023-11-26 10:42:23,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-26 10:42:23,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-26 10:42:23,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:23,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-26 10:42:23,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:23,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:23,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:23,730 INFO L175 Difference]: Start difference. First operand has 199 places, 212 transitions, 655 flow. Second operand 3 states and 559 transitions. [2023-11-26 10:42:23,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 225 transitions, 827 flow [2023-11-26 10:42:23,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 225 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:23,906 INFO L231 Difference]: Finished difference. Result has 201 places, 222 transitions, 767 flow [2023-11-26 10:42:23,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=201, PETRI_TRANSITIONS=222} [2023-11-26 10:42:23,908 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-26 10:42:23,908 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 767 flow [2023-11-26 10:42:23,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:23,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:23,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:23,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:42:23,910 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr5ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:42:23,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1269524252, now seen corresponding path program 1 times [2023-11-26 10:42:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:23,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121437621] [2023-11-26 10:42:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121437621] [2023-11-26 10:42:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121437621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:23,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441349788] [2023-11-26 10:42:23,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:23,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:24,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 216 [2023-11-26 10:42:24,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:24,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:24,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 216 [2023-11-26 10:42:24,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:28,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][212], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 9#L699-3true, 122#L718-4true, 276#(= |#race~y~0| 0), 134#L700-1true, Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:28,095 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-26 10:42:28,095 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 10:42:28,095 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 10:42:28,095 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 10:42:28,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 52#L700-1true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:28,808 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,808 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,808 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,809 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 24#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), 134#L700-1true, Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:28,849 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,849 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,849 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,850 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-26 10:42:28,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][212], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 9#L699-3true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 40#L700-3true, 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:28,896 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-26 10:42:28,897 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 10:42:28,897 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 10:42:28,897 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 10:42:29,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][211], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 35#L699-3true, 228#true, 121#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,027 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,027 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,028 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,028 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 193#L700-3true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,292 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,292 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,292 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,292 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 24#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, 40#L700-3true, Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,393 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,393 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,393 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,393 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:42:29,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, 125#L700-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,518 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,519 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,519 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,519 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), 97#L708-3true, Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, 121#writerErr4ASSERT_VIOLATIONDATA_RACEtrue, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,563 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,563 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,563 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,564 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:42:29,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 114#L701true, 122#L718-4true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:29,776 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-26 10:42:29,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:42:29,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:42:29,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:42:31,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L708-2-->L708-3: Formula: (= |v_#race~x~0_4| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][151], [readerThread1of1ForFork0InUse, Black: 252#(and (= ~r~0 0) (= ~w~0 0)), 18#L700true, 192#L719-7true, 276#(= |#race~y~0| 0), Black: 264#(= |#race~y~0| |readerThread1of1ForFork1_#t~nondet8#1|), Black: 233#(= |writerThread1of1ForFork3_#t~nondet6#1| |#race~x~0|), 97#L708-3true, 95#L708-4true, Black: 239#(= |writerThread1of1ForFork3_#t~nondet7#1| |#race~w~0|), Black: 270#(= |writerThread1of1ForFork2_#t~nondet6#1| |#race~x~0|), 268#true, Black: 243#true, 228#true, Black: 253#(and (<= 1 ~r~0) (= ~w~0 0))]) [2023-11-26 10:42:31,795 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-26 10:42:31,795 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 10:42:31,795 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 10:42:31,796 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 10:42:32,707 INFO L124 PetriNetUnfolderBase]: 9140/54896 cut-off events. [2023-11-26 10:42:32,707 INFO L125 PetriNetUnfolderBase]: For 29217/32551 co-relation queries the response was YES. [2023-11-26 10:42:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100021 conditions, 54896 events. 9140/54896 cut-off events. For 29217/32551 co-relation queries the response was YES. Maximal size of possible extension queue 2493. Compared 921638 event pairs, 1959 based on Foata normal form. 246/46351 useless extension candidates. Maximal degree in co-relation 100010. Up to 7248 conditions per place. [2023-11-26 10:42:33,311 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 39 selfloop transitions, 7 changer transitions 0/240 dead transitions. [2023-11-26 10:42:33,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 240 transitions, 937 flow [2023-11-26 10:42:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-26 10:42:33,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2023-11-26 10:42:33,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-26 10:42:33,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-26 10:42:33,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:33,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-26 10:42:33,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:33,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:33,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:33,321 INFO L175 Difference]: Start difference. First operand has 201 places, 222 transitions, 767 flow. Second operand 3 states and 570 transitions. [2023-11-26 10:42:33,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 240 transitions, 937 flow [2023-11-26 10:42:33,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 240 transitions, 897 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:33,417 INFO L231 Difference]: Finished difference. Result has 203 places, 228 transitions, 789 flow [2023-11-26 10:42:33,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=203, PETRI_TRANSITIONS=228} [2023-11-26 10:42:33,418 INFO L281 CegarLoopForPetriNet]: 207 programPoint places, -4 predicate places. [2023-11-26 10:42:33,419 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 228 transitions, 789 flow [2023-11-26 10:42:33,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:33,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:33,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:33,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:42:33,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writerErr4ASSERT_VIOLATIONDATA_RACE === [readerErr0ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2023-11-26 10:42:33,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 8790168, now seen corresponding path program 1 times [2023-11-26 10:42:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198892103] [2023-11-26 10:42:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:42:33,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:42:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:42:33,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:42:33,517 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:42:33,519 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writerErr4ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2023-11-26 10:42:33,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2023-11-26 10:42:33,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2023-11-26 10:42:33,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2023-11-26 10:42:33,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2023-11-26 10:42:33,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2023-11-26 10:42:33,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2023-11-26 10:42:33,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2023-11-26 10:42:33,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2023-11-26 10:42:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2023-11-26 10:42:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2023-11-26 10:42:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2023-11-26 10:42:33,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2023-11-26 10:42:33,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2023-11-26 10:42:33,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 50 remaining) [2023-11-26 10:42:33,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 50 remaining) [2023-11-26 10:42:33,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 50 remaining) [2023-11-26 10:42:33,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 50 remaining) [2023-11-26 10:42:33,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2023-11-26 10:42:33,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2023-11-26 10:42:33,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2023-11-26 10:42:33,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2023-11-26 10:42:33,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2023-11-26 10:42:33,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2023-11-26 10:42:33,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2023-11-26 10:42:33,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2023-11-26 10:42:33,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2023-11-26 10:42:33,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2023-11-26 10:42:33,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2023-11-26 10:42:33,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2023-11-26 10:42:33,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (19 of 50 remaining) [2023-11-26 10:42:33,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (18 of 50 remaining) [2023-11-26 10:42:33,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2023-11-26 10:42:33,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2023-11-26 10:42:33,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2023-11-26 10:42:33,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2023-11-26 10:42:33,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2023-11-26 10:42:33,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2023-11-26 10:42:33,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2023-11-26 10:42:33,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2023-11-26 10:42:33,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2023-11-26 10:42:33,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2023-11-26 10:42:33,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2023-11-26 10:42:33,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2023-11-26 10:42:33,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2023-11-26 10:42:33,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2023-11-26 10:42:33,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr1ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2023-11-26 10:42:33,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2023-11-26 10:42:33,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr3ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2023-11-26 10:42:33,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2023-11-26 10:42:33,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:42:33,547 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:33,556 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:42:33,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:42:33,604 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-26 10:42:33,606 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-26 10:42:33,607 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:42:33,608 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:42:33,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:42:33 BasicIcfg [2023-11-26 10:42:33,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:42:33,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:42:33,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:42:33,620 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:42:33,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:41:47" (3/4) ... [2023-11-26 10:42:33,625 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:42:33,626 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:42:33,627 INFO L158 Benchmark]: Toolchain (without parser) took 47925.11ms. Allocated memory was 209.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 167.1MB in the beginning and 10.6GB in the end (delta: -10.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-11-26 10:42:33,627 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:42:33,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.40ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 146.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 10:42:33,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.26ms. Allocated memory is still 209.7MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:42:33,629 INFO L158 Benchmark]: Boogie Preprocessor took 42.87ms. Allocated memory is still 209.7MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:42:33,629 INFO L158 Benchmark]: RCFGBuilder took 805.09ms. Allocated memory is still 209.7MB. Free memory was 142.2MB in the beginning and 116.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-26 10:42:33,630 INFO L158 Benchmark]: TraceAbstraction took 46392.14ms. Allocated memory was 209.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 115.8MB in the beginning and 10.6GB in the end (delta: -10.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-11-26 10:42:33,630 INFO L158 Benchmark]: Witness Printer took 6.65ms. Allocated memory is still 12.5GB. Free memory is still 10.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:42:33,633 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 209.7MB. Free memory is still 186.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.40ms. Allocated memory is still 209.7MB. Free memory was 167.1MB in the beginning and 146.9MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.26ms. Allocated memory is still 209.7MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.87ms. Allocated memory is still 209.7MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 805.09ms. Allocated memory is still 209.7MB. Free memory was 142.2MB in the beginning and 116.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 46392.14ms. Allocated memory was 209.7MB in the beginning and 12.5GB in the end (delta: 12.3GB). Free memory was 115.8MB in the beginning and 10.6GB in the end (delta: -10.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 6.65ms. Allocated memory is still 12.5GB. Free memory is still 10.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 700]: Data race detected [2023-11-26 10:42:33,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-26 10:42:33,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-26 10:42:33,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:42:33,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:42:33,691 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre10 could not be translated [2023-11-26 10:42:33,691 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre12 could not be translated [2023-11-26 10:42:33,692 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-26 10:42:33,693 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated Data race detected The following path leads to a data race: [L688] 0 int w=0, r=0, x, y; VAL [r=0, w=0, x=0, y=0] [L714] 0 pthread_t t1, t2, t3, t4; VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L715] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L716] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1={5:0}, t2={6:0}, t3={7:0}, t4={3:0}, w=0, x=0, y=0] [L698] CALL 1 __VERIFIER_atomic_take_write_lock() [L690] EXPR 1 w==0 [L690] EXPR 1 w==0 && r==0 [L690] EXPR 1 r==0 [L690] EXPR 1 w==0 && r==0 [L690] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L690] RET 1 assume_abort_if_not(w==0 && r==0) [L691] 1 w = 1 [L698] RET 1 __VERIFIER_atomic_take_write_lock() [L704] 2 int l; VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=0, y=0] [L699] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=0, w=0, x=3, y=0] [L705] CALL 2 __VERIFIER_atomic_take_read_lock() [L694] EXPR 2 w==0 [L694] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L694] RET 2 assume_abort_if_not(w==0) [L695] EXPR 2 r+1 [L695] 2 r = r+1 [L705] RET 2 __VERIFIER_atomic_take_read_lock() [L700] 1 w = 0 VAL [arg={0:0}, arg={0:0}, r=1, w=0, x=3, y=0] Now there is a data race on ~w~0 between C: w==0 [694] and C: w = 0 [700] - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 279 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 46.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 44.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 52 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=9, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 10:42:33,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80f12369-e0ab-4ab8-ba79-1a49e19e4e3f/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE