./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/value-barrier.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/value-barrier.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU --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 9505ed5f8cb529ff677183820383a10d5f80642bbeb6c66e57949c4f3e3fe6f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:02:44,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:02:44,268 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:02:44,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:02:44,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:02:44,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:02:44,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:02:44,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:02:44,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:02:44,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:02:44,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:02:44,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:02:44,316 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:02:44,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:02:44,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:02:44,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:02:44,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:02:44,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:02:44,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:02:44,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:02:44,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:02:44,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:02:44,326 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:02:44,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:02:44,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:02:44,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:02:44,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:02:44,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:02:44,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:02:44,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:02:44,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:02:44,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:44,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:02:44,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:02:44,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:02:44,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:02:44,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:02:44,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:02:44,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:02:44,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:02:44,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:02:44,334 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_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/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_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 9505ed5f8cb529ff677183820383a10d5f80642bbeb6c66e57949c4f3e3fe6f9 [2024-10-31 22:02:44,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:02:44,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:02:44,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:02:44,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:02:44,644 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:02:44,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/value-barrier.i Unable to find full path for "g++" [2024-10-31 22:02:46,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:02:47,177 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:02:47,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/sv-benchmarks/c/pthread-race-challenges/value-barrier.i [2024-10-31 22:02:47,219 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/data/bde590ae0/0942ef15efff4753ba7bb6b28d40a466/FLAG165a088ef [2024-10-31 22:02:47,400 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/data/bde590ae0/0942ef15efff4753ba7bb6b28d40a466 [2024-10-31 22:02:47,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:02:47,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:02:47,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:47,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:02:47,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:02:47,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:47" (1/1) ... [2024-10-31 22:02:47,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4af58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:47, skipping insertion in model container [2024-10-31 22:02:47,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:02:47" (1/1) ... [2024-10-31 22:02:47,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:02:48,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:48,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:02:48,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:02:48,363 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:02:48,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48 WrapperNode [2024-10-31 22:02:48,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:02:48,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:48,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:02:48,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:02:48,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,444 INFO L138 Inliner]: procedures = 265, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 201 [2024-10-31 22:02:48,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:02:48,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:02:48,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:02:48,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:02:48,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:02:48,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:02:48,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:02:48,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:02:48,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (1/1) ... [2024-10-31 22:02:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:02:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:48,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:02:48,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317f16ac-a3cf-4b89-bed6-10380c9d233d/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:02:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:02:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:02:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:02:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:02:48,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:02:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:02:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:02:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:02:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 22:02:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 22:02:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:02:48,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:02:48,562 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:02:48,890 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:02:48,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:02:49,342 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:02:49,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:02:49,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:02:49,420 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 22:02:49,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:49 BoogieIcfgContainer [2024-10-31 22:02:49,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:02:49,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:02:49,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:02:49,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:02:49,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:02:47" (1/3) ... [2024-10-31 22:02:49,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eb3aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:49, skipping insertion in model container [2024-10-31 22:02:49,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:02:48" (2/3) ... [2024-10-31 22:02:49,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35eb3aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:02:49, skipping insertion in model container [2024-10-31 22:02:49,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:02:49" (3/3) ... [2024-10-31 22:02:49,434 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier.i [2024-10-31 22:02:49,457 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:02:49,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-31 22:02:49,457 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:02:49,557 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-31 22:02:49,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 229 transitions, 465 flow [2024-10-31 22:02:49,734 INFO L124 PetriNetUnfolderBase]: 8/279 cut-off events. [2024-10-31 22:02:49,734 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:02:49,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 279 events. 8/279 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 291 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 197. Up to 4 conditions per place. [2024-10-31 22:02:49,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 229 transitions, 465 flow [2024-10-31 22:02:49,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 229 transitions, 465 flow [2024-10-31 22:02:49,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:49,782 INFO L333 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, 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;@47574eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:49,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-31 22:02:49,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:02:49,829 INFO L124 PetriNetUnfolderBase]: 2/163 cut-off events. [2024-10-31 22:02:49,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:49,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:49,830 INFO L204 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, 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, 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, 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] [2024-10-31 22:02:49,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:49,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -221141896, now seen corresponding path program 1 times [2024-10-31 22:02:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:49,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857786002] [2024-10-31 22:02:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857786002] [2024-10-31 22:02:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857786002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473133023] [2024-10-31 22:02:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:50,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:50,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:50,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 229 [2024-10-31 22:02:50,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 229 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2024-10-31 22:02:50,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:50,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 229 [2024-10-31 22:02:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:50,932 INFO L124 PetriNetUnfolderBase]: 41/427 cut-off events. [2024-10-31 22:02:50,932 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:02:50,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 427 events. 41/427 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1202 event pairs, 21 based on Foata normal form. 21/402 useless extension candidates. Maximal degree in co-relation 311. Up to 69 conditions per place. [2024-10-31 22:02:50,938 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 19 selfloop transitions, 4 changer transitions 1/232 dead transitions. [2024-10-31 22:02:50,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 232 transitions, 517 flow [2024-10-31 22:02:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-10-31 22:02:50,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548762736535662 [2024-10-31 22:02:50,965 INFO L175 Difference]: Start difference. First operand has 226 places, 229 transitions, 465 flow. Second operand 3 states and 656 transitions. [2024-10-31 22:02:50,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 232 transitions, 517 flow [2024-10-31 22:02:50,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 232 transitions, 517 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:02:50,980 INFO L231 Difference]: Finished difference. Result has 230 places, 227 transitions, 485 flow [2024-10-31 22:02:50,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=230, PETRI_TRANSITIONS=227} [2024-10-31 22:02:50,988 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 4 predicate places. [2024-10-31 22:02:50,988 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 227 transitions, 485 flow [2024-10-31 22:02:50,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2024-10-31 22:02:50,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:50,991 INFO L204 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, 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, 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, 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] [2024-10-31 22:02:50,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:02:50,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:50,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1462144222, now seen corresponding path program 1 times [2024-10-31 22:02:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416296091] [2024-10-31 22:02:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:52,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416296091] [2024-10-31 22:02:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416296091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:52,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598198292] [2024-10-31 22:02:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:02:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:02:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:02:52,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 229 [2024-10-31 22:02:52,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 227 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 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) [2024-10-31 22:02:52,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:52,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 229 [2024-10-31 22:02:52,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:52,917 INFO L124 PetriNetUnfolderBase]: 100/615 cut-off events. [2024-10-31 22:02:52,917 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-31 22:02:52,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 615 events. 100/615 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2477 event pairs, 34 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 629. Up to 134 conditions per place. [2024-10-31 22:02:52,925 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 36 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2024-10-31 22:02:52,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 242 transitions, 597 flow [2024-10-31 22:02:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:02:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:02:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1236 transitions. [2024-10-31 22:02:52,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8995633187772926 [2024-10-31 22:02:52,931 INFO L175 Difference]: Start difference. First operand has 230 places, 227 transitions, 485 flow. Second operand 6 states and 1236 transitions. [2024-10-31 22:02:52,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 242 transitions, 597 flow [2024-10-31 22:02:52,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 242 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:52,943 INFO L231 Difference]: Finished difference. Result has 231 places, 226 transitions, 485 flow [2024-10-31 22:02:52,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=231, PETRI_TRANSITIONS=226} [2024-10-31 22:02:52,945 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 5 predicate places. [2024-10-31 22:02:52,945 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 226 transitions, 485 flow [2024-10-31 22:02:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.5) internal successors, (1203), 6 states have internal predecessors, (1203), 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) [2024-10-31 22:02:52,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:52,946 INFO L204 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, 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, 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, 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, 1] [2024-10-31 22:02:52,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:02:52,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 887545330, now seen corresponding path program 1 times [2024-10-31 22:02:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393442178] [2024-10-31 22:02:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:53,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393442178] [2024-10-31 22:02:53,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393442178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692372631] [2024-10-31 22:02:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:53,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:53,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:53,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 229 [2024-10-31 22:02:53,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 226 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-10-31 22:02:53,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:53,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 229 [2024-10-31 22:02:53,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:53,226 INFO L124 PetriNetUnfolderBase]: 31/477 cut-off events. [2024-10-31 22:02:53,226 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-31 22:02:53,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 477 events. 31/477 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1548 event pairs, 5 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 361. Up to 37 conditions per place. [2024-10-31 22:02:53,230 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 18 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2024-10-31 22:02:53,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 235 transitions, 548 flow [2024-10-31 22:02:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:53,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-10-31 22:02:53,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621542940320232 [2024-10-31 22:02:53,234 INFO L175 Difference]: Start difference. First operand has 231 places, 226 transitions, 485 flow. Second operand 3 states and 661 transitions. [2024-10-31 22:02:53,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 235 transitions, 548 flow [2024-10-31 22:02:53,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 235 transitions, 538 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:02:53,242 INFO L231 Difference]: Finished difference. Result has 230 places, 229 transitions, 501 flow [2024-10-31 22:02:53,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=230, PETRI_TRANSITIONS=229} [2024-10-31 22:02:53,244 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 4 predicate places. [2024-10-31 22:02:53,244 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 229 transitions, 501 flow [2024-10-31 22:02:53,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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) [2024-10-31 22:02:53,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:53,245 INFO L204 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, 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, 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, 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, 1] [2024-10-31 22:02:53,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:02:53,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:53,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash -234433163, now seen corresponding path program 1 times [2024-10-31 22:02:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383136258] [2024-10-31 22:02:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383136258] [2024-10-31 22:02:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383136258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:53,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298775352] [2024-10-31 22:02:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:53,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:53,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 229 [2024-10-31 22:02:53,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 229 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2024-10-31 22:02:53,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:53,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 229 [2024-10-31 22:02:53,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:53,501 INFO L124 PetriNetUnfolderBase]: 83/667 cut-off events. [2024-10-31 22:02:53,501 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-10-31 22:02:53,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 667 events. 83/667 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2996 event pairs, 37 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 689. Up to 136 conditions per place. [2024-10-31 22:02:53,505 INFO L140 encePairwiseOnDemand]: 224/229 looper letters, 20 selfloop transitions, 6 changer transitions 0/237 dead transitions. [2024-10-31 22:02:53,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 237 transitions, 575 flow [2024-10-31 22:02:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-10-31 22:02:53,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9475982532751092 [2024-10-31 22:02:53,508 INFO L175 Difference]: Start difference. First operand has 230 places, 229 transitions, 501 flow. Second operand 3 states and 651 transitions. [2024-10-31 22:02:53,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 237 transitions, 575 flow [2024-10-31 22:02:53,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 237 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:53,514 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 541 flow [2024-10-31 22:02:53,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-10-31 22:02:53,515 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 6 predicate places. [2024-10-31 22:02:53,515 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 541 flow [2024-10-31 22:02:53,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2024-10-31 22:02:53,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:53,517 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:53,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:02:53,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -970521253, now seen corresponding path program 1 times [2024-10-31 22:02:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526215743] [2024-10-31 22:02:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:53,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526215743] [2024-10-31 22:02:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526215743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704492595] [2024-10-31 22:02:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:53,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:53,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 229 [2024-10-31 22:02:53,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2024-10-31 22:02:53,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:53,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 229 [2024-10-31 22:02:53,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:53,757 INFO L124 PetriNetUnfolderBase]: 54/584 cut-off events. [2024-10-31 22:02:53,757 INFO L125 PetriNetUnfolderBase]: For 75/86 co-relation queries the response was YES. [2024-10-31 22:02:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 584 events. 54/584 cut-off events. For 75/86 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2237 event pairs, 18 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 572. Up to 73 conditions per place. [2024-10-31 22:02:53,760 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 14 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2024-10-31 22:02:53,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 238 transitions, 592 flow [2024-10-31 22:02:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2024-10-31 22:02:53,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563318777292577 [2024-10-31 22:02:53,763 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 541 flow. Second operand 3 states and 657 transitions. [2024-10-31 22:02:53,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 238 transitions, 592 flow [2024-10-31 22:02:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 238 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:53,772 INFO L231 Difference]: Finished difference. Result has 234 places, 235 transitions, 557 flow [2024-10-31 22:02:53,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=234, PETRI_TRANSITIONS=235} [2024-10-31 22:02:53,775 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 8 predicate places. [2024-10-31 22:02:53,776 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 235 transitions, 557 flow [2024-10-31 22:02:53,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2024-10-31 22:02:53,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:53,778 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:02:53,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash 367723951, now seen corresponding path program 1 times [2024-10-31 22:02:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914880292] [2024-10-31 22:02:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914880292] [2024-10-31 22:02:54,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914880292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:54,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:54,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070166928] [2024-10-31 22:02:54,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:54,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:02:54,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:02:54,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:02:54,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 229 [2024-10-31 22:02:54,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 557 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2024-10-31 22:02:54,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:54,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 229 [2024-10-31 22:02:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:54,360 INFO L124 PetriNetUnfolderBase]: 82/814 cut-off events. [2024-10-31 22:02:54,360 INFO L125 PetriNetUnfolderBase]: For 71/77 co-relation queries the response was YES. [2024-10-31 22:02:54,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 814 events. 82/814 cut-off events. For 71/77 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4075 event pairs, 17 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 907. Up to 178 conditions per place. [2024-10-31 22:02:54,365 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 21 selfloop transitions, 2 changer transitions 7/246 dead transitions. [2024-10-31 22:02:54,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 246 transitions, 639 flow [2024-10-31 22:02:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:02:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:02:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2024-10-31 22:02:54,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9221251819505094 [2024-10-31 22:02:54,369 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 557 flow. Second operand 6 states and 1267 transitions. [2024-10-31 22:02:54,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 246 transitions, 639 flow [2024-10-31 22:02:54,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 246 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:54,376 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 567 flow [2024-10-31 22:02:54,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2024-10-31 22:02:54,377 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, 15 predicate places. [2024-10-31 22:02:54,377 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 567 flow [2024-10-31 22:02:54,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2024-10-31 22:02:54,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:54,379 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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] [2024-10-31 22:02:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:02:54,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:02:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1051224073, now seen corresponding path program 1 times [2024-10-31 22:02:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:54,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591622397] [2024-10-31 22:02:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:54,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:54,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:54,554 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:02:54,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-10-31 22:02:54,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-10-31 22:02:54,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-10-31 22:02:54,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-10-31 22:02:54,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-10-31 22:02:54,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-10-31 22:02:54,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-10-31 22:02:54,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-10-31 22:02:54,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-10-31 22:02:54,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:02:54,561 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:54,563 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:02:54,564 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:02:54,591 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:02:54,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 250 transitions, 516 flow [2024-10-31 22:02:54,670 INFO L124 PetriNetUnfolderBase]: 15/382 cut-off events. [2024-10-31 22:02:54,670 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-31 22:02:54,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 382 events. 15/382 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 571 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 281. Up to 8 conditions per place. [2024-10-31 22:02:54,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 250 transitions, 516 flow [2024-10-31 22:02:54,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 250 transitions, 516 flow [2024-10-31 22:02:54,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:02:54,680 INFO L333 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, 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;@47574eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:02:54,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-31 22:02:54,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:02:54,697 INFO L124 PetriNetUnfolderBase]: 2/163 cut-off events. [2024-10-31 22:02:54,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:02:54,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:54,698 INFO L204 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, 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, 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, 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] [2024-10-31 22:02:54,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:02:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:54,699 INFO L85 PathProgramCache]: Analyzing trace with hash 95215218, now seen corresponding path program 1 times [2024-10-31 22:02:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:54,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456885954] [2024-10-31 22:02:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:54,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:54,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456885954] [2024-10-31 22:02:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456885954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612233639] [2024-10-31 22:02:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:54,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 250 [2024-10-31 22:02:54,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 250 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2024-10-31 22:02:54,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:54,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 250 [2024-10-31 22:02:54,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:55,378 INFO L124 PetriNetUnfolderBase]: 642/2252 cut-off events. [2024-10-31 22:02:55,378 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-31 22:02:55,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 2252 events. 642/2252 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15754 event pairs, 323 based on Foata normal form. 244/2091 useless extension candidates. Maximal degree in co-relation 2635. Up to 748 conditions per place. [2024-10-31 22:02:55,398 INFO L140 encePairwiseOnDemand]: 239/250 looper letters, 30 selfloop transitions, 5 changer transitions 1/257 dead transitions. [2024-10-31 22:02:55,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 257 transitions, 600 flow [2024-10-31 22:02:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-10-31 22:02:55,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453333333333334 [2024-10-31 22:02:55,402 INFO L175 Difference]: Start difference. First operand has 246 places, 250 transitions, 516 flow. Second operand 3 states and 709 transitions. [2024-10-31 22:02:55,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 257 transitions, 600 flow [2024-10-31 22:02:55,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 600 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:02:55,409 INFO L231 Difference]: Finished difference. Result has 250 places, 248 transitions, 542 flow [2024-10-31 22:02:55,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=250, PETRI_TRANSITIONS=248} [2024-10-31 22:02:55,411 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 4 predicate places. [2024-10-31 22:02:55,411 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 248 transitions, 542 flow [2024-10-31 22:02:55,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2024-10-31 22:02:55,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:55,412 INFO L204 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, 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, 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, 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] [2024-10-31 22:02:55,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:02:55,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:02:55,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1909339612, now seen corresponding path program 1 times [2024-10-31 22:02:55,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:55,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638872212] [2024-10-31 22:02:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:56,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638872212] [2024-10-31 22:02:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638872212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:56,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:56,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:02:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140900740] [2024-10-31 22:02:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:56,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:02:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:02:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:02:56,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 250 [2024-10-31 22:02:56,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 248 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 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) [2024-10-31 22:02:56,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:56,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 250 [2024-10-31 22:02:56,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:57,130 INFO L124 PetriNetUnfolderBase]: 1149/3668 cut-off events. [2024-10-31 22:02:57,130 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-10-31 22:02:57,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 3668 events. 1149/3668 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 28109 event pairs, 157 based on Foata normal form. 0/3262 useless extension candidates. Maximal degree in co-relation 2647. Up to 1152 conditions per place. [2024-10-31 22:02:57,163 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 58 selfloop transitions, 5 changer transitions 0/279 dead transitions. [2024-10-31 22:02:57,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 279 transitions, 730 flow [2024-10-31 22:02:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:02:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:02:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2024-10-31 22:02:57,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8946666666666667 [2024-10-31 22:02:57,167 INFO L175 Difference]: Start difference. First operand has 250 places, 248 transitions, 542 flow. Second operand 6 states and 1342 transitions. [2024-10-31 22:02:57,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 279 transitions, 730 flow [2024-10-31 22:02:57,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 279 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:57,175 INFO L231 Difference]: Finished difference. Result has 251 places, 247 transitions, 540 flow [2024-10-31 22:02:57,176 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=251, PETRI_TRANSITIONS=247} [2024-10-31 22:02:57,177 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 5 predicate places. [2024-10-31 22:02:57,177 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 247 transitions, 540 flow [2024-10-31 22:02:57,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 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) [2024-10-31 22:02:57,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:57,178 INFO L204 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, 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, 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, 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, 1] [2024-10-31 22:02:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:02:57,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:02:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 944320185, now seen corresponding path program 1 times [2024-10-31 22:02:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499482380] [2024-10-31 22:02:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499482380] [2024-10-31 22:02:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499482380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:57,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954381896] [2024-10-31 22:02:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:57,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:57,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:57,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 250 [2024-10-31 22:02:57,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 247 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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) [2024-10-31 22:02:57,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:57,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 250 [2024-10-31 22:02:57,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:57,912 INFO L124 PetriNetUnfolderBase]: 632/3157 cut-off events. [2024-10-31 22:02:57,912 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2024-10-31 22:02:57,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 3157 events. 632/3157 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 27415 event pairs, 168 based on Foata normal form. 0/2714 useless extension candidates. Maximal degree in co-relation 3754. Up to 649 conditions per place. [2024-10-31 22:02:58,011 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 34 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2024-10-31 22:02:58,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 265 transitions, 665 flow [2024-10-31 22:02:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-31 22:02:58,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506666666666667 [2024-10-31 22:02:58,014 INFO L175 Difference]: Start difference. First operand has 251 places, 247 transitions, 540 flow. Second operand 3 states and 713 transitions. [2024-10-31 22:02:58,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 265 transitions, 665 flow [2024-10-31 22:02:58,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:02:58,020 INFO L231 Difference]: Finished difference. Result has 250 places, 252 transitions, 574 flow [2024-10-31 22:02:58,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=250, PETRI_TRANSITIONS=252} [2024-10-31 22:02:58,022 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 4 predicate places. [2024-10-31 22:02:58,022 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 252 transitions, 574 flow [2024-10-31 22:02:58,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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) [2024-10-31 22:02:58,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:58,023 INFO L204 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, 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, 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, 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, 1] [2024-10-31 22:02:58,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:02:58,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:02:58,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash -721612177, now seen corresponding path program 1 times [2024-10-31 22:02:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:58,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73256416] [2024-10-31 22:02:58,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:58,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:58,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:58,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73256416] [2024-10-31 22:02:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73256416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:58,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520844914] [2024-10-31 22:02:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:58,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:58,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 250 [2024-10-31 22:02:58,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 252 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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) [2024-10-31 22:02:58,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:58,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 250 [2024-10-31 22:02:58,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:58,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][249], [265#true, 113#L1025-2true, 25#L1025-1true, 247#true, 59#L1040-4true, 262#(= |#race~ready~0| 0), Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|)]) [2024-10-31 22:02:58,819 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:02:58,820 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:02:58,823 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:02:58,824 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:02:58,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 17#L1042true, 113#L1025-2true, 25#L1025-1true, 247#true, 262#(= |#race~ready~0| 0), Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|)]) [2024-10-31 22:02:58,939 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:02:58,940 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:02:58,940 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:02:58,940 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:02:58,993 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 113#L1025-2true, 25#L1025-1true, 247#true, 262#(= |#race~ready~0| 0), Black: 260#true, 157#L1042-3true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|)]) [2024-10-31 22:02:58,993 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2024-10-31 22:02:58,993 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:02:58,993 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:02:58,994 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-31 22:02:59,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 113#L1025-2true, 25#L1025-1true, 247#true, 262#(= |#race~ready~0| 0), Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), 184#ULTIMATE.startFINALtrue]) [2024-10-31 22:02:59,234 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2024-10-31 22:02:59,234 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:02:59,234 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-10-31 22:02:59,234 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:02:59,343 INFO L124 PetriNetUnfolderBase]: 1478/4950 cut-off events. [2024-10-31 22:02:59,343 INFO L125 PetriNetUnfolderBase]: For 833/837 co-relation queries the response was YES. [2024-10-31 22:02:59,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8302 conditions, 4950 events. 1478/4950 cut-off events. For 833/837 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 44139 event pairs, 619 based on Foata normal form. 0/4323 useless extension candidates. Maximal degree in co-relation 7111. Up to 1766 conditions per place. [2024-10-31 22:02:59,381 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 32 selfloop transitions, 8 changer transitions 0/266 dead transitions. [2024-10-31 22:02:59,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 266 transitions, 694 flow [2024-10-31 22:02:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:02:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2024-10-31 22:02:59,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.936 [2024-10-31 22:02:59,384 INFO L175 Difference]: Start difference. First operand has 250 places, 252 transitions, 574 flow. Second operand 3 states and 702 transitions. [2024-10-31 22:02:59,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 266 transitions, 694 flow [2024-10-31 22:02:59,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 266 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:02:59,392 INFO L231 Difference]: Finished difference. Result has 252 places, 258 transitions, 630 flow [2024-10-31 22:02:59,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=252, PETRI_TRANSITIONS=258} [2024-10-31 22:02:59,393 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 6 predicate places. [2024-10-31 22:02:59,393 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 258 transitions, 630 flow [2024-10-31 22:02:59,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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) [2024-10-31 22:02:59,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:59,394 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:59,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:02:59,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:02:59,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1971551086, now seen corresponding path program 1 times [2024-10-31 22:02:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673030419] [2024-10-31 22:02:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673030419] [2024-10-31 22:02:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673030419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:59,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:59,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:59,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729977437] [2024-10-31 22:02:59,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:59,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:02:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:59,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:59,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:59,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 250 [2024-10-31 22:02:59,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 258 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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) [2024-10-31 22:02:59,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:59,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 250 [2024-10-31 22:02:59,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:59,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 25#L1025-1true, 124#L1036-10true, 99#L1025-1true, 247#true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:02:59,674 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-10-31 22:02:59,674 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:02:59,674 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:02:59,675 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-31 22:02:59,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 113#L1025-2true, 25#L1025-1true, 124#L1036-10true, 247#true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:02:59,682 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-31 22:02:59,682 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:02:59,683 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:02:59,683 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-10-31 22:03:00,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][251], [265#true, 113#L1025-2true, 25#L1025-1true, 247#true, 59#L1040-4true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:00,008 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:00,008 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:00,008 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:00,009 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:00,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][268], [265#true, 99#L1025-1true, 247#true, 59#L1040-4true, Black: 260#true, 11#L1025-2true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:00,012 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:00,013 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:00,013 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:00,013 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:00,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][193], [265#true, 113#L1025-2true, 17#L1042true, 25#L1025-1true, 247#true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:00,098 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:00,098 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:00,098 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:00,098 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:00,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][231], [265#true, 17#L1042true, 99#L1025-1true, 247#true, Black: 260#true, 11#L1025-2true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:00,102 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:00,102 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:00,102 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:00,102 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:00,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][231], [265#true, 99#L1025-1true, 247#true, Black: 260#true, 157#L1042-3true, 11#L1025-2true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:00,152 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2024-10-31 22:03:00,153 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:03:00,153 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-31 22:03:00,153 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:03:00,809 INFO L124 PetriNetUnfolderBase]: 1617/6183 cut-off events. [2024-10-31 22:03:00,809 INFO L125 PetriNetUnfolderBase]: For 1327/1548 co-relation queries the response was YES. [2024-10-31 22:03:00,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10557 conditions, 6183 events. 1617/6183 cut-off events. For 1327/1548 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 60680 event pairs, 517 based on Foata normal form. 26/5421 useless extension candidates. Maximal degree in co-relation 7530. Up to 1199 conditions per place. [2024-10-31 22:03:00,859 INFO L140 encePairwiseOnDemand]: 243/250 looper letters, 36 selfloop transitions, 7 changer transitions 0/278 dead transitions. [2024-10-31 22:03:00,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 278 transitions, 777 flow [2024-10-31 22:03:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:03:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-31 22:03:00,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506666666666667 [2024-10-31 22:03:00,862 INFO L175 Difference]: Start difference. First operand has 252 places, 258 transitions, 630 flow. Second operand 3 states and 713 transitions. [2024-10-31 22:03:00,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 278 transitions, 777 flow [2024-10-31 22:03:00,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 278 transitions, 761 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:03:00,872 INFO L231 Difference]: Finished difference. Result has 254 places, 265 transitions, 684 flow [2024-10-31 22:03:00,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=254, PETRI_TRANSITIONS=265} [2024-10-31 22:03:00,873 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 8 predicate places. [2024-10-31 22:03:00,874 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 265 transitions, 684 flow [2024-10-31 22:03:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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) [2024-10-31 22:03:00,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:00,875 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:03:00,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:03:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1729768145, now seen corresponding path program 1 times [2024-10-31 22:03:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804817121] [2024-10-31 22:03:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:01,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804817121] [2024-10-31 22:03:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804817121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:03:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922936413] [2024-10-31 22:03:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:03:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:03:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:03:01,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 250 [2024-10-31 22:03:01,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 265 transitions, 684 flow. Second operand has 5 states, 5 states have (on average 221.8) internal successors, (1109), 5 states have internal predecessors, (1109), 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) [2024-10-31 22:03:01,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:01,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 250 [2024-10-31 22:03:01,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:03:02,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][252], [Black: 272#(= |#race~data~0| 0), 113#L1025-2true, 25#L1025-1true, 247#true, 59#L1040-4true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:02,009 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:02,011 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:02,011 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:02,012 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:02,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][270], [Black: 272#(= |#race~data~0| 0), 99#L1025-1true, 247#true, 59#L1040-4true, Black: 260#true, 11#L1025-2true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:02,015 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:02,015 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:02,015 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:02,016 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:02,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][198], [Black: 272#(= |#race~data~0| 0), 113#L1025-2true, 17#L1042true, 25#L1025-1true, 247#true, Black: 260#true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:02,106 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:02,107 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:02,107 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:02,107 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:02,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][222], [Black: 272#(= |#race~data~0| 0), 17#L1042true, 247#true, 99#L1025-1true, Black: 260#true, 11#L1025-2true, 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 270#true]) [2024-10-31 22:03:02,112 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:02,112 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:02,113 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:02,113 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:03,048 INFO L124 PetriNetUnfolderBase]: 2062/8529 cut-off events. [2024-10-31 22:03:03,048 INFO L125 PetriNetUnfolderBase]: For 1613/1836 co-relation queries the response was YES. [2024-10-31 22:03:03,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14306 conditions, 8529 events. 2062/8529 cut-off events. For 1613/1836 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 90233 event pairs, 804 based on Foata normal form. 1/7803 useless extension candidates. Maximal degree in co-relation 7209. Up to 2828 conditions per place. [2024-10-31 22:03:03,108 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 28 selfloop transitions, 2 changer transitions 7/277 dead transitions. [2024-10-31 22:03:03,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 277 transitions, 782 flow [2024-10-31 22:03:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:03:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:03:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1358 transitions. [2024-10-31 22:03:03,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9053333333333333 [2024-10-31 22:03:03,112 INFO L175 Difference]: Start difference. First operand has 254 places, 265 transitions, 684 flow. Second operand 6 states and 1358 transitions. [2024-10-31 22:03:03,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 277 transitions, 782 flow [2024-10-31 22:03:03,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 277 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:03:03,121 INFO L231 Difference]: Finished difference. Result has 261 places, 266 transitions, 692 flow [2024-10-31 22:03:03,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=261, PETRI_TRANSITIONS=266} [2024-10-31 22:03:03,122 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 15 predicate places. [2024-10-31 22:03:03,122 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 266 transitions, 692 flow [2024-10-31 22:03:03,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 221.8) internal successors, (1109), 5 states have internal predecessors, (1109), 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) [2024-10-31 22:03:03,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:03,123 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:03,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:03:03,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:03:03,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -372679049, now seen corresponding path program 1 times [2024-10-31 22:03:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325131231] [2024-10-31 22:03:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325131231] [2024-10-31 22:03:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325131231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:03,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426849442] [2024-10-31 22:03:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:03,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:03,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 250 [2024-10-31 22:03:03,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 266 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2024-10-31 22:03:03,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:03,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 250 [2024-10-31 22:03:03,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:03:03,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][173], [288#(= ~ready~0 0), 99#L1025-1true, 247#true, Black: 260#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 272#(= |#race~data~0| 0), 25#L1025-1true, 124#L1036-10true, Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:03,713 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-10-31 22:03:03,713 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-31 22:03:03,713 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:03:03,713 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:03:03,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][173], [113#L1025-2true, 288#(= ~ready~0 0), 247#true, Black: 260#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 272#(= |#race~data~0| 0), 25#L1025-1true, 124#L1036-10true, Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:03,720 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2024-10-31 22:03:03,720 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:03:03,720 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-10-31 22:03:03,720 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:03:04,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][224], [113#L1025-2true, 247#true, 59#L1040-4true, Black: 260#true, 286#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 272#(= |#race~data~0| 0), 25#L1025-1true, Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:04,009 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:04,009 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:04,009 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:04,009 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:04,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][248], [247#true, 99#L1025-1true, 59#L1040-4true, Black: 260#true, 286#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 272#(= |#race~data~0| 0), 11#L1025-2true, Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:04,031 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-31 22:03:04,031 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:04,031 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-31 22:03:04,031 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-31 22:03:04,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([766] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][173], [113#L1025-2true, 247#true, Black: 260#true, 286#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 17#L1042true, Black: 272#(= |#race~data~0| 0), 25#L1025-1true, Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:04,124 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:04,124 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:04,124 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:04,124 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:04,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L1026-6-->L1025-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][199], [99#L1025-1true, 247#true, Black: 260#true, 286#true, 275#true, Black: 267#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet16#1|), 17#L1042true, Black: 272#(= |#race~data~0| 0), Black: 281#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 11#L1025-2true, Black: 278#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 245#true, Black: 251#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet14#1|), Black: 277#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 279#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0))]) [2024-10-31 22:03:04,142 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2024-10-31 22:03:04,143 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:04,143 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-31 22:03:04,143 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-31 22:03:04,664 INFO L124 PetriNetUnfolderBase]: 836/4493 cut-off events. [2024-10-31 22:03:04,664 INFO L125 PetriNetUnfolderBase]: For 632/757 co-relation queries the response was YES. [2024-10-31 22:03:04,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7342 conditions, 4493 events. 836/4493 cut-off events. For 632/757 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 44708 event pairs, 239 based on Foata normal form. 20/4214 useless extension candidates. Maximal degree in co-relation 7161. Up to 928 conditions per place. [2024-10-31 22:03:04,694 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-10-31 22:03:04,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 260 transitions, 694 flow [2024-10-31 22:03:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:03:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2024-10-31 22:03:04,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426666666666667 [2024-10-31 22:03:04,697 INFO L175 Difference]: Start difference. First operand has 261 places, 266 transitions, 692 flow. Second operand 3 states and 707 transitions. [2024-10-31 22:03:04,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 260 transitions, 694 flow [2024-10-31 22:03:04,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 260 transitions, 672 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-31 22:03:04,716 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 622 flow [2024-10-31 22:03:04,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2024-10-31 22:03:04,717 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 7 predicate places. [2024-10-31 22:03:04,718 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 622 flow [2024-10-31 22:03:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2024-10-31 22:03:04,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:04,719 INFO L204 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:03:04,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:03:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -245064913, now seen corresponding path program 1 times [2024-10-31 22:03:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097974453] [2024-10-31 22:03:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:03:04,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:04,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097974453] [2024-10-31 22:03:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097974453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620778908] [2024-10-31 22:03:04,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:04,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:04,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 250 [2024-10-31 22:03:04,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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) [2024-10-31 22:03:04,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:04,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 250 [2024-10-31 22:03:04,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:03:05,076 INFO L124 PetriNetUnfolderBase]: 43/770 cut-off events. [2024-10-31 22:03:05,076 INFO L125 PetriNetUnfolderBase]: For 91/92 co-relation queries the response was YES. [2024-10-31 22:03:05,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 770 events. 43/770 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3330 event pairs, 5 based on Foata normal form. 27/761 useless extension candidates. Maximal degree in co-relation 700. Up to 49 conditions per place. [2024-10-31 22:03:05,080 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 8 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2024-10-31 22:03:05,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 246 transitions, 623 flow [2024-10-31 22:03:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:03:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-31 22:03:05,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506666666666667 [2024-10-31 22:03:05,082 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 622 flow. Second operand 3 states and 713 transitions. [2024-10-31 22:03:05,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 246 transitions, 623 flow [2024-10-31 22:03:05,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 246 transitions, 599 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-10-31 22:03:05,088 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 566 flow [2024-10-31 22:03:05,089 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2024-10-31 22:03:05,090 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 2 predicate places. [2024-10-31 22:03:05,092 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 566 flow [2024-10-31 22:03:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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) [2024-10-31 22:03:05,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:05,094 INFO L204 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, 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, 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, 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, 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] [2024-10-31 22:03:05,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:03:05,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:03:05,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -3517412, now seen corresponding path program 1 times [2024-10-31 22:03:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:05,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811043799] [2024-10-31 22:03:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:03:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811043799] [2024-10-31 22:03:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811043799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:03:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534284138] [2024-10-31 22:03:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:03:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:03:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:03:05,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 250 [2024-10-31 22:03:05,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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) [2024-10-31 22:03:05,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:05,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 250 [2024-10-31 22:03:05,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:03:06,450 INFO L124 PetriNetUnfolderBase]: 584/1959 cut-off events. [2024-10-31 22:03:06,451 INFO L125 PetriNetUnfolderBase]: For 555/616 co-relation queries the response was YES. [2024-10-31 22:03:06,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3865 conditions, 1959 events. 584/1959 cut-off events. For 555/616 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 12141 event pairs, 143 based on Foata normal form. 12/1920 useless extension candidates. Maximal degree in co-relation 2852. Up to 453 conditions per place. [2024-10-31 22:03:06,459 INFO L140 encePairwiseOnDemand]: 244/250 looper letters, 14 selfloop transitions, 0 changer transitions 81/274 dead transitions. [2024-10-31 22:03:06,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 274 transitions, 814 flow [2024-10-31 22:03:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:03:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:03:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2024-10-31 22:03:06,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9013333333333333 [2024-10-31 22:03:06,463 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 566 flow. Second operand 6 states and 1352 transitions. [2024-10-31 22:03:06,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 274 transitions, 814 flow [2024-10-31 22:03:06,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 274 transitions, 772 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:03:06,470 INFO L231 Difference]: Finished difference. Result has 251 places, 193 transitions, 421 flow [2024-10-31 22:03:06,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=251, PETRI_TRANSITIONS=193} [2024-10-31 22:03:06,472 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, 5 predicate places. [2024-10-31 22:03:06,472 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 193 transitions, 421 flow [2024-10-31 22:03:06,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 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) [2024-10-31 22:03:06,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:06,474 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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] [2024-10-31 22:03:06,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:03:06,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-10-31 22:03:06,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1858585251, now seen corresponding path program 1 times [2024-10-31 22:03:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970988235] [2024-10-31 22:03:06,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:06,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:06,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:06,623 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:03:06,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-10-31 22:03:06,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-10-31 22:03:06,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-10-31 22:03:06,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-10-31 22:03:06,624 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-10-31 22:03:06,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-10-31 22:03:06,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-10-31 22:03:06,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-10-31 22:03:06,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-10-31 22:03:06,625 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-10-31 22:03:06,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-10-31 22:03:06,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:03:06,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:06,627 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:03:06,627 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-31 22:03:06,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 22:03:06,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 271 transitions, 569 flow [2024-10-31 22:03:06,763 INFO L124 PetriNetUnfolderBase]: 27/530 cut-off events. [2024-10-31 22:03:06,764 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-31 22:03:06,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 530 events. 27/530 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1126 event pairs, 1 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 390. Up to 16 conditions per place. [2024-10-31 22:03:06,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 271 transitions, 569 flow [2024-10-31 22:03:06,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 271 transitions, 569 flow [2024-10-31 22:03:06,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:03:06,771 INFO L333 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, 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;@47574eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:03:06,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-31 22:03:06,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:03:06,782 INFO L124 PetriNetUnfolderBase]: 2/163 cut-off events. [2024-10-31 22:03:06,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:03:06,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:06,783 INFO L204 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, 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, 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, 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] [2024-10-31 22:03:06,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-31 22:03:06,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:06,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1949855487, now seen corresponding path program 1 times [2024-10-31 22:03:06,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:06,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596089751] [2024-10-31 22:03:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:06,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596089751] [2024-10-31 22:03:06,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596089751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:06,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:06,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:06,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222662514] [2024-10-31 22:03:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:06,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:06,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:06,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:06,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:06,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 271 [2024-10-31 22:03:06,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 271 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-10-31 22:03:06,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:06,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 271 [2024-10-31 22:03:06,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:03:10,370 INFO L124 PetriNetUnfolderBase]: 6675/16256 cut-off events. [2024-10-31 22:03:10,370 INFO L125 PetriNetUnfolderBase]: For 634/634 co-relation queries the response was YES. [2024-10-31 22:03:10,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25491 conditions, 16256 events. 6675/16256 cut-off events. For 634/634 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 159111 event pairs, 3454 based on Foata normal form. 2303/15645 useless extension candidates. Maximal degree in co-relation 21265. Up to 6931 conditions per place. [2024-10-31 22:03:10,505 INFO L140 encePairwiseOnDemand]: 258/271 looper letters, 41 selfloop transitions, 6 changer transitions 1/282 dead transitions. [2024-10-31 22:03:10,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 282 transitions, 685 flow [2024-10-31 22:03:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:03:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-10-31 22:03:10,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372693726937269 [2024-10-31 22:03:10,508 INFO L175 Difference]: Start difference. First operand has 266 places, 271 transitions, 569 flow. Second operand 3 states and 762 transitions. [2024-10-31 22:03:10,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 282 transitions, 685 flow [2024-10-31 22:03:10,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 282 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:03:10,516 INFO L231 Difference]: Finished difference. Result has 270 places, 269 transitions, 601 flow [2024-10-31 22:03:10,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=270, PETRI_TRANSITIONS=269} [2024-10-31 22:03:10,517 INFO L277 CegarLoopForPetriNet]: 266 programPoint places, 4 predicate places. [2024-10-31 22:03:10,518 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 269 transitions, 601 flow [2024-10-31 22:03:10,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-10-31 22:03:10,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:03:10,518 INFO L204 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, 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, 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, 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] [2024-10-31 22:03:10,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:03:10,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-31 22:03:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash -603544949, now seen corresponding path program 1 times [2024-10-31 22:03:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:10,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337491409] [2024-10-31 22:03:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:03:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337491409] [2024-10-31 22:03:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337491409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:03:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340889531] [2024-10-31 22:03:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:03:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:03:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:03:11,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 271 [2024-10-31 22:03:11,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 269 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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) [2024-10-31 22:03:11,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:03:11,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 271 [2024-10-31 22:03:11,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand