./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya --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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:50:09,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:50:09,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 02:50:09,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:50:09,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:50:09,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:50:09,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:50:09,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:50:09,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:50:09,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:50:09,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:50:09,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:50:09,601 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:50:09,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:50:09,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:50:09,603 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:50:09,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:50:09,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:50:09,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:50:09,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:50:09,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:50:09,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:50:09,607 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 02:50:09,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:50:09,608 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:50:09,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:50:09,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:50:09,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:50:09,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:50:09,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:50:09,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:50:09,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:50:09,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:50:09,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:50:09,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:50:09,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:50:09,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:50:09,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:50:09,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:50:09,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:50:09,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:50:09,614 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_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/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_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2023-11-29 02:50:09,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:50:09,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:50:09,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:50:09,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:50:09,851 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:50:09,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-11-29 02:50:12,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:50:12,807 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:50:12,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2023-11-29 02:50:12,819 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/data/8c0939c0f/31720f9c25b943b2ba3dfdaa20e8af96/FLAG1a740a9f9 [2023-11-29 02:50:12,832 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/data/8c0939c0f/31720f9c25b943b2ba3dfdaa20e8af96 [2023-11-29 02:50:12,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:50:12,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:50:12,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:50:12,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:50:12,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:50:12,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:50:12" (1/1) ... [2023-11-29 02:50:12,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d342d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:12, skipping insertion in model container [2023-11-29 02:50:12,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:50:12" (1/1) ... [2023-11-29 02:50:12,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:50:13,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:50:13,201 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:50:13,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:50:13,299 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:50:13,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13 WrapperNode [2023-11-29 02:50:13,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:50:13,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:50:13,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:50:13,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:50:13,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,357 INFO L138 Inliner]: procedures = 165, calls = 21, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 95 [2023-11-29 02:50:13,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:50:13,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:50:13,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:50:13,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:50:13,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:50:13,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:50:13,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:50:13,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:50:13,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (1/1) ... [2023-11-29 02:50:13,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:50:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:50:13,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:50:13,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131e89b9-5d23-462f-89e1-1643bc93d5de/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:50:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-29 02:50:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-29 02:50:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 02:50:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:50:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:50:13,469 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:50:13,641 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:50:13,644 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:50:13,807 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:50:13,829 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:50:13,830 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:50:13,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:50:13 BoogieIcfgContainer [2023-11-29 02:50:13,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:50:13,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:50:13,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:50:13,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:50:13,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:50:12" (1/3) ... [2023-11-29 02:50:13,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6079293f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:50:13, skipping insertion in model container [2023-11-29 02:50:13,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:50:13" (2/3) ... [2023-11-29 02:50:13,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6079293f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:50:13, skipping insertion in model container [2023-11-29 02:50:13,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:50:13" (3/3) ... [2023-11-29 02:50:13,841 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2023-11-29 02:50:13,849 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:50:13,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:50:13,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 02:50:13,860 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:50:13,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:50:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 214 flow [2023-11-29 02:50:14,044 INFO L124 PetriNetUnfolderBase]: 8/158 cut-off events. [2023-11-29 02:50:14,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:50:14,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 8/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 384 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-11-29 02:50:14,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 105 transitions, 214 flow [2023-11-29 02:50:14,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 105 transitions, 214 flow [2023-11-29 02:50:14,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:50:14,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78cf71ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:50:14,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 02:50:14,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:50:14,084 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-29 02:50:14,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:50:14,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:14,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:14,085 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 02:50:14,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:14,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1866201768, now seen corresponding path program 1 times [2023-11-29 02:50:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233836913] [2023-11-29 02:50:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:14,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:14,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233836913] [2023-11-29 02:50:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233836913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:14,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277468872] [2023-11-29 02:50:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:14,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:50:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:50:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:50:14,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2023-11-29 02:50:14,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 105 transitions, 214 flow. Second operand has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:14,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2023-11-29 02:50:14,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:14,377 INFO L124 PetriNetUnfolderBase]: 4/195 cut-off events. [2023-11-29 02:50:14,377 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:50:14,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 195 events. 4/195 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 558 event pairs, 4 based on Foata normal form. 15/186 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2023-11-29 02:50:14,380 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 5 selfloop transitions, 0 changer transitions 0/94 dead transitions. [2023-11-29 02:50:14,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 202 flow [2023-11-29 02:50:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:50:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:50:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 196 transitions. [2023-11-29 02:50:14,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2023-11-29 02:50:14,393 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 196 transitions. [2023-11-29 02:50:14,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 196 transitions. [2023-11-29 02:50:14,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:14,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 196 transitions. [2023-11-29 02:50:14,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,404 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,406 INFO L175 Difference]: Start difference. First operand has 103 places, 105 transitions, 214 flow. Second operand 2 states and 196 transitions. [2023-11-29 02:50:14,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 202 flow [2023-11-29 02:50:14,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 94 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:14,413 INFO L231 Difference]: Finished difference. Result has 98 places, 94 transitions, 192 flow [2023-11-29 02:50:14,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=94} [2023-11-29 02:50:14,419 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -5 predicate places. [2023-11-29 02:50:14,419 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 94 transitions, 192 flow [2023-11-29 02:50:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:14,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:14,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:50:14,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 02:50:14,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:14,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1524195953, now seen corresponding path program 1 times [2023-11-29 02:50:14,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393626459] [2023-11-29 02:50:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:14,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393626459] [2023-11-29 02:50:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393626459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452270240] [2023-11-29 02:50:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:14,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:14,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:14,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:14,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2023-11-29 02:50:14,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:14,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2023-11-29 02:50:14,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:14,650 INFO L124 PetriNetUnfolderBase]: 59/464 cut-off events. [2023-11-29 02:50:14,651 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 02:50:14,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 464 events. 59/464 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2423 event pairs, 41 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 613. Up to 126 conditions per place. [2023-11-29 02:50:14,656 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 18 selfloop transitions, 6 changer transitions 0/101 dead transitions. [2023-11-29 02:50:14,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 254 flow [2023-11-29 02:50:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-11-29 02:50:14,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508 [2023-11-29 02:50:14,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-11-29 02:50:14,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-11-29 02:50:14,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:14,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-11-29 02:50:14,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,665 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 192 flow. Second operand 3 states and 268 transitions. [2023-11-29 02:50:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 254 flow [2023-11-29 02:50:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:14,669 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 238 flow [2023-11-29 02:50:14,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2023-11-29 02:50:14,670 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2023-11-29 02:50:14,670 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 238 flow [2023-11-29 02:50:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:14,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:50:14,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 02:50:14,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 293414073, now seen corresponding path program 1 times [2023-11-29 02:50:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645954992] [2023-11-29 02:50:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645954992] [2023-11-29 02:50:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645954992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:14,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81523833] [2023-11-29 02:50:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:14,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:14,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:14,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2023-11-29 02:50:14,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:14,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2023-11-29 02:50:14,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:14,871 INFO L124 PetriNetUnfolderBase]: 64/437 cut-off events. [2023-11-29 02:50:14,871 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2023-11-29 02:50:14,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 437 events. 64/437 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2332 event pairs, 32 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 677. Up to 119 conditions per place. [2023-11-29 02:50:14,875 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 18 selfloop transitions, 7 changer transitions 0/106 dead transitions. [2023-11-29 02:50:14,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 306 flow [2023-11-29 02:50:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-11-29 02:50:14,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2023-11-29 02:50:14,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-11-29 02:50:14,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-11-29 02:50:14,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:14,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-11-29 02:50:14,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,882 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 238 flow. Second operand 3 states and 272 transitions. [2023-11-29 02:50:14,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 306 flow [2023-11-29 02:50:14,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:14,887 INFO L231 Difference]: Finished difference. Result has 104 places, 104 transitions, 278 flow [2023-11-29 02:50:14,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=104, PETRI_TRANSITIONS=104} [2023-11-29 02:50:14,888 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2023-11-29 02:50:14,888 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 104 transitions, 278 flow [2023-11-29 02:50:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:14,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:14,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:50:14,890 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 02:50:14,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 927636466, now seen corresponding path program 1 times [2023-11-29 02:50:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297865700] [2023-11-29 02:50:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297865700] [2023-11-29 02:50:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297865700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909381142] [2023-11-29 02:50:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:14,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:14,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:14,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2023-11-29 02:50:14,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 104 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:14,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:14,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2023-11-29 02:50:14,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:15,052 INFO L124 PetriNetUnfolderBase]: 83/566 cut-off events. [2023-11-29 02:50:15,052 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-11-29 02:50:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 566 events. 83/566 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3358 event pairs, 23 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 943. Up to 101 conditions per place. [2023-11-29 02:50:15,056 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 23 selfloop transitions, 12 changer transitions 0/118 dead transitions. [2023-11-29 02:50:15,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 118 transitions, 400 flow [2023-11-29 02:50:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-11-29 02:50:15,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8825396825396825 [2023-11-29 02:50:15,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-11-29 02:50:15,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-11-29 02:50:15,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:15,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-11-29 02:50:15,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,062 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,062 INFO L175 Difference]: Start difference. First operand has 104 places, 104 transitions, 278 flow. Second operand 3 states and 278 transitions. [2023-11-29 02:50:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 118 transitions, 400 flow [2023-11-29 02:50:15,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 118 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:15,068 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 376 flow [2023-11-29 02:50:15,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2023-11-29 02:50:15,070 INFO L281 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2023-11-29 02:50:15,070 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 376 flow [2023-11-29 02:50:15,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:15,070 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 02:50:15,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:50:15,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-29 02:50:15,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:15,071 INFO L85 PathProgramCache]: Analyzing trace with hash 130408571, now seen corresponding path program 1 times [2023-11-29 02:50:15,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:15,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512393996] [2023-11-29 02:50:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:15,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:50:15,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:50:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:50:15,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:50:15,125 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:50:15,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-29 02:50:15,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-29 02:50:15,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-29 02:50:15,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-29 02:50:15,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-29 02:50:15,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-29 02:50:15,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-29 02:50:15,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2023-11-29 02:50:15,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-29 02:50:15,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-29 02:50:15,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:50:15,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 02:50:15,132 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:50:15,132 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 02:50:15,163 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:50:15,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 137 transitions, 284 flow [2023-11-29 02:50:15,192 INFO L124 PetriNetUnfolderBase]: 13/245 cut-off events. [2023-11-29 02:50:15,192 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 02:50:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 245 events. 13/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 802 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 159. Up to 6 conditions per place. [2023-11-29 02:50:15,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 137 transitions, 284 flow [2023-11-29 02:50:15,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 137 transitions, 284 flow [2023-11-29 02:50:15,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:50:15,199 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78cf71ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:50:15,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 02:50:15,212 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:50:15,212 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-29 02:50:15,212 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:50:15,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:15,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:15,213 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:15,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1881723496, now seen corresponding path program 1 times [2023-11-29 02:50:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429142834] [2023-11-29 02:50:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429142834] [2023-11-29 02:50:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429142834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250997111] [2023-11-29 02:50:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:50:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:50:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:50:15,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 137 [2023-11-29 02:50:15,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 284 flow. Second operand has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:15,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 137 [2023-11-29 02:50:15,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:15,319 INFO L124 PetriNetUnfolderBase]: 34/576 cut-off events. [2023-11-29 02:50:15,319 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 02:50:15,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 576 events. 34/576 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3255 event pairs, 34 based on Foata normal form. 65/554 useless extension candidates. Maximal degree in co-relation 433. Up to 73 conditions per place. [2023-11-29 02:50:15,323 INFO L140 encePairwiseOnDemand]: 130/137 looper letters, 8 selfloop transitions, 0 changer transitions 0/121 dead transitions. [2023-11-29 02:50:15,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 121 transitions, 268 flow [2023-11-29 02:50:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:50:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:50:15,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2023-11-29 02:50:15,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9233576642335767 [2023-11-29 02:50:15,325 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2023-11-29 02:50:15,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2023-11-29 02:50:15,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:15,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2023-11-29 02:50:15,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,328 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,328 INFO L175 Difference]: Start difference. First operand has 135 places, 137 transitions, 284 flow. Second operand 2 states and 253 transitions. [2023-11-29 02:50:15,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 121 transitions, 268 flow [2023-11-29 02:50:15,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 121 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:15,331 INFO L231 Difference]: Finished difference. Result has 127 places, 121 transitions, 252 flow [2023-11-29 02:50:15,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=121} [2023-11-29 02:50:15,332 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -8 predicate places. [2023-11-29 02:50:15,332 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 121 transitions, 252 flow [2023-11-29 02:50:15,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:15,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:50:15,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:15,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 75662874, now seen corresponding path program 1 times [2023-11-29 02:50:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851471596] [2023-11-29 02:50:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851471596] [2023-11-29 02:50:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851471596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992203288] [2023-11-29 02:50:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:15,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:15,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2023-11-29 02:50:15,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:15,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2023-11-29 02:50:15,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:15,823 INFO L124 PetriNetUnfolderBase]: 845/3313 cut-off events. [2023-11-29 02:50:15,823 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 02:50:15,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 3313 events. 845/3313 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 29966 event pairs, 631 based on Foata normal form. 0/2810 useless extension candidates. Maximal degree in co-relation 4758. Up to 1252 conditions per place. [2023-11-29 02:50:15,856 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 26 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2023-11-29 02:50:15,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 133 transitions, 346 flow [2023-11-29 02:50:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-29 02:50:15,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467153284671532 [2023-11-29 02:50:15,859 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-29 02:50:15,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-29 02:50:15,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:15,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-29 02:50:15,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,864 INFO L175 Difference]: Start difference. First operand has 127 places, 121 transitions, 252 flow. Second operand 3 states and 348 transitions. [2023-11-29 02:50:15,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 133 transitions, 346 flow [2023-11-29 02:50:15,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 133 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:15,869 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 322 flow [2023-11-29 02:50:15,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2023-11-29 02:50:15,870 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -4 predicate places. [2023-11-29 02:50:15,870 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 322 flow [2023-11-29 02:50:15,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:15,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:50:15,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:15,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -808995271, now seen corresponding path program 1 times [2023-11-29 02:50:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540519325] [2023-11-29 02:50:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:15,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540519325] [2023-11-29 02:50:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540519325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:15,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620374543] [2023-11-29 02:50:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:15,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:15,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:15,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2023-11-29 02:50:15,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:15,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:15,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2023-11-29 02:50:15,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:16,560 INFO L124 PetriNetUnfolderBase]: 1082/3771 cut-off events. [2023-11-29 02:50:16,560 INFO L125 PetriNetUnfolderBase]: For 820/958 co-relation queries the response was YES. [2023-11-29 02:50:16,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 3771 events. 1082/3771 cut-off events. For 820/958 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 35211 event pairs, 602 based on Foata normal form. 3/3181 useless extension candidates. Maximal degree in co-relation 6657. Up to 1422 conditions per place. [2023-11-29 02:50:16,599 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 30 selfloop transitions, 13 changer transitions 0/145 dead transitions. [2023-11-29 02:50:16,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 145 transitions, 467 flow [2023-11-29 02:50:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-29 02:50:16,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077 [2023-11-29 02:50:16,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-29 02:50:16,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-29 02:50:16,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:16,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-29 02:50:16,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:16,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:16,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:16,605 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 322 flow. Second operand 3 states and 353 transitions. [2023-11-29 02:50:16,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 145 transitions, 467 flow [2023-11-29 02:50:16,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 441 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:16,615 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 416 flow [2023-11-29 02:50:16,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2023-11-29 02:50:16,616 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -2 predicate places. [2023-11-29 02:50:16,616 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 416 flow [2023-11-29 02:50:16,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:16,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:16,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:16,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:50:16,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:16,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -784761070, now seen corresponding path program 1 times [2023-11-29 02:50:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081901616] [2023-11-29 02:50:16,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081901616] [2023-11-29 02:50:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081901616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833793504] [2023-11-29 02:50:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:16,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:16,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2023-11-29 02:50:16,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:16,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:16,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2023-11-29 02:50:16,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:17,440 INFO L124 PetriNetUnfolderBase]: 2061/6952 cut-off events. [2023-11-29 02:50:17,441 INFO L125 PetriNetUnfolderBase]: For 3727/3899 co-relation queries the response was YES. [2023-11-29 02:50:17,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13721 conditions, 6952 events. 2061/6952 cut-off events. For 3727/3899 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 72686 event pairs, 630 based on Foata normal form. 7/5820 useless extension candidates. Maximal degree in co-relation 13713. Up to 1788 conditions per place. [2023-11-29 02:50:17,482 INFO L140 encePairwiseOnDemand]: 122/137 looper letters, 44 selfloop transitions, 26 changer transitions 0/172 dead transitions. [2023-11-29 02:50:17,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 172 transitions, 715 flow [2023-11-29 02:50:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-29 02:50:17,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8686131386861314 [2023-11-29 02:50:17,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-29 02:50:17,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-29 02:50:17,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:17,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-29 02:50:17,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:17,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:17,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:17,487 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 416 flow. Second operand 3 states and 357 transitions. [2023-11-29 02:50:17,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 172 transitions, 715 flow [2023-11-29 02:50:17,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 172 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:17,497 INFO L231 Difference]: Finished difference. Result has 135 places, 165 transitions, 672 flow [2023-11-29 02:50:17,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=135, PETRI_TRANSITIONS=165} [2023-11-29 02:50:17,498 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2023-11-29 02:50:17,498 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 165 transitions, 672 flow [2023-11-29 02:50:17,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:17,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:17,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:17,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:50:17,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:17,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash -147005306, now seen corresponding path program 1 times [2023-11-29 02:50:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415622100] [2023-11-29 02:50:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:17,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:17,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415622100] [2023-11-29 02:50:17,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415622100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:17,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:17,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440743926] [2023-11-29 02:50:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:17,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2023-11-29 02:50:17,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 165 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:17,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:17,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2023-11-29 02:50:17,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:18,765 INFO L124 PetriNetUnfolderBase]: 2966/9951 cut-off events. [2023-11-29 02:50:18,766 INFO L125 PetriNetUnfolderBase]: For 14744/15181 co-relation queries the response was YES. [2023-11-29 02:50:18,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23585 conditions, 9951 events. 2966/9951 cut-off events. For 14744/15181 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 108273 event pairs, 1072 based on Foata normal form. 41/8522 useless extension candidates. Maximal degree in co-relation 23576. Up to 3627 conditions per place. [2023-11-29 02:50:18,851 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 60 selfloop transitions, 22 changer transitions 0/187 dead transitions. [2023-11-29 02:50:18,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 187 transitions, 984 flow [2023-11-29 02:50:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-29 02:50:18,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467153284671532 [2023-11-29 02:50:18,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-29 02:50:18,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-29 02:50:18,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:18,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-29 02:50:18,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:18,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:18,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:18,857 INFO L175 Difference]: Start difference. First operand has 135 places, 165 transitions, 672 flow. Second operand 3 states and 348 transitions. [2023-11-29 02:50:18,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 187 transitions, 984 flow [2023-11-29 02:50:18,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:18,875 INFO L231 Difference]: Finished difference. Result has 137 places, 183 transitions, 870 flow [2023-11-29 02:50:18,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=137, PETRI_TRANSITIONS=183} [2023-11-29 02:50:18,876 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2023-11-29 02:50:18,877 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 183 transitions, 870 flow [2023-11-29 02:50:18,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:18,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:18,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:18,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:50:18,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:18,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -559176797, now seen corresponding path program 1 times [2023-11-29 02:50:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457108291] [2023-11-29 02:50:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457108291] [2023-11-29 02:50:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457108291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138317285] [2023-11-29 02:50:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:18,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:18,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2023-11-29 02:50:18,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 183 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:18,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:18,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2023-11-29 02:50:18,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:20,349 INFO L124 PetriNetUnfolderBase]: 3426/10677 cut-off events. [2023-11-29 02:50:20,350 INFO L125 PetriNetUnfolderBase]: For 20984/21418 co-relation queries the response was YES. [2023-11-29 02:50:20,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27699 conditions, 10677 events. 3426/10677 cut-off events. For 20984/21418 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 116325 event pairs, 1003 based on Foata normal form. 24/8914 useless extension candidates. Maximal degree in co-relation 27689. Up to 3920 conditions per place. [2023-11-29 02:50:20,443 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 73 selfloop transitions, 28 changer transitions 0/210 dead transitions. [2023-11-29 02:50:20,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 210 transitions, 1279 flow [2023-11-29 02:50:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-29 02:50:20,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8588807785888077 [2023-11-29 02:50:20,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-29 02:50:20,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-29 02:50:20,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:20,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-29 02:50:20,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:20,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:20,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:20,449 INFO L175 Difference]: Start difference. First operand has 137 places, 183 transitions, 870 flow. Second operand 3 states and 353 transitions. [2023-11-29 02:50:20,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 210 transitions, 1279 flow [2023-11-29 02:50:20,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 210 transitions, 1183 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:20,497 INFO L231 Difference]: Finished difference. Result has 139 places, 205 transitions, 1124 flow [2023-11-29 02:50:20,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=139, PETRI_TRANSITIONS=205} [2023-11-29 02:50:20,498 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 4 predicate places. [2023-11-29 02:50:20,498 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 205 transitions, 1124 flow [2023-11-29 02:50:20,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:20,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:20,499 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 02:50:20,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:50:20,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:20,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash -602538138, now seen corresponding path program 1 times [2023-11-29 02:50:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161271638] [2023-11-29 02:50:20,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 02:50:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:20,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161271638] [2023-11-29 02:50:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161271638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:20,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:20,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:20,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32495131] [2023-11-29 02:50:20,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:20,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:20,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:20,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2023-11-29 02:50:20,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 205 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:20,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:20,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2023-11-29 02:50:20,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:21,850 INFO L124 PetriNetUnfolderBase]: 4410/12965 cut-off events. [2023-11-29 02:50:21,850 INFO L125 PetriNetUnfolderBase]: For 34048/34623 co-relation queries the response was YES. [2023-11-29 02:50:21,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 12965 events. 4410/12965 cut-off events. For 34048/34623 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 142177 event pairs, 1110 based on Foata normal form. 27/10829 useless extension candidates. Maximal degree in co-relation 37001. Up to 4835 conditions per place. [2023-11-29 02:50:22,105 INFO L140 encePairwiseOnDemand]: 127/137 looper letters, 84 selfloop transitions, 44 changer transitions 0/239 dead transitions. [2023-11-29 02:50:22,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 239 transitions, 1652 flow [2023-11-29 02:50:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-29 02:50:22,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8564476885644768 [2023-11-29 02:50:22,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-29 02:50:22,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-29 02:50:22,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:22,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-29 02:50:22,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,110 INFO L175 Difference]: Start difference. First operand has 139 places, 205 transitions, 1124 flow. Second operand 3 states and 352 transitions. [2023-11-29 02:50:22,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 239 transitions, 1652 flow [2023-11-29 02:50:22,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 239 transitions, 1528 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:22,157 INFO L231 Difference]: Finished difference. Result has 141 places, 235 transitions, 1502 flow [2023-11-29 02:50:22,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=141, PETRI_TRANSITIONS=235} [2023-11-29 02:50:22,158 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2023-11-29 02:50:22,159 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 235 transitions, 1502 flow [2023-11-29 02:50:22,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:22,159 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:22,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:50:22,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 02:50:22,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2039971382, now seen corresponding path program 1 times [2023-11-29 02:50:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:22,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001757313] [2023-11-29 02:50:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:50:22,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:50:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:50:22,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:50:22,193 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:50:22,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-29 02:50:22,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-29 02:50:22,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-29 02:50:22,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-29 02:50:22,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-29 02:50:22,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-29 02:50:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:50:22,195 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:22,196 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:50:22,196 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 02:50:22,222 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:50:22,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 356 flow [2023-11-29 02:50:22,258 INFO L124 PetriNetUnfolderBase]: 18/332 cut-off events. [2023-11-29 02:50:22,258 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:50:22,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 332 events. 18/332 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1225 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 249. Up to 8 conditions per place. [2023-11-29 02:50:22,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 169 transitions, 356 flow [2023-11-29 02:50:22,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 169 transitions, 356 flow [2023-11-29 02:50:22,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:50:22,265 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78cf71ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:50:22,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:50:22,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:50:22,268 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-29 02:50:22,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:50:22,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:22,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:22,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:22,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -513088984, now seen corresponding path program 1 times [2023-11-29 02:50:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613032502] [2023-11-29 02:50:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:22,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613032502] [2023-11-29 02:50:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613032502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:22,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:22,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:22,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182706013] [2023-11-29 02:50:22,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:22,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:50:22,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:22,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:50:22,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:50:22,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 169 [2023-11-29 02:50:22,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 169 transitions, 356 flow. Second operand has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:22,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 169 [2023-11-29 02:50:22,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:22,472 INFO L124 PetriNetUnfolderBase]: 178/1746 cut-off events. [2023-11-29 02:50:22,472 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-29 02:50:22,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1746 events. 178/1746 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 14324 event pairs, 178 based on Foata normal form. 260/1723 useless extension candidates. Maximal degree in co-relation 1379. Up to 298 conditions per place. [2023-11-29 02:50:22,481 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 11 selfloop transitions, 0 changer transitions 0/148 dead transitions. [2023-11-29 02:50:22,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 336 flow [2023-11-29 02:50:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:50:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:50:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions. [2023-11-29 02:50:22,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9171597633136095 [2023-11-29 02:50:22,483 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 310 transitions. [2023-11-29 02:50:22,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions. [2023-11-29 02:50:22,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:22,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions. [2023-11-29 02:50:22,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,485 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,485 INFO L175 Difference]: Start difference. First operand has 167 places, 169 transitions, 356 flow. Second operand 2 states and 310 transitions. [2023-11-29 02:50:22,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 148 transitions, 336 flow [2023-11-29 02:50:22,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 148 transitions, 334 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:22,488 INFO L231 Difference]: Finished difference. Result has 156 places, 148 transitions, 312 flow [2023-11-29 02:50:22,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=312, PETRI_PLACES=156, PETRI_TRANSITIONS=148} [2023-11-29 02:50:22,489 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places. [2023-11-29 02:50:22,489 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 312 flow [2023-11-29 02:50:22,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:22,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:50:22,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:22,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash -81007133, now seen corresponding path program 1 times [2023-11-29 02:50:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174134591] [2023-11-29 02:50:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174134591] [2023-11-29 02:50:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174134591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:22,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:22,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:22,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719366694] [2023-11-29 02:50:22,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:22,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:22,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:22,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:22,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 169 [2023-11-29 02:50:22,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:22,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:22,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 169 [2023-11-29 02:50:22,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:24,710 INFO L124 PetriNetUnfolderBase]: 8153/23088 cut-off events. [2023-11-29 02:50:24,710 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-29 02:50:24,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34955 conditions, 23088 events. 8153/23088 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 265791 event pairs, 6323 based on Foata normal form. 0/19845 useless extension candidates. Maximal degree in co-relation 34949. Up to 10488 conditions per place. [2023-11-29 02:50:24,823 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 34 selfloop transitions, 12 changer transitions 0/165 dead transitions. [2023-11-29 02:50:24,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 438 flow [2023-11-29 02:50:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-29 02:50:24,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8441814595660749 [2023-11-29 02:50:24,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-29 02:50:24,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-29 02:50:24,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:24,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-29 02:50:24,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:24,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:24,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:24,830 INFO L175 Difference]: Start difference. First operand has 156 places, 148 transitions, 312 flow. Second operand 3 states and 428 transitions. [2023-11-29 02:50:24,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 165 transitions, 438 flow [2023-11-29 02:50:24,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 165 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:50:24,834 INFO L231 Difference]: Finished difference. Result has 160 places, 159 transitions, 406 flow [2023-11-29 02:50:24,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=160, PETRI_TRANSITIONS=159} [2023-11-29 02:50:24,835 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -7 predicate places. [2023-11-29 02:50:24,835 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 159 transitions, 406 flow [2023-11-29 02:50:24,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:24,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:24,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:24,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:50:24,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:24,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1116714810, now seen corresponding path program 1 times [2023-11-29 02:50:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963876031] [2023-11-29 02:50:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963876031] [2023-11-29 02:50:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963876031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:24,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838534065] [2023-11-29 02:50:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:24,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169 [2023-11-29 02:50:24,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:24,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:24,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169 [2023-11-29 02:50:24,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:27,670 INFO L124 PetriNetUnfolderBase]: 11165/29147 cut-off events. [2023-11-29 02:50:27,670 INFO L125 PetriNetUnfolderBase]: For 7745/8844 co-relation queries the response was YES. [2023-11-29 02:50:27,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55213 conditions, 29147 events. 11165/29147 cut-off events. For 7745/8844 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 339671 event pairs, 6732 based on Foata normal form. 26/24775 useless extension candidates. Maximal degree in co-relation 55205. Up to 13156 conditions per place. [2023-11-29 02:50:27,870 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 42 selfloop transitions, 19 changer transitions 0/184 dead transitions. [2023-11-29 02:50:27,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 184 transitions, 628 flow [2023-11-29 02:50:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-29 02:50:27,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8560157790927022 [2023-11-29 02:50:27,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-29 02:50:27,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-29 02:50:27,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:27,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-29 02:50:27,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:27,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:27,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:27,877 INFO L175 Difference]: Start difference. First operand has 160 places, 159 transitions, 406 flow. Second operand 3 states and 434 transitions. [2023-11-29 02:50:27,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 184 transitions, 628 flow [2023-11-29 02:50:27,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 184 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:27,960 INFO L231 Difference]: Finished difference. Result has 162 places, 176 transitions, 554 flow [2023-11-29 02:50:27,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=162, PETRI_TRANSITIONS=176} [2023-11-29 02:50:27,961 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -5 predicate places. [2023-11-29 02:50:27,961 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 554 flow [2023-11-29 02:50:27,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:27,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:27,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:50:27,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:27,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 488678962, now seen corresponding path program 1 times [2023-11-29 02:50:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820700900] [2023-11-29 02:50:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:27,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820700900] [2023-11-29 02:50:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820700900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:27,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:27,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:27,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206332794] [2023-11-29 02:50:27,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:27,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:27,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:27,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:28,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 169 [2023-11-29 02:50:28,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:28,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:28,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 169 [2023-11-29 02:50:28,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:31,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [75#L693-7true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:31,986 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:50:31,986 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:31,986 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:31,986 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:32,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][218], [75#L693-7true, 113#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, 185#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true]) [2023-11-29 02:50:32,556 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,556 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,556 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,557 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][199], [Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 113#L693-4true, 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, 185#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 98#L693-14true]) [2023-11-29 02:50:32,573 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,573 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,573 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:32,574 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:33,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][127], [115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, thr1Thread1of3ForFork0InUse, 179#true, 185#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 98#L693-14true, 155#L693-5true]) [2023-11-29 02:50:33,037 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,037 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,037 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,037 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][179], [75#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 170#true, 185#true, thr1Thread1of3ForFork0InUse, 179#true, thr1Thread2of3ForFork0InUse, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), thr1Thread3of3ForFork0InUse, 58#L693-14true, 155#L693-5true]) [2023-11-29 02:50:33,039 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,039 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,039 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:33,039 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:35,602 INFO L124 PetriNetUnfolderBase]: 31822/79067 cut-off events. [2023-11-29 02:50:35,602 INFO L125 PetriNetUnfolderBase]: For 55086/56791 co-relation queries the response was YES. [2023-11-29 02:50:35,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171397 conditions, 79067 events. 31822/79067 cut-off events. For 55086/56791 co-relation queries the response was YES. Maximal size of possible extension queue 2881. Compared 1035877 event pairs, 10576 based on Foata normal form. 71/65212 useless extension candidates. Maximal degree in co-relation 171388. Up to 24692 conditions per place. [2023-11-29 02:50:36,235 INFO L140 encePairwiseOnDemand]: 149/169 looper letters, 65 selfloop transitions, 40 changer transitions 0/226 dead transitions. [2023-11-29 02:50:36,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 226 transitions, 1036 flow [2023-11-29 02:50:36,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-11-29 02:50:36,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2023-11-29 02:50:36,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-11-29 02:50:36,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-11-29 02:50:36,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:36,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-11-29 02:50:36,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:36,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:36,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:36,240 INFO L175 Difference]: Start difference. First operand has 162 places, 176 transitions, 554 flow. Second operand 3 states and 436 transitions. [2023-11-29 02:50:36,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 226 transitions, 1036 flow [2023-11-29 02:50:36,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 226 transitions, 964 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:36,457 INFO L231 Difference]: Finished difference. Result has 164 places, 216 transitions, 972 flow [2023-11-29 02:50:36,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=972, PETRI_PLACES=164, PETRI_TRANSITIONS=216} [2023-11-29 02:50:36,458 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -3 predicate places. [2023-11-29 02:50:36,458 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 216 transitions, 972 flow [2023-11-29 02:50:36,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:36,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:36,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:36,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:50:36,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:36,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -789703729, now seen corresponding path program 1 times [2023-11-29 02:50:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113614120] [2023-11-29 02:50:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113614120] [2023-11-29 02:50:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113614120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:36,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:36,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801828139] [2023-11-29 02:50:36,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:36,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:36,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 169 [2023-11-29 02:50:36,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 216 transitions, 972 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:36,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:36,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 169 [2023-11-29 02:50:36,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:39,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][226], [75#L693-7true, 113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:39,115 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,115 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,115 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,115 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:50:39,281 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:50:39,282 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:39,282 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:39,282 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:39,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:39,565 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,566 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,566 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:39,566 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:40,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:50:40,124 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,124 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,124 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,124 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][170], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:40,170 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,170 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,170 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,170 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:40,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][201], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:40,200 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,200 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,200 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,200 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:40,418 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,418 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,418 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,418 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:40,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 155#L693-5true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:40,440 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event [2023-11-29 02:50:40,440 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:40,440 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:40,441 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:40,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:40,960 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:50:40,960 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:40,960 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:40,960 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:41,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][170], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:41,422 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2023-11-29 02:50:41,422 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:41,422 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:41,422 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:41,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][142], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:50:41,840 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,840 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,841 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,841 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][141], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 187#(= |#race~c~0| 0), 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:50:41,897 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,897 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,897 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:41,897 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:42,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:42,473 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,473 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,473 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,473 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][228], [75#L693-7true, 113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:42,474 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,474 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,474 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,475 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:42,484 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,484 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,484 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,484 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [113#L693-4true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:42,497 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:42,497 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:43,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:43,233 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,233 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,233 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,233 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:43,235 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,235 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,235 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,235 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:43,298 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,298 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,299 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,299 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:43,300 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,301 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,301 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:43,301 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:46,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:46,269 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,269 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,269 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,269 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:46,270 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,270 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,270 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,270 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:46,511 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,511 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,511 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,511 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:46,513 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,514 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,514 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:46,514 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:50:47,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][162], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:47,306 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,306 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,306 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,307 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][204], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 185#true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:47,309 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,309 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,309 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,309 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:47,526 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,527 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,527 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,527 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [30#L701-3true, 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 185#true, 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:47,530 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,530 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,531 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:47,531 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:50:48,483 INFO L124 PetriNetUnfolderBase]: 45455/114802 cut-off events. [2023-11-29 02:50:48,483 INFO L125 PetriNetUnfolderBase]: For 219378/225225 co-relation queries the response was YES. [2023-11-29 02:50:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306745 conditions, 114802 events. 45455/114802 cut-off events. For 219378/225225 co-relation queries the response was YES. Maximal size of possible extension queue 3829. Compared 1566389 event pairs, 17128 based on Foata normal form. 381/95894 useless extension candidates. Maximal degree in co-relation 306735. Up to 49255 conditions per place. [2023-11-29 02:50:49,467 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 91 selfloop transitions, 36 changer transitions 0/254 dead transitions. [2023-11-29 02:50:49,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 254 transitions, 1504 flow [2023-11-29 02:50:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:50:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:50:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-29 02:50:49,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8441814595660749 [2023-11-29 02:50:49,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-29 02:50:49,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-29 02:50:49,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:50:49,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-29 02:50:49,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:49,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:49,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:50:49,473 INFO L175 Difference]: Start difference. First operand has 164 places, 216 transitions, 972 flow. Second operand 3 states and 428 transitions. [2023-11-29 02:50:49,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 254 transitions, 1504 flow [2023-11-29 02:50:49,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 254 transitions, 1394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:50:49,569 INFO L231 Difference]: Finished difference. Result has 166 places, 248 transitions, 1338 flow [2023-11-29 02:50:49,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=166, PETRI_TRANSITIONS=248} [2023-11-29 02:50:49,570 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -1 predicate places. [2023-11-29 02:50:49,570 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 248 transitions, 1338 flow [2023-11-29 02:50:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:49,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:50:49,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:50:49,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:50:49,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:50:49,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:50:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1949648860, now seen corresponding path program 1 times [2023-11-29 02:50:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:50:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245797463] [2023-11-29 02:50:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:50:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:50:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:50:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:50:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:50:49,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245797463] [2023-11-29 02:50:49,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245797463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:50:49,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:50:49,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:50:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904258484] [2023-11-29 02:50:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:50:49,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:50:49,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:50:49,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:50:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:50:49,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169 [2023-11-29 02:50:49,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 248 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:50:49,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:50:49,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169 [2023-11-29 02:50:49,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:50:51,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][246], [75#L693-7true, 113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:51,806 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 02:50:51,806 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:51,806 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:51,806 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:51,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:50:51,959 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2023-11-29 02:50:51,959 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:51,959 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:51,959 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2023-11-29 02:50:52,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][213], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:52,271 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2023-11-29 02:50:52,271 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:52,271 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:52,271 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 02:50:52,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:50:52,912 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,912 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,912 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,912 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:52,977 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,977 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,977 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:52,977 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:50:53,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:53,017 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,017 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,017 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,018 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:53,327 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,328 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,328 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,328 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:53,347 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is not cut-off event [2023-11-29 02:50:53,347 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:53,347 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:53,348 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is not cut-off event [2023-11-29 02:50:53,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][156], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 97#L693-4true, 54#L693-14true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:53,385 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,385 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,385 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,385 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:50:53,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 95#L692-3true, 54#L693-14true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:53,645 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:50:53,645 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:53,645 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:53,645 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:54,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:54,238 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:50:54,238 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:54,238 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:54,238 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:50:54,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:54,598 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2023-11-29 02:50:54,598 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:54,598 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:54,598 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:50:55,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][145], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:50:55,059 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,059 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,059 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,059 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][144], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:50:55,143 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,143 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,143 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,143 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:50:55,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][218], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:55,711 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,711 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,711 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,711 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][249], [75#L693-7true, 113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:55,712 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,712 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,712 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,712 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:55,719 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,719 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,719 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,719 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][213], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:55,728 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,728 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,728 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:55,728 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:50:56,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 197#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,544 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,544 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,544 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,544 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][186], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 155#L693-5true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,546 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,546 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,546 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,546 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,628 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,628 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,628 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,628 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][186], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,629 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,630 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,630 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,630 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:50:56,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][154], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 103#L694true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,867 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,867 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,867 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,867 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 103#L694true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,921 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,921 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 103#L694true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:56,922 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:56,922 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:50:57,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][154], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:57,292 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,292 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,292 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,292 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 95#L692-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:57,337 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,337 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,337 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,337 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][178], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:57,338 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,338 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,338 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:57,338 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:50:59,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][248], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 142#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:50:59,915 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is not cut-off event [2023-11-29 02:50:59,915 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is not cut-off event [2023-11-29 02:50:59,915 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is not cut-off event [2023-11-29 02:50:59,915 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is not cut-off event [2023-11-29 02:51:00,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,237 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,238 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,238 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,238 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][218], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 97#L693-4true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,239 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,239 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,240 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,240 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][213], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,447 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,447 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,447 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,447 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][249], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,448 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,448 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,448 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,448 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][186], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,726 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,727 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,727 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,727 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:00,728 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,728 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,728 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,728 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:00,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][248], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 14#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0), 142#L694-3true]) [2023-11-29 02:51:00,917 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2023-11-29 02:51:00,917 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:00,917 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:00,917 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:02,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][242], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 161#L693-6true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:02,169 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,169 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,169 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,169 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][274], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 159#L693-6true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:02,170 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,170 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,170 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,170 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 02:51:02,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][274], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:02,175 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,175 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,175 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,175 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][242], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 149#L693-15true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:02,320 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,320 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,321 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,321 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][122], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, 191#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 93#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:02,450 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,450 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,450 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:02,450 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 02:51:03,135 INFO L124 PetriNetUnfolderBase]: 53959/130700 cut-off events. [2023-11-29 02:51:03,135 INFO L125 PetriNetUnfolderBase]: For 323114/328723 co-relation queries the response was YES. [2023-11-29 02:51:03,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378446 conditions, 130700 events. 53959/130700 cut-off events. For 323114/328723 co-relation queries the response was YES. Maximal size of possible extension queue 4455. Compared 1772107 event pairs, 17330 based on Foata normal form. 372/105622 useless extension candidates. Maximal degree in co-relation 378435. Up to 56234 conditions per place. [2023-11-29 02:51:04,269 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 119 selfloop transitions, 50 changer transitions 0/300 dead transitions. [2023-11-29 02:51:04,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 300 transitions, 2114 flow [2023-11-29 02:51:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-29 02:51:04,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8560157790927022 [2023-11-29 02:51:04,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-29 02:51:04,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-29 02:51:04,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:04,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-29 02:51:04,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:04,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:04,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:04,274 INFO L175 Difference]: Start difference. First operand has 166 places, 248 transitions, 1338 flow. Second operand 3 states and 434 transitions. [2023-11-29 02:51:04,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 300 transitions, 2114 flow [2023-11-29 02:51:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 300 transitions, 1930 flow, removed 42 selfloop flow, removed 2 redundant places. [2023-11-29 02:51:07,028 INFO L231 Difference]: Finished difference. Result has 168 places, 292 transitions, 1856 flow [2023-11-29 02:51:07,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1856, PETRI_PLACES=168, PETRI_TRANSITIONS=292} [2023-11-29 02:51:07,029 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 1 predicate places. [2023-11-29 02:51:07,029 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 292 transitions, 1856 flow [2023-11-29 02:51:07,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:07,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:07,029 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 02:51:07,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:51:07,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:51:07,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1893983034, now seen corresponding path program 1 times [2023-11-29 02:51:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:07,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377436318] [2023-11-29 02:51:07,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:07,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 02:51:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:07,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377436318] [2023-11-29 02:51:07,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377436318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:07,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138112871] [2023-11-29 02:51:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:07,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169 [2023-11-29 02:51:07,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 292 transitions, 1856 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:07,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:07,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169 [2023-11-29 02:51:07,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:11,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 114#L693-7true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 95#L692-3true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:11,549 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-29 02:51:11,549 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:51:11,549 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:51:11,549 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 02:51:12,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][338], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:12,163 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,163 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,163 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,163 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][336], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:51:12,227 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,227 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,228 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,228 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][335], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 159#L693-6true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:12,232 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,232 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,232 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,232 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 02:51:12,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][344], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:12,361 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 02:51:12,361 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:51:12,361 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:51:12,361 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 02:51:12,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][124], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 114#L693-7true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 95#L692-3true, 155#L693-5true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:12,634 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:51:12,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:12,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:12,634 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:13,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([612] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 197#true, 95#L692-3true, 155#L693-5true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 40#L693-14true, 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:13,428 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 02:51:13,428 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:13,428 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:13,428 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 02:51:13,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][273], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 155#L693-5true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:13,612 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,612 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,612 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,612 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][321], [113#L693-4true, 8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:13,715 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,715 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][322], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:13,728 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,728 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,728 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:13,728 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 114#L693-7true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 155#L693-5true, 203#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:14,141 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2023-11-29 02:51:14,142 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:51:14,142 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:51:14,142 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2023-11-29 02:51:14,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][147], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 185#true, 92#L693-6true]) [2023-11-29 02:51:14,822 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 114#L693-7true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:14,879 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,879 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,879 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,879 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][157], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 159#L693-6true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:14,931 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,931 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,931 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,931 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:14,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][237], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:14,950 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:14,950 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:14,950 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:14,950 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][157], [170#true, 114#L693-7true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 159#L693-6true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:15,065 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,065 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,065 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,065 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][237], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 114#L693-7true, thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,072 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,072 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,072 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,072 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][147], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:51:15,080 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,080 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:51:15,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][236], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,444 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,444 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,444 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,444 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,518 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][226], [170#true, Black: 191#true, thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,518 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,518 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,518 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,519 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][162], [170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 54#L693-14true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,600 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,600 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,600 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,600 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([612] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][175], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 197#true, 203#true, 115#L693-7true, 40#L693-14true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,666 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,666 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,666 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,666 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][236], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,685 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,685 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,685 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,685 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:15,694 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,694 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,694 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:15,694 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:51:16,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,743 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,743 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,751 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,751 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,751 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,751 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([612] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 197#true, 155#L693-5true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 40#L693-14true, 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,859 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,860 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,860 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,860 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [114#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 155#L693-5true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,864 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,864 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,864 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,864 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [8#L693-5true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,906 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,906 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,906 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,906 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 27#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:16,929 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,929 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,929 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:16,929 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([612] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][71], [8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, 40#L693-14true, 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,035 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,035 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,035 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,035 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [8#L693-5true, 170#true, 114#L693-7true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,056 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,056 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,056 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,056 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][124], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,076 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,076 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,076 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,077 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 112#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,078 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,078 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,078 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,078 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 02:51:17,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][368], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 92#L693-6true]) [2023-11-29 02:51:17,530 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,530 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,530 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,530 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 125#L693-3true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 103#L694true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,613 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-29 02:51:17,613 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:51:17,613 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:51:17,613 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-29 02:51:17,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][366], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 159#L693-6true, 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:17,620 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,620 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,620 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,620 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][371], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 23#L693-15true]) [2023-11-29 02:51:17,649 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,649 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,649 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,649 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][369], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 159#L693-6true, 203#true, 197#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 23#L693-15true]) [2023-11-29 02:51:17,765 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,765 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,765 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,765 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:17,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][373], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 97#L693-4true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:17,802 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,802 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,802 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,803 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][374], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:17,899 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,899 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,899 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:17,900 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:18,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][124], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 95#L692-3true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:18,165 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,165 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,165 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,165 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][160], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 203#true, 197#true, 125#L693-3true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:18,219 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is not cut-off event [2023-11-29 02:51:18,219 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:51:18,219 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:51:18,220 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is not cut-off event [2023-11-29 02:51:18,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][133], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 159#L693-6true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 93#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 185#true]) [2023-11-29 02:51:18,233 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,233 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,233 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,234 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][196], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 159#L693-6true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 124#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:18,379 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,379 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,379 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,380 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][132], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 93#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 185#true, 92#L693-6true]) [2023-11-29 02:51:18,407 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,408 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,408 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,408 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([557] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][195], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, 16#L693-6true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 124#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true]) [2023-11-29 02:51:18,499 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,500 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,500 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,500 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 02:51:18,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [75#L693-7true, 170#true, thr1Thread1of3ForFork0InUse, Black: 191#true, thr1Thread2of3ForFork0InUse, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 95#L692-3true, 54#L693-14true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:18,836 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,836 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,836 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:18,836 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 02:51:19,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][357], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 61#L693-5true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,029 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,030 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,030 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,030 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,047 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][124], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, thr1Thread3of3ForFork0InUse, 157#L694-3true, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 95#L692-3true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,047 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,047 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,047 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,048 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][319], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, 110#L693-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 155#L693-5true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:19,183 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,183 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,183 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,183 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][273], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 103#L694true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,230 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,230 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,230 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,231 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][354], [8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,258 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,258 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,258 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,258 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][322], [113#L693-4true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,368 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,368 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,368 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,368 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][356], [113#L693-4true, 8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:19,394 INFO L294 olderBase$Statistics]: this new event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,394 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,394 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,394 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-29 02:51:19,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [75#L693-7true, 170#true, Black: 191#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#L694-3true, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 95#L692-3true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,580 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,580 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,580 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,580 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 02:51:19,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:19,698 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2023-11-29 02:51:19,698 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2023-11-29 02:51:19,698 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2023-11-29 02:51:19,698 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2023-11-29 02:51:20,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [75#L693-7true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, 157#L694-3true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 125#L693-3true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:20,460 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is not cut-off event [2023-11-29 02:51:20,460 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is not cut-off event [2023-11-29 02:51:20,460 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is not cut-off event [2023-11-29 02:51:20,460 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is not cut-off event [2023-11-29 02:51:22,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [170#true, Black: 191#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 203#true, 197#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,098 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,098 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,098 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,098 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,188 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,188 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,188 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,189 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 02:51:22,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][176], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, 19#L694-3true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,366 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,366 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,366 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,366 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][236], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 97#L693-4true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 19#L694-3true, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,368 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,368 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,368 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,368 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([643] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][227], [113#L693-4true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#L694-3true, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 98#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,423 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,423 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,423 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,423 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][288], [113#L693-4true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 170#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#L694-3true, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,425 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,425 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,425 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,425 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][380], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 159#L693-6true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 115#L693-7true, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 185#true, 23#L693-15true]) [2023-11-29 02:51:22,527 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,527 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,527 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,527 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,582 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][382], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:22,582 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-29 02:51:22,583 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 02:51:22,583 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 02:51:22,583 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-29 02:51:22,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L693-13-->L693-14: Formula: (= |v_#race~c~0_16| |v_ULTIMATE.start_thr1_#t~nondet3#1_4|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} OutVars{#race~c~0=|v_#race~c~0_16|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_4|} AuxVars[] AssignedVars[#race~c~0][66], [170#true, Black: 191#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 157#L694-3true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 54#L693-14true, 197#true, 203#true, 115#L693-7true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,589 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,589 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,589 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,589 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 122#L693-7true, 157#L694-3true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 35#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:22,670 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,670 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,670 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,670 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 02:51:22,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([631] L693-5-->L693-6: Formula: (= |v_#race~c~0_4| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_4|} AuxVars[] AssignedVars[#race~c~0][194], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 159#L693-6true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 93#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 185#true, 23#L693-15true]) [2023-11-29 02:51:22,972 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:22,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 02:51:23,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L693-2-->L693-3: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_1|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_1|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][286], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 14#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 203#true, 125#L693-3true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), Black: 187#(= |#race~c~0| 0), 142#L694-3true]) [2023-11-29 02:51:23,250 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is not cut-off event [2023-11-29 02:51:23,250 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:23,250 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:23,250 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is not cut-off event [2023-11-29 02:51:23,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][319], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 103#L694true, 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:23,488 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,488 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,488 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,488 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][357], [170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 110#L693-4true, 63#L694true, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 197#true, 203#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0)]) [2023-11-29 02:51:23,525 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,525 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,525 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,526 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([581] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][377], [8#L693-5true, 170#true, Black: 193#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 199#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet3#1|), 149#L693-15true, 203#true, 197#true, Black: 175#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 181#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 58#L693-14true, Black: 187#(= |#race~c~0| 0), 23#L693-15true]) [2023-11-29 02:51:23,547 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,548 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,548 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:23,548 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 02:51:25,963 INFO L124 PetriNetUnfolderBase]: 75131/176052 cut-off events. [2023-11-29 02:51:25,963 INFO L125 PetriNetUnfolderBase]: For 613069/639126 co-relation queries the response was YES. [2023-11-29 02:51:26,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560921 conditions, 176052 events. 75131/176052 cut-off events. For 613069/639126 co-relation queries the response was YES. Maximal size of possible extension queue 5985. Compared 2426309 event pairs, 19706 based on Foata normal form. 466/140286 useless extension candidates. Maximal degree in co-relation 560909. Up to 75134 conditions per place. [2023-11-29 02:51:27,480 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 148 selfloop transitions, 102 changer transitions 0/383 dead transitions. [2023-11-29 02:51:27,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 383 transitions, 3199 flow [2023-11-29 02:51:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-29 02:51:27,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.854043392504931 [2023-11-29 02:51:27,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-29 02:51:27,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-29 02:51:27,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:27,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-29 02:51:27,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:27,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:27,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:27,486 INFO L175 Difference]: Start difference. First operand has 168 places, 292 transitions, 1856 flow. Second operand 3 states and 433 transitions. [2023-11-29 02:51:27,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 383 transitions, 3199 flow [2023-11-29 02:51:33,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 383 transitions, 2923 flow, removed 62 selfloop flow, removed 2 redundant places. [2023-11-29 02:51:33,878 INFO L231 Difference]: Finished difference. Result has 170 places, 376 transitions, 2982 flow [2023-11-29 02:51:33,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2982, PETRI_PLACES=170, PETRI_TRANSITIONS=376} [2023-11-29 02:51:33,878 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 3 predicate places. [2023-11-29 02:51:33,878 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 376 transitions, 2982 flow [2023-11-29 02:51:33,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:33,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:33,879 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 02:51:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:51:33,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:51:33,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:33,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1723494414, now seen corresponding path program 1 times [2023-11-29 02:51:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:33,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575972802] [2023-11-29 02:51:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 02:51:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575972802] [2023-11-29 02:51:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575972802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:33,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:51:33,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594300169] [2023-11-29 02:51:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:33,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:33,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 169 [2023-11-29 02:51:33,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 376 transitions, 2982 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:33,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:33,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 169 [2023-11-29 02:51:33,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:34,138 INFO L124 PetriNetUnfolderBase]: 32/1189 cut-off events. [2023-11-29 02:51:34,138 INFO L125 PetriNetUnfolderBase]: For 1533/1533 co-relation queries the response was YES. [2023-11-29 02:51:34,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 1189 events. 32/1189 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7956 event pairs, 12 based on Foata normal form. 62/1168 useless extension candidates. Maximal degree in co-relation 2212. Up to 114 conditions per place. [2023-11-29 02:51:34,142 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 6 selfloop transitions, 8 changer transitions 3/141 dead transitions. [2023-11-29 02:51:34,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 141 transitions, 492 flow [2023-11-29 02:51:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-29 02:51:34,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8875739644970414 [2023-11-29 02:51:34,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-29 02:51:34,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-29 02:51:34,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:34,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-29 02:51:34,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,148 INFO L175 Difference]: Start difference. First operand has 170 places, 376 transitions, 2982 flow. Second operand 3 states and 450 transitions. [2023-11-29 02:51:34,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 141 transitions, 492 flow [2023-11-29 02:51:34,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 141 transitions, 336 flow, removed 58 selfloop flow, removed 14 redundant places. [2023-11-29 02:51:34,153 INFO L231 Difference]: Finished difference. Result has 149 places, 136 transitions, 304 flow [2023-11-29 02:51:34,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=149, PETRI_TRANSITIONS=136} [2023-11-29 02:51:34,154 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -18 predicate places. [2023-11-29 02:51:34,154 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 136 transitions, 304 flow [2023-11-29 02:51:34,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:34,155 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 02:51:34,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:51:34,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:51:34,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -732032720, now seen corresponding path program 1 times [2023-11-29 02:51:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586559579] [2023-11-29 02:51:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 02:51:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586559579] [2023-11-29 02:51:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586559579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740939176] [2023-11-29 02:51:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:34,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:34,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:34,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169 [2023-11-29 02:51:34,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 136 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:34,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169 [2023-11-29 02:51:34,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:34,394 INFO L124 PetriNetUnfolderBase]: 53/1128 cut-off events. [2023-11-29 02:51:34,394 INFO L125 PetriNetUnfolderBase]: For 147/165 co-relation queries the response was YES. [2023-11-29 02:51:34,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 1128 events. 53/1128 cut-off events. For 147/165 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7574 event pairs, 49 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1638. Up to 287 conditions per place. [2023-11-29 02:51:34,398 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 25 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2023-11-29 02:51:34,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 136 transitions, 363 flow [2023-11-29 02:51:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-11-29 02:51:34,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8185404339250493 [2023-11-29 02:51:34,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-11-29 02:51:34,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-11-29 02:51:34,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:34,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-11-29 02:51:34,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,403 INFO L175 Difference]: Start difference. First operand has 149 places, 136 transitions, 304 flow. Second operand 3 states and 415 transitions. [2023-11-29 02:51:34,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 136 transitions, 363 flow [2023-11-29 02:51:34,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 136 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:51:34,406 INFO L231 Difference]: Finished difference. Result has 146 places, 135 transitions, 298 flow [2023-11-29 02:51:34,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=146, PETRI_TRANSITIONS=135} [2023-11-29 02:51:34,407 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -21 predicate places. [2023-11-29 02:51:34,407 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 298 flow [2023-11-29 02:51:34,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:34,408 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 02:51:34,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:51:34,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:51:34,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1179652468, now seen corresponding path program 1 times [2023-11-29 02:51:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799068015] [2023-11-29 02:51:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 02:51:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:34,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799068015] [2023-11-29 02:51:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799068015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691809421] [2023-11-29 02:51:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:34,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:34,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:34,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 169 [2023-11-29 02:51:34,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:34,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 169 [2023-11-29 02:51:34,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:34,627 INFO L124 PetriNetUnfolderBase]: 47/1114 cut-off events. [2023-11-29 02:51:34,627 INFO L125 PetriNetUnfolderBase]: For 104/125 co-relation queries the response was YES. [2023-11-29 02:51:34,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 1114 events. 47/1114 cut-off events. For 104/125 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7378 event pairs, 47 based on Foata normal form. 1/1063 useless extension candidates. Maximal degree in co-relation 1563. Up to 281 conditions per place. [2023-11-29 02:51:34,630 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 24 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-11-29 02:51:34,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 134 transitions, 348 flow [2023-11-29 02:51:34,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:34,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-11-29 02:51:34,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8165680473372781 [2023-11-29 02:51:34,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-11-29 02:51:34,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-11-29 02:51:34,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:34,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-11-29 02:51:34,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 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) [2023-11-29 02:51:34,635 INFO L175 Difference]: Start difference. First operand has 146 places, 135 transitions, 298 flow. Second operand 3 states and 414 transitions. [2023-11-29 02:51:34,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 134 transitions, 348 flow [2023-11-29 02:51:34,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 134 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:51:34,638 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 296 flow [2023-11-29 02:51:34,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2023-11-29 02:51:34,639 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, -22 predicate places. [2023-11-29 02:51:34,639 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 296 flow [2023-11-29 02:51:34,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:34,640 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:51:34,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 02:51:34,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 894769424, now seen corresponding path program 1 times [2023-11-29 02:51:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799631704] [2023-11-29 02:51:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:51:34,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:51:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:51:34,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:51:34,674 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2023-11-29 02:51:34,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2023-11-29 02:51:34,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2023-11-29 02:51:34,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:51:34,676 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:34,676 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 02:51:34,676 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 02:51:34,703 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:51:34,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 201 transitions, 430 flow [2023-11-29 02:51:34,756 INFO L124 PetriNetUnfolderBase]: 23/419 cut-off events. [2023-11-29 02:51:34,756 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 02:51:34,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 419 events. 23/419 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1643 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 340. Up to 10 conditions per place. [2023-11-29 02:51:34,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 201 transitions, 430 flow [2023-11-29 02:51:34,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 201 transitions, 430 flow [2023-11-29 02:51:34,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:51:34,763 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78cf71ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:51:34,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-29 02:51:34,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:51:34,766 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-29 02:51:34,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:51:34,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:34,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:34,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 02:51:34,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1023268376, now seen corresponding path program 1 times [2023-11-29 02:51:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:34,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848547902] [2023-11-29 02:51:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:34,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848547902] [2023-11-29 02:51:34,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848547902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:34,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31355086] [2023-11-29 02:51:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:34,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:51:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:51:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:51:34,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 201 [2023-11-29 02:51:34,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 201 transitions, 430 flow. Second operand has 2 states, 2 states have (on average 172.0) internal successors, (344), 2 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:34,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:34,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 201 [2023-11-29 02:51:34,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:35,420 INFO L124 PetriNetUnfolderBase]: 772/5391 cut-off events. [2023-11-29 02:51:35,420 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2023-11-29 02:51:35,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6713 conditions, 5391 events. 772/5391 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 57478 event pairs, 772 based on Foata normal form. 971/5482 useless extension candidates. Maximal degree in co-relation 4431. Up to 1135 conditions per place. [2023-11-29 02:51:35,460 INFO L140 encePairwiseOnDemand]: 190/201 looper letters, 14 selfloop transitions, 0 changer transitions 0/175 dead transitions. [2023-11-29 02:51:35,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 175 transitions, 406 flow [2023-11-29 02:51:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:51:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 02:51:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 367 transitions. [2023-11-29 02:51:35,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9129353233830846 [2023-11-29 02:51:35,462 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 367 transitions. [2023-11-29 02:51:35,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 367 transitions. [2023-11-29 02:51:35,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:35,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 367 transitions. [2023-11-29 02:51:35,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:35,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:35,464 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:35,464 INFO L175 Difference]: Start difference. First operand has 199 places, 201 transitions, 430 flow. Second operand 2 states and 367 transitions. [2023-11-29 02:51:35,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 175 transitions, 406 flow [2023-11-29 02:51:35,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 175 transitions, 400 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 02:51:35,468 INFO L231 Difference]: Finished difference. Result has 185 places, 175 transitions, 372 flow [2023-11-29 02:51:35,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=372, PETRI_PLACES=185, PETRI_TRANSITIONS=175} [2023-11-29 02:51:35,469 INFO L281 CegarLoopForPetriNet]: 199 programPoint places, -14 predicate places. [2023-11-29 02:51:35,469 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 175 transitions, 372 flow [2023-11-29 02:51:35,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 172.0) internal successors, (344), 2 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:35,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:35,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:35,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:51:35,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 02:51:35,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1054185932, now seen corresponding path program 1 times [2023-11-29 02:51:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:35,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7856133] [2023-11-29 02:51:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7856133] [2023-11-29 02:51:35,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7856133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:35,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:35,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098252396] [2023-11-29 02:51:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:35,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:35,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 201 [2023-11-29 02:51:35,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 175 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:35,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:35,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 201 [2023-11-29 02:51:35,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:51:51,870 INFO L124 PetriNetUnfolderBase]: 67361/157955 cut-off events. [2023-11-29 02:51:51,870 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2023-11-29 02:51:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247775 conditions, 157955 events. 67361/157955 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 4097. Compared 2103250 event pairs, 53467 based on Foata normal form. 0/138330 useless extension candidates. Maximal degree in co-relation 247768. Up to 80464 conditions per place. [2023-11-29 02:51:53,219 INFO L140 encePairwiseOnDemand]: 185/201 looper letters, 42 selfloop transitions, 15 changer transitions 0/197 dead transitions. [2023-11-29 02:51:53,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 197 transitions, 530 flow [2023-11-29 02:51:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:51:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:51:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-11-29 02:51:53,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8424543946932007 [2023-11-29 02:51:53,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-11-29 02:51:53,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-11-29 02:51:53,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:51:53,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-11-29 02:51:53,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:53,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:53,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:53,225 INFO L175 Difference]: Start difference. First operand has 185 places, 175 transitions, 372 flow. Second operand 3 states and 508 transitions. [2023-11-29 02:51:53,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 197 transitions, 530 flow [2023-11-29 02:51:53,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 197 transitions, 530 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:51:53,229 INFO L231 Difference]: Finished difference. Result has 189 places, 189 transitions, 490 flow [2023-11-29 02:51:53,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=189, PETRI_TRANSITIONS=189} [2023-11-29 02:51:53,229 INFO L281 CegarLoopForPetriNet]: 199 programPoint places, -10 predicate places. [2023-11-29 02:51:53,229 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 189 transitions, 490 flow [2023-11-29 02:51:53,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:53,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:51:53,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:51:53,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:51:53,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 02:51:53,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:51:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1494562630, now seen corresponding path program 1 times [2023-11-29 02:51:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:51:53,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042455835] [2023-11-29 02:51:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:51:53,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:51:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:51:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:51:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:51:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042455835] [2023-11-29 02:51:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042455835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:51:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:51:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:51:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284368399] [2023-11-29 02:51:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:51:53,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:51:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:51:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:51:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:51:53,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 201 [2023-11-29 02:51:53,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 189 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:51:53,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:51:53,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 201 [2023-11-29 02:51:53,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:52:16,155 INFO L124 PetriNetUnfolderBase]: 95535/209395 cut-off events. [2023-11-29 02:52:16,155 INFO L125 PetriNetUnfolderBase]: For 60799/67911 co-relation queries the response was YES. [2023-11-29 02:52:16,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416789 conditions, 209395 events. 95535/209395 cut-off events. For 60799/67911 co-relation queries the response was YES. Maximal size of possible extension queue 5923. Compared 2782838 event pairs, 60575 based on Foata normal form. 173/180765 useless extension candidates. Maximal degree in co-relation 416780. Up to 106537 conditions per place. [2023-11-29 02:52:18,148 INFO L140 encePairwiseOnDemand]: 185/201 looper letters, 54 selfloop transitions, 25 changer transitions 0/223 dead transitions. [2023-11-29 02:52:18,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 223 transitions, 789 flow [2023-11-29 02:52:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:52:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-11-29 02:52:18,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8540630182421227 [2023-11-29 02:52:18,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-11-29 02:52:18,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-11-29 02:52:18,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:52:18,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-11-29 02:52:18,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:18,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:18,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:18,153 INFO L175 Difference]: Start difference. First operand has 189 places, 189 transitions, 490 flow. Second operand 3 states and 515 transitions. [2023-11-29 02:52:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 223 transitions, 789 flow [2023-11-29 02:52:20,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 223 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:52:20,538 INFO L231 Difference]: Finished difference. Result has 191 places, 212 transitions, 692 flow [2023-11-29 02:52:20,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=191, PETRI_TRANSITIONS=212} [2023-11-29 02:52:20,539 INFO L281 CegarLoopForPetriNet]: 199 programPoint places, -8 predicate places. [2023-11-29 02:52:20,539 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 212 transitions, 692 flow [2023-11-29 02:52:20,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:20,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:52:20,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:20,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:52:20,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 02:52:20,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 452989266, now seen corresponding path program 1 times [2023-11-29 02:52:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:52:20,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912494375] [2023-11-29 02:52:20,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:52:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:52:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912494375] [2023-11-29 02:52:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912494375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:52:20,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134148692] [2023-11-29 02:52:20,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:52:20,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:20,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:20,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 201 [2023-11-29 02:52:20,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 212 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:20,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:52:20,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 201 [2023-11-29 02:52:20,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:52:29,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([758] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 131#L693-7true, 219#(= |#race~c~0| 0), 211#true, Black: 207#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 15#L693-6true, Black: 213#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~c~0|), 202#true, 121#L693-7true]) [2023-11-29 02:52:29,861 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 02:52:29,861 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:52:29,861 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:52:29,861 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 02:52:31,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L693-13-->L693-14: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of4ForFork0_#t~nondet3#1=|v_thr1Thread3of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][252], [thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 107#L693-14true, 131#L693-7true, 217#true, 211#true, Black: 207#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~c~0|), 135#L693-4true, 202#true]) [2023-11-29 02:52:31,224 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,224 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,224 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,225 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([875] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of4ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of4ForFork0_#t~nondet3#1=|v_thr1Thread2of4ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][211], [thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 44#L693-14true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0NotInUse, 217#true, 211#true, Black: 207#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 74#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, Black: 213#(= |thr1Thread1of4ForFork0_#t~nondet2#1| |#race~c~0|), 135#L693-4true, 202#true, 121#L693-7true]) [2023-11-29 02:52:31,238 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,238 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,238 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-29 02:52:31,238 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event