./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a 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_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:10:24,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:10:24,755 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:10:24,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:10:24,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:10:24,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:10:24,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:10:24,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:10:24,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:10:24,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:10:24,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:10:24,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:10:24,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:10:24,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:10:24,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:10:24,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:10:24,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:10:24,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:10:24,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:10:24,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:10:24,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:10:24,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:10:24,802 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:10:24,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:10:24,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:10:24,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:10:24,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:10:24,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:10:24,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:10:24,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:10:24,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:10:24,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:24,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:10:24,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:10:24,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:10:24,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:10:24,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:10:24,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:10:24,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:10:24,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:10:24,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:10:24,813 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_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 [2024-10-31 22:10:25,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:10:25,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:10:25,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:10:25,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:10:25,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:10:25,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i Unable to find full path for "g++" [2024-10-31 22:10:27,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:10:27,601 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:10:27,602 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i [2024-10-31 22:10:27,627 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/data/af9828083/342abc6f436b4877892ca61bd784a228/FLAGce7b60b77 [2024-10-31 22:10:27,650 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/data/af9828083/342abc6f436b4877892ca61bd784a228 [2024-10-31 22:10:27,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:10:27,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:10:27,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:27,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:10:27,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:10:27,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:27" (1/1) ... [2024-10-31 22:10:27,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa00ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:27, skipping insertion in model container [2024-10-31 22:10:27,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:10:27" (1/1) ... [2024-10-31 22:10:27,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:10:28,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:28,331 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:10:28,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:10:28,468 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:10:28,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28 WrapperNode [2024-10-31 22:10:28,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:10:28,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:28,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:10:28,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:10:28,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,531 INFO L138 Inliner]: procedures = 277, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2024-10-31 22:10:28,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:10:28,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:10:28,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:10:28,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:10:28,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:10:28,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:10:28,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:10:28,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:10:28,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (1/1) ... [2024-10-31 22:10:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:10:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:10:28,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:10:28,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f97a0ae8-8270-48f0-a75f-ed95cd632161/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:10:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:10:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:10:28,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:10:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:10:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:10:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:10:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:10:28,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:10:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-31 22:10:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-31 22:10:28,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:10:28,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:10:28,764 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:10:29,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:10:29,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:10:29,500 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:10:29,503 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:10:29,569 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:10:29,569 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-31 22:10:29,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:29 BoogieIcfgContainer [2024-10-31 22:10:29,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:10:29,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:10:29,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:10:29,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:10:29,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:10:27" (1/3) ... [2024-10-31 22:10:29,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38564e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:29, skipping insertion in model container [2024-10-31 22:10:29,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:10:28" (2/3) ... [2024-10-31 22:10:29,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38564e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:10:29, skipping insertion in model container [2024-10-31 22:10:29,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:10:29" (3/3) ... [2024-10-31 22:10:29,587 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-3.i [2024-10-31 22:10:29,620 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:10:29,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-31 22:10:29,620 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:10:29,723 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-31 22:10:29,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 202 transitions, 411 flow [2024-10-31 22:10:29,968 INFO L124 PetriNetUnfolderBase]: 30/300 cut-off events. [2024-10-31 22:10:29,968 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:10:29,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 30/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 611 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-31 22:10:29,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 202 transitions, 411 flow [2024-10-31 22:10:29,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 202 transitions, 411 flow [2024-10-31 22:10:30,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:10:30,013 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@308a5508, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:10:30,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-31 22:10:30,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:10:30,025 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-31 22:10:30,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:10:30,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:30,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:30,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1455706932, now seen corresponding path program 1 times [2024-10-31 22:10:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094697424] [2024-10-31 22:10:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094697424] [2024-10-31 22:10:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094697424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265805000] [2024-10-31 22:10:30,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:30,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:30,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202 [2024-10-31 22:10:30,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:30,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:30,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202 [2024-10-31 22:10:30,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:30,759 INFO L124 PetriNetUnfolderBase]: 115/750 cut-off events. [2024-10-31 22:10:30,759 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:10:30,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 750 events. 115/750 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3680 event pairs, 17 based on Foata normal form. 10/622 useless extension candidates. Maximal degree in co-relation 712. Up to 122 conditions per place. [2024-10-31 22:10:30,774 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 19 selfloop transitions, 2 changer transitions 2/197 dead transitions. [2024-10-31 22:10:30,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 443 flow [2024-10-31 22:10:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2024-10-31 22:10:30,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9141914191419142 [2024-10-31 22:10:30,800 INFO L175 Difference]: Start difference. First operand has 187 places, 202 transitions, 411 flow. Second operand 3 states and 554 transitions. [2024-10-31 22:10:30,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 443 flow [2024-10-31 22:10:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 197 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:30,813 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 401 flow [2024-10-31 22:10:30,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2024-10-31 22:10:30,822 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-31 22:10:30,822 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 401 flow [2024-10-31 22:10:30,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:30,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:30,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:30,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:10:30,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash 66535494, now seen corresponding path program 1 times [2024-10-31 22:10:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:30,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753164466] [2024-10-31 22:10:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753164466] [2024-10-31 22:10:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753164466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:30,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:30,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195686363] [2024-10-31 22:10:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:30,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:30,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:31,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:10:31,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:31,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:31,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:10:31,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:31,342 INFO L124 PetriNetUnfolderBase]: 200/978 cut-off events. [2024-10-31 22:10:31,343 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:10:31,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 978 events. 200/978 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5281 event pairs, 21 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 1190. Up to 146 conditions per place. [2024-10-31 22:10:31,353 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 35 selfloop transitions, 8 changer transitions 0/214 dead transitions. [2024-10-31 22:10:31,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 214 transitions, 525 flow [2024-10-31 22:10:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2024-10-31 22:10:31,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372937293729373 [2024-10-31 22:10:31,356 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 401 flow. Second operand 3 states and 568 transitions. [2024-10-31 22:10:31,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 214 transitions, 525 flow [2024-10-31 22:10:31,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 214 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:31,367 INFO L231 Difference]: Finished difference. Result has 188 places, 203 transitions, 467 flow [2024-10-31 22:10:31,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=188, PETRI_TRANSITIONS=203} [2024-10-31 22:10:31,369 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-31 22:10:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 203 transitions, 467 flow [2024-10-31 22:10:31,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:31,370 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:31,370 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:10:31,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1209265366, now seen corresponding path program 1 times [2024-10-31 22:10:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972825049] [2024-10-31 22:10:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972825049] [2024-10-31 22:10:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972825049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896884269] [2024-10-31 22:10:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:31,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:31,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:31,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 202 [2024-10-31 22:10:31,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 203 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:31,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:31,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 202 [2024-10-31 22:10:31,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:31,809 INFO L124 PetriNetUnfolderBase]: 169/1030 cut-off events. [2024-10-31 22:10:31,809 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-31 22:10:31,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 1030 events. 169/1030 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5939 event pairs, 21 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1145. Up to 145 conditions per place. [2024-10-31 22:10:31,817 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 25 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-10-31 22:10:31,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 210 transitions, 535 flow [2024-10-31 22:10:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2024-10-31 22:10:31,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.929042904290429 [2024-10-31 22:10:31,820 INFO L175 Difference]: Start difference. First operand has 188 places, 203 transitions, 467 flow. Second operand 3 states and 563 transitions. [2024-10-31 22:10:31,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 210 transitions, 535 flow [2024-10-31 22:10:31,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 210 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:31,831 INFO L231 Difference]: Finished difference. Result has 187 places, 203 transitions, 461 flow [2024-10-31 22:10:31,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=187, PETRI_TRANSITIONS=203} [2024-10-31 22:10:31,832 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-10-31 22:10:31,832 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 203 transitions, 461 flow [2024-10-31 22:10:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:31,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:31,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:31,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:10:31,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1080239920, now seen corresponding path program 1 times [2024-10-31 22:10:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576943930] [2024-10-31 22:10:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576943930] [2024-10-31 22:10:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576943930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169263763] [2024-10-31 22:10:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:32,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:32,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:10:32,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 203 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:32,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:32,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:10:32,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:32,445 INFO L124 PetriNetUnfolderBase]: 183/1034 cut-off events. [2024-10-31 22:10:32,445 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:10:32,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 1034 events. 183/1034 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5871 event pairs, 34 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 1130. Up to 166 conditions per place. [2024-10-31 22:10:32,453 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 33 selfloop transitions, 2 changer transitions 5/219 dead transitions. [2024-10-31 22:10:32,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 219 transitions, 573 flow [2024-10-31 22:10:32,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2024-10-31 22:10:32,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8952145214521452 [2024-10-31 22:10:32,457 INFO L175 Difference]: Start difference. First operand has 187 places, 203 transitions, 461 flow. Second operand 6 states and 1085 transitions. [2024-10-31 22:10:32,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 219 transitions, 573 flow [2024-10-31 22:10:32,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 219 transitions, 573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:32,465 INFO L231 Difference]: Finished difference. Result has 196 places, 203 transitions, 479 flow [2024-10-31 22:10:32,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=196, PETRI_TRANSITIONS=203} [2024-10-31 22:10:32,467 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-31 22:10:32,467 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 203 transitions, 479 flow [2024-10-31 22:10:32,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:32,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:32,469 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:32,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:10:32,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:32,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash 598568740, now seen corresponding path program 1 times [2024-10-31 22:10:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300766743] [2024-10-31 22:10:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:32,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300766743] [2024-10-31 22:10:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300766743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:32,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:10:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470850050] [2024-10-31 22:10:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:32,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 202 [2024-10-31 22:10:32,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 203 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:32,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:32,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 202 [2024-10-31 22:10:32,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:32,883 INFO L124 PetriNetUnfolderBase]: 162/901 cut-off events. [2024-10-31 22:10:32,884 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-31 22:10:32,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 901 events. 162/901 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4665 event pairs, 29 based on Foata normal form. 1/758 useless extension candidates. Maximal degree in co-relation 1078. Up to 142 conditions per place. [2024-10-31 22:10:32,892 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 22 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-10-31 22:10:32,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 210 transitions, 541 flow [2024-10-31 22:10:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2024-10-31 22:10:32,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372937293729373 [2024-10-31 22:10:32,895 INFO L175 Difference]: Start difference. First operand has 196 places, 203 transitions, 479 flow. Second operand 3 states and 568 transitions. [2024-10-31 22:10:32,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 210 transitions, 541 flow [2024-10-31 22:10:32,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 210 transitions, 527 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:10:32,901 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 477 flow [2024-10-31 22:10:32,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2024-10-31 22:10:32,903 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2024-10-31 22:10:32,903 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 477 flow [2024-10-31 22:10:32,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:32,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:32,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:32,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:10:32,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash 791856797, now seen corresponding path program 1 times [2024-10-31 22:10:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:32,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689430258] [2024-10-31 22:10:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689430258] [2024-10-31 22:10:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689430258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917361745] [2024-10-31 22:10:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:33,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:33,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:33,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:33,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:10:33,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:33,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:33,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:10:33,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:33,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 135#L1062-14true, Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:10:33,356 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-31 22:10:33,356 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:10:33,357 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:10:33,357 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:10:33,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L1062-19true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:10:33,378 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-31 22:10:33,378 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:10:33,379 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-31 22:10:33,379 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-31 22:10:33,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [38#L1050-16true, Black: 193#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 44#L1062-27true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, 213#true, 217#true, 188#true]) [2024-10-31 22:10:33,413 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-31 22:10:33,413 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:10:33,413 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-31 22:10:33,413 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-31 22:10:33,533 INFO L124 PetriNetUnfolderBase]: 379/1614 cut-off events. [2024-10-31 22:10:33,533 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-31 22:10:33,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 1614 events. 379/1614 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11024 event pairs, 55 based on Foata normal form. 1/1414 useless extension candidates. Maximal degree in co-relation 2127. Up to 219 conditions per place. [2024-10-31 22:10:33,547 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 49 selfloop transitions, 12 changer transitions 0/237 dead transitions. [2024-10-31 22:10:33,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 237 transitions, 667 flow [2024-10-31 22:10:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2024-10-31 22:10:33,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9232673267326733 [2024-10-31 22:10:33,551 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 477 flow. Second operand 4 states and 746 transitions. [2024-10-31 22:10:33,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 237 transitions, 667 flow [2024-10-31 22:10:33,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 237 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:33,559 INFO L231 Difference]: Finished difference. Result has 196 places, 214 transitions, 567 flow [2024-10-31 22:10:33,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2024-10-31 22:10:33,561 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-31 22:10:33,562 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 214 transitions, 567 flow [2024-10-31 22:10:33,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:33,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:33,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:33,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:10:33,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 58700373, now seen corresponding path program 1 times [2024-10-31 22:10:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169923891] [2024-10-31 22:10:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169923891] [2024-10-31 22:10:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169923891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093093188] [2024-10-31 22:10:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:33,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:33,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:10:33,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 214 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:33,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:33,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:10:33,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:34,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 193#true, 224#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 217#true, Black: 219#(not (= ~threads_mask~0 0)), 188#true, 119#L1063-10true]) [2024-10-31 22:10:34,079 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-31 22:10:34,079 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:10:34,079 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:10:34,080 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:10:34,216 INFO L124 PetriNetUnfolderBase]: 386/1593 cut-off events. [2024-10-31 22:10:34,216 INFO L125 PetriNetUnfolderBase]: For 479/593 co-relation queries the response was YES. [2024-10-31 22:10:34,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2617 conditions, 1593 events. 386/1593 cut-off events. For 479/593 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10738 event pairs, 52 based on Foata normal form. 23/1423 useless extension candidates. Maximal degree in co-relation 2414. Up to 226 conditions per place. [2024-10-31 22:10:34,228 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 49 selfloop transitions, 13 changer transitions 0/238 dead transitions. [2024-10-31 22:10:34,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 238 transitions, 753 flow [2024-10-31 22:10:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2024-10-31 22:10:34,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207920792079208 [2024-10-31 22:10:34,232 INFO L175 Difference]: Start difference. First operand has 196 places, 214 transitions, 567 flow. Second operand 4 states and 744 transitions. [2024-10-31 22:10:34,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 238 transitions, 753 flow [2024-10-31 22:10:34,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 238 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:34,240 INFO L231 Difference]: Finished difference. Result has 201 places, 217 transitions, 626 flow [2024-10-31 22:10:34,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=201, PETRI_TRANSITIONS=217} [2024-10-31 22:10:34,242 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 14 predicate places. [2024-10-31 22:10:34,243 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 217 transitions, 626 flow [2024-10-31 22:10:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:34,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:34,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:10:34,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 918543710, now seen corresponding path program 1 times [2024-10-31 22:10:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999715972] [2024-10-31 22:10:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:34,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:34,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999715972] [2024-10-31 22:10:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999715972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:34,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074185807] [2024-10-31 22:10:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:34,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:34,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:10:34,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 217 transitions, 626 flow. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:34,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:34,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:10:34,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:34,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 119#L1063-10true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:34,780 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-31 22:10:34,780 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:10:34,780 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:10:34,780 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:10:34,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:34,787 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:10:34,787 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:34,787 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:34,787 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:34,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 125#L1063-16true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:34,807 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2024-10-31 22:10:34,807 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:10:34,807 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:34,807 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-31 22:10:34,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 93#L1063-20true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:34,847 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-31 22:10:34,847 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:10:34,847 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:10:34,847 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:10:34,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][181], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), 224#true, Black: 198#true, 217#true, 38#L1050-16true, 156#L1064-3true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:34,869 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-31 22:10:34,869 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:10:34,869 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:10:34,869 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:10:34,910 INFO L124 PetriNetUnfolderBase]: 431/1736 cut-off events. [2024-10-31 22:10:34,910 INFO L125 PetriNetUnfolderBase]: For 1136/1267 co-relation queries the response was YES. [2024-10-31 22:10:34,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3158 conditions, 1736 events. 431/1736 cut-off events. For 1136/1267 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11963 event pairs, 60 based on Foata normal form. 22/1539 useless extension candidates. Maximal degree in co-relation 2930. Up to 278 conditions per place. [2024-10-31 22:10:34,927 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 47 selfloop transitions, 15 changer transitions 0/241 dead transitions. [2024-10-31 22:10:34,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 241 transitions, 827 flow [2024-10-31 22:10:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-31 22:10:34,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-31 22:10:34,930 INFO L175 Difference]: Start difference. First operand has 201 places, 217 transitions, 626 flow. Second operand 4 states and 743 transitions. [2024-10-31 22:10:34,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 241 transitions, 827 flow [2024-10-31 22:10:34,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 241 transitions, 811 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:34,938 INFO L231 Difference]: Finished difference. Result has 205 places, 221 transitions, 693 flow [2024-10-31 22:10:34,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=693, PETRI_PLACES=205, PETRI_TRANSITIONS=221} [2024-10-31 22:10:34,941 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-31 22:10:34,941 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 221 transitions, 693 flow [2024-10-31 22:10:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:34,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:34,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:34,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:10:34,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:34,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash -715083488, now seen corresponding path program 1 times [2024-10-31 22:10:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426950293] [2024-10-31 22:10:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:34,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426950293] [2024-10-31 22:10:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426950293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152163538] [2024-10-31 22:10:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:35,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:35,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-31 22:10:35,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 221 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:35,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:35,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-31 22:10:35,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:35,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 119#L1063-10true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:10:35,439 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2024-10-31 22:10:35,439 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2024-10-31 22:10:35,439 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2024-10-31 22:10:35,439 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:10:35,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][185], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 13#L1062-36true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:10:35,449 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:10:35,449 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:35,449 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:35,449 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:35,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 125#L1063-16true, 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:35,468 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:10:35,468 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:35,468 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:35,469 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:35,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 195#(= |#race~threads_mask~0| 0), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 200#(= |#race~datas~0| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 93#L1063-20true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:35,517 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-31 22:10:35,517 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:10:35,517 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:10:35,517 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:10:35,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 195#(= |#race~threads_mask~0| 0), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L1064-3true, 200#(= |#race~datas~0| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:35,544 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-31 22:10:35,544 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:10:35,544 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-31 22:10:35,544 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:10:35,589 INFO L124 PetriNetUnfolderBase]: 439/1756 cut-off events. [2024-10-31 22:10:35,590 INFO L125 PetriNetUnfolderBase]: For 1873/2015 co-relation queries the response was YES. [2024-10-31 22:10:35,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1756 events. 439/1756 cut-off events. For 1873/2015 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 12131 event pairs, 63 based on Foata normal form. 23/1554 useless extension candidates. Maximal degree in co-relation 3202. Up to 283 conditions per place. [2024-10-31 22:10:35,608 INFO L140 encePairwiseOnDemand]: 192/202 looper letters, 47 selfloop transitions, 17 changer transitions 0/243 dead transitions. [2024-10-31 22:10:35,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 243 transitions, 891 flow [2024-10-31 22:10:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-31 22:10:35,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-31 22:10:35,611 INFO L175 Difference]: Start difference. First operand has 205 places, 221 transitions, 693 flow. Second operand 4 states and 743 transitions. [2024-10-31 22:10:35,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 243 transitions, 891 flow [2024-10-31 22:10:35,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 243 transitions, 875 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:35,620 INFO L231 Difference]: Finished difference. Result has 209 places, 224 transitions, 759 flow [2024-10-31 22:10:35,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=759, PETRI_PLACES=209, PETRI_TRANSITIONS=224} [2024-10-31 22:10:35,621 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 22 predicate places. [2024-10-31 22:10:35,621 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 224 transitions, 759 flow [2024-10-31 22:10:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:35,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:35,622 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:35,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:10:35,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:35,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:35,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1105010937, now seen corresponding path program 1 times [2024-10-31 22:10:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963100919] [2024-10-31 22:10:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:35,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963100919] [2024-10-31 22:10:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963100919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:35,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312565248] [2024-10-31 22:10:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:35,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:35,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 202 [2024-10-31 22:10:35,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 224 transitions, 759 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:35,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:35,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 202 [2024-10-31 22:10:35,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:36,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, 13#L1062-36true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:10:36,183 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:10:36,183 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:36,183 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:36,183 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:36,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][255], [60#L1063-11true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:36,305 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:10:36,305 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:10:36,305 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:10:36,305 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:10:36,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][256], [60#L1063-11true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 38#L1050-16true, Black: 238#(not (= ~threads_mask~0 0)), Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-31 22:10:36,306 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-31 22:10:36,306 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:10:36,306 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:10:36,306 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:10:36,337 INFO L124 PetriNetUnfolderBase]: 508/1985 cut-off events. [2024-10-31 22:10:36,337 INFO L125 PetriNetUnfolderBase]: For 3268/3384 co-relation queries the response was YES. [2024-10-31 22:10:36,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4273 conditions, 1985 events. 508/1985 cut-off events. For 3268/3384 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14570 event pairs, 82 based on Foata normal form. 18/1763 useless extension candidates. Maximal degree in co-relation 4043. Up to 478 conditions per place. [2024-10-31 22:10:36,357 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 51 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2024-10-31 22:10:36,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 257 transitions, 1095 flow [2024-10-31 22:10:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2024-10-31 22:10:36,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245049504950495 [2024-10-31 22:10:36,360 INFO L175 Difference]: Start difference. First operand has 209 places, 224 transitions, 759 flow. Second operand 4 states and 747 transitions. [2024-10-31 22:10:36,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 257 transitions, 1095 flow [2024-10-31 22:10:36,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 257 transitions, 1071 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:10:36,372 INFO L231 Difference]: Finished difference. Result has 213 places, 238 transitions, 955 flow [2024-10-31 22:10:36,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=955, PETRI_PLACES=213, PETRI_TRANSITIONS=238} [2024-10-31 22:10:36,374 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 26 predicate places. [2024-10-31 22:10:36,374 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 238 transitions, 955 flow [2024-10-31 22:10:36,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:36,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:36,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:10:36,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2126736080, now seen corresponding path program 1 times [2024-10-31 22:10:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898208993] [2024-10-31 22:10:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898208993] [2024-10-31 22:10:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898208993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:36,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015727584] [2024-10-31 22:10:36,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:36,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:36,471 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:10:36,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 238 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:36,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:36,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:10:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:36,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][179], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 215#(<= (+ ~threads_mask~0 1) 0), 250#true, 242#true, Black: 244#(<= 0 (+ ~threads_mask~0 1)), 13#L1062-36true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-31 22:10:36,717 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:10:36,717 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:36,717 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:36,717 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:36,932 INFO L124 PetriNetUnfolderBase]: 477/2120 cut-off events. [2024-10-31 22:10:36,932 INFO L125 PetriNetUnfolderBase]: For 2596/2637 co-relation queries the response was YES. [2024-10-31 22:10:36,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 2120 events. 477/2120 cut-off events. For 2596/2637 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16570 event pairs, 102 based on Foata normal form. 8/1893 useless extension candidates. Maximal degree in co-relation 3948. Up to 457 conditions per place. [2024-10-31 22:10:36,955 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 35 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2024-10-31 22:10:36,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 247 transitions, 1063 flow [2024-10-31 22:10:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2024-10-31 22:10:36,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9158415841584159 [2024-10-31 22:10:36,959 INFO L175 Difference]: Start difference. First operand has 213 places, 238 transitions, 955 flow. Second operand 3 states and 555 transitions. [2024-10-31 22:10:36,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 247 transitions, 1063 flow [2024-10-31 22:10:36,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 247 transitions, 1063 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:36,972 INFO L231 Difference]: Finished difference. Result has 217 places, 243 transitions, 1011 flow [2024-10-31 22:10:36,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1011, PETRI_PLACES=217, PETRI_TRANSITIONS=243} [2024-10-31 22:10:36,975 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 30 predicate places. [2024-10-31 22:10:36,975 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 243 transitions, 1011 flow [2024-10-31 22:10:36,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:36,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:36,976 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:10:36,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1471015507, now seen corresponding path program 1 times [2024-10-31 22:10:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:36,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727037400] [2024-10-31 22:10:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727037400] [2024-10-31 22:10:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727037400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455035533] [2024-10-31 22:10:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:37,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:37,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:37,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2024-10-31 22:10:37,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 243 transitions, 1011 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:37,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:37,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2024-10-31 22:10:37,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:38,622 INFO L124 PetriNetUnfolderBase]: 649/2753 cut-off events. [2024-10-31 22:10:38,622 INFO L125 PetriNetUnfolderBase]: For 2910/2936 co-relation queries the response was YES. [2024-10-31 22:10:38,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5365 conditions, 2753 events. 649/2753 cut-off events. For 2910/2936 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 21838 event pairs, 164 based on Foata normal form. 11/2421 useless extension candidates. Maximal degree in co-relation 5120. Up to 607 conditions per place. [2024-10-31 22:10:38,660 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 54 selfloop transitions, 22 changer transitions 0/280 dead transitions. [2024-10-31 22:10:38,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 280 transitions, 1237 flow [2024-10-31 22:10:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1051 transitions. [2024-10-31 22:10:38,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8671617161716172 [2024-10-31 22:10:38,667 INFO L175 Difference]: Start difference. First operand has 217 places, 243 transitions, 1011 flow. Second operand 6 states and 1051 transitions. [2024-10-31 22:10:38,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 280 transitions, 1237 flow [2024-10-31 22:10:38,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 280 transitions, 1223 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:10:38,714 INFO L231 Difference]: Finished difference. Result has 225 places, 264 transitions, 1147 flow [2024-10-31 22:10:38,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=225, PETRI_TRANSITIONS=264} [2024-10-31 22:10:38,716 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 38 predicate places. [2024-10-31 22:10:38,716 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 264 transitions, 1147 flow [2024-10-31 22:10:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:38,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:38,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:10:38,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:38,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1852938791, now seen corresponding path program 1 times [2024-10-31 22:10:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564793795] [2024-10-31 22:10:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564793795] [2024-10-31 22:10:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564793795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:39,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:39,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721012627] [2024-10-31 22:10:39,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:39,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:39,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:39,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 202 [2024-10-31 22:10:39,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 264 transitions, 1147 flow. Second operand has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:39,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:39,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 202 [2024-10-31 22:10:39,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:40,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][198], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), 266#true, Black: 232#(not (= ~threads_mask~0 0)), 125#L1063-16true, 217#true, Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:40,198 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2024-10-31 22:10:40,198 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:10:40,198 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:10:40,198 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:10:40,478 INFO L124 PetriNetUnfolderBase]: 727/2961 cut-off events. [2024-10-31 22:10:40,478 INFO L125 PetriNetUnfolderBase]: For 3229/3295 co-relation queries the response was YES. [2024-10-31 22:10:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 2961 events. 727/2961 cut-off events. For 3229/3295 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 24108 event pairs, 133 based on Foata normal form. 26/2692 useless extension candidates. Maximal degree in co-relation 5924. Up to 689 conditions per place. [2024-10-31 22:10:40,553 INFO L140 encePairwiseOnDemand]: 187/202 looper letters, 82 selfloop transitions, 48 changer transitions 0/339 dead transitions. [2024-10-31 22:10:40,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 339 transitions, 1691 flow [2024-10-31 22:10:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2024-10-31 22:10:40,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9026402640264026 [2024-10-31 22:10:40,557 INFO L175 Difference]: Start difference. First operand has 225 places, 264 transitions, 1147 flow. Second operand 6 states and 1094 transitions. [2024-10-31 22:10:40,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 339 transitions, 1691 flow [2024-10-31 22:10:40,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 339 transitions, 1691 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:40,580 INFO L231 Difference]: Finished difference. Result has 235 places, 307 transitions, 1535 flow [2024-10-31 22:10:40,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1535, PETRI_PLACES=235, PETRI_TRANSITIONS=307} [2024-10-31 22:10:40,581 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 48 predicate places. [2024-10-31 22:10:40,581 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 307 transitions, 1535 flow [2024-10-31 22:10:40,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:40,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:40,583 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:40,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:10:40,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:40,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:40,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1669663743, now seen corresponding path program 1 times [2024-10-31 22:10:40,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:40,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353542805] [2024-10-31 22:10:40,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:40,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:10:41,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353542805] [2024-10-31 22:10:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353542805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664686648] [2024-10-31 22:10:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:41,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:10:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:10:41,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:10:41,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2024-10-31 22:10:41,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 307 transitions, 1535 flow. Second operand has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:41,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:41,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2024-10-31 22:10:41,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:42,144 INFO L124 PetriNetUnfolderBase]: 729/3015 cut-off events. [2024-10-31 22:10:42,145 INFO L125 PetriNetUnfolderBase]: For 3726/3780 co-relation queries the response was YES. [2024-10-31 22:10:42,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 3015 events. 729/3015 cut-off events. For 3726/3780 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 24746 event pairs, 149 based on Foata normal form. 17/2740 useless extension candidates. Maximal degree in co-relation 6638. Up to 763 conditions per place. [2024-10-31 22:10:42,194 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 102 selfloop transitions, 31 changer transitions 11/351 dead transitions. [2024-10-31 22:10:42,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 351 transitions, 2016 flow [2024-10-31 22:10:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2024-10-31 22:10:42,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8762376237623762 [2024-10-31 22:10:42,198 INFO L175 Difference]: Start difference. First operand has 235 places, 307 transitions, 1535 flow. Second operand 6 states and 1062 transitions. [2024-10-31 22:10:42,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 351 transitions, 2016 flow [2024-10-31 22:10:42,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 351 transitions, 1998 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:42,228 INFO L231 Difference]: Finished difference. Result has 245 places, 328 transitions, 1818 flow [2024-10-31 22:10:42,228 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1818, PETRI_PLACES=245, PETRI_TRANSITIONS=328} [2024-10-31 22:10:42,229 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 58 predicate places. [2024-10-31 22:10:42,229 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 328 transitions, 1818 flow [2024-10-31 22:10:42,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:42,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:42,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:10:42,230 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1759250776, now seen corresponding path program 1 times [2024-10-31 22:10:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462382395] [2024-10-31 22:10:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:10:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462382395] [2024-10-31 22:10:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462382395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:43,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:10:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134786493] [2024-10-31 22:10:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:10:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:10:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:10:43,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 202 [2024-10-31 22:10:43,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 328 transitions, 1818 flow. Second operand has 11 states, 11 states have (on average 159.45454545454547) internal successors, (1754), 11 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:43,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:43,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 202 [2024-10-31 22:10:43,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:44,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][219], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 266#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 125#L1063-16true, Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:44,853 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is not cut-off event [2024-10-31 22:10:44,853 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:10:44,853 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:10:44,853 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:10:45,077 INFO L124 PetriNetUnfolderBase]: 810/3283 cut-off events. [2024-10-31 22:10:45,077 INFO L125 PetriNetUnfolderBase]: For 4395/4469 co-relation queries the response was YES. [2024-10-31 22:10:45,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7828 conditions, 3283 events. 810/3283 cut-off events. For 4395/4469 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 27511 event pairs, 129 based on Foata normal form. 46/3038 useless extension candidates. Maximal degree in co-relation 7558. Up to 571 conditions per place. [2024-10-31 22:10:45,120 INFO L140 encePairwiseOnDemand]: 187/202 looper letters, 173 selfloop transitions, 70 changer transitions 2/442 dead transitions. [2024-10-31 22:10:45,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 442 transitions, 2908 flow [2024-10-31 22:10:45,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-31 22:10:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-10-31 22:10:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2963 transitions. [2024-10-31 22:10:45,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.814906490649065 [2024-10-31 22:10:45,127 INFO L175 Difference]: Start difference. First operand has 245 places, 328 transitions, 1818 flow. Second operand 18 states and 2963 transitions. [2024-10-31 22:10:45,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 442 transitions, 2908 flow [2024-10-31 22:10:45,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 442 transitions, 2852 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:45,165 INFO L231 Difference]: Finished difference. Result has 258 places, 346 transitions, 2027 flow [2024-10-31 22:10:45,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2027, PETRI_PLACES=258, PETRI_TRANSITIONS=346} [2024-10-31 22:10:45,166 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 71 predicate places. [2024-10-31 22:10:45,166 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 346 transitions, 2027 flow [2024-10-31 22:10:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 159.45454545454547) internal successors, (1754), 11 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:45,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:45,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:10:45,168 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:45,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash -880406067, now seen corresponding path program 1 times [2024-10-31 22:10:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755901236] [2024-10-31 22:10:45,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:10:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755901236] [2024-10-31 22:10:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755901236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:45,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:10:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573184849] [2024-10-31 22:10:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:45,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:10:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:10:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:10:46,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 202 [2024-10-31 22:10:46,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 346 transitions, 2027 flow. Second operand has 12 states, 12 states have (on average 156.33333333333334) internal successors, (1876), 12 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:46,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:46,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 202 [2024-10-31 22:10:46,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:47,973 INFO L124 PetriNetUnfolderBase]: 793/3163 cut-off events. [2024-10-31 22:10:47,973 INFO L125 PetriNetUnfolderBase]: For 4690/4751 co-relation queries the response was YES. [2024-10-31 22:10:47,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7958 conditions, 3163 events. 793/3163 cut-off events. For 4690/4751 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 25962 event pairs, 177 based on Foata normal form. 37/2935 useless extension candidates. Maximal degree in co-relation 7675. Up to 739 conditions per place. [2024-10-31 22:10:48,006 INFO L140 encePairwiseOnDemand]: 189/202 looper letters, 150 selfloop transitions, 42 changer transitions 6/392 dead transitions. [2024-10-31 22:10:48,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 392 transitions, 2721 flow [2024-10-31 22:10:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:10:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-31 22:10:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2092 transitions. [2024-10-31 22:10:48,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7966488956587966 [2024-10-31 22:10:48,014 INFO L175 Difference]: Start difference. First operand has 258 places, 346 transitions, 2027 flow. Second operand 13 states and 2092 transitions. [2024-10-31 22:10:48,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 392 transitions, 2721 flow [2024-10-31 22:10:48,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 392 transitions, 2560 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-10-31 22:10:48,056 INFO L231 Difference]: Finished difference. Result has 261 places, 345 transitions, 1984 flow [2024-10-31 22:10:48,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1984, PETRI_PLACES=261, PETRI_TRANSITIONS=345} [2024-10-31 22:10:48,058 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 74 predicate places. [2024-10-31 22:10:48,058 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 345 transitions, 1984 flow [2024-10-31 22:10:48,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 156.33333333333334) internal successors, (1876), 12 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:48,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:48,060 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:48,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:10:48,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 558586246, now seen corresponding path program 1 times [2024-10-31 22:10:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531062783] [2024-10-31 22:10:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:10:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531062783] [2024-10-31 22:10:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531062783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:10:48,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250374507] [2024-10-31 22:10:48,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:10:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:48,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:10:48,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:10:48,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202 [2024-10-31 22:10:48,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 345 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:48,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:48,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202 [2024-10-31 22:10:48,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:48,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([539] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][213], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 344#true, 266#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 238#(not (= ~threads_mask~0 0)), 38#L1050-16true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 244#(<= 0 (+ ~threads_mask~0 1)), 335#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 13#L1062-36true, Black: 288#true, Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:48,722 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:10:48,723 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:48,723 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:48,723 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:10:48,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][283], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 105#L1063-1true, Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 185#L1050-18true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), 344#true, Black: 232#(not (= ~threads_mask~0 0)), 266#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 238#(not (= ~threads_mask~0 0)), Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), 335#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 288#true, Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:48,974 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-31 22:10:48,974 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:10:48,974 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:10:48,974 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:10:48,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][283], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 105#L1063-1true, Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), Black: 232#(not (= ~threads_mask~0 0)), 266#true, 344#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 238#(not (= ~threads_mask~0 0)), 136#L1050-19true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), 335#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 288#true, Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:48,994 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-31 22:10:48,994 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-31 22:10:48,994 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:10:48,994 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:10:49,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][292], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 105#L1063-1true, Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 126#L1051true, Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), 344#true, Black: 232#(not (= ~threads_mask~0 0)), 266#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 238#(not (= ~threads_mask~0 0)), Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), 335#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 288#true, Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:49,035 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-31 22:10:49,035 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:10:49,035 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:10:49,035 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:10:49,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([325] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][292], [Black: 193#true, Black: 260#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 257#(= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 259#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 198#true, Black: 258#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet25#1|) (= |ULTIMATE.start_main_#t~nondet25#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))), 105#L1063-1true, Black: 271#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 268#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), 277#true, Black: 269#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 270#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 215#(<= (+ ~threads_mask~0 1) 0), 242#true, Black: 281#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 280#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 219#(not (= ~threads_mask~0 0)), 188#true, Black: 279#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 233#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise20#1|)), 344#true, Black: 232#(not (= ~threads_mask~0 0)), 266#true, 217#true, 306#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 238#(not (= ~threads_mask~0 0)), 146#L1051-3true, Black: 239#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise20#1| 1)), 200#(= |#race~datas~0| 0), 255#true, Black: 247#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise20#1|)) (<= 0 (+ ~threads_mask~0 1))), 335#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 244#(<= 0 (+ ~threads_mask~0 1)), Black: 288#true, Black: 252#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet22#1|)]) [2024-10-31 22:10:49,036 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-31 22:10:49,036 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:10:49,036 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:10:49,036 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:10:49,108 INFO L124 PetriNetUnfolderBase]: 836/3309 cut-off events. [2024-10-31 22:10:49,108 INFO L125 PetriNetUnfolderBase]: For 4148/4264 co-relation queries the response was YES. [2024-10-31 22:10:49,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7593 conditions, 3309 events. 836/3309 cut-off events. For 4148/4264 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 27959 event pairs, 139 based on Foata normal form. 20/3016 useless extension candidates. Maximal degree in co-relation 7318. Up to 698 conditions per place. [2024-10-31 22:10:49,143 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 39 selfloop transitions, 11 changer transitions 3/362 dead transitions. [2024-10-31 22:10:49,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 362 transitions, 2154 flow [2024-10-31 22:10:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:10:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:10:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2024-10-31 22:10:49,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273927392739274 [2024-10-31 22:10:49,145 INFO L175 Difference]: Start difference. First operand has 261 places, 345 transitions, 1984 flow. Second operand 3 states and 562 transitions. [2024-10-31 22:10:49,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 362 transitions, 2154 flow [2024-10-31 22:10:49,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 362 transitions, 2077 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-10-31 22:10:49,278 INFO L231 Difference]: Finished difference. Result has 254 places, 349 transitions, 1964 flow [2024-10-31 22:10:49,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1964, PETRI_PLACES=254, PETRI_TRANSITIONS=349} [2024-10-31 22:10:49,279 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 67 predicate places. [2024-10-31 22:10:49,279 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 349 transitions, 1964 flow [2024-10-31 22:10:49,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:49,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:49,280 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:49,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:10:49,281 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:49,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -73006824, now seen corresponding path program 1 times [2024-10-31 22:10:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:49,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764988381] [2024-10-31 22:10:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:10:49,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:49,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764988381] [2024-10-31 22:10:49,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764988381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:49,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:49,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:10:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036917052] [2024-10-31 22:10:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:49,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:10:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:10:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:10:49,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 202 [2024-10-31 22:10:49,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 349 transitions, 1964 flow. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:49,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:49,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 202 [2024-10-31 22:10:49,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:49,802 INFO L124 PetriNetUnfolderBase]: 224/1195 cut-off events. [2024-10-31 22:10:49,802 INFO L125 PetriNetUnfolderBase]: For 1443/1481 co-relation queries the response was YES. [2024-10-31 22:10:49,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 1195 events. 224/1195 cut-off events. For 1443/1481 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6643 event pairs, 2 based on Foata normal form. 12/1150 useless extension candidates. Maximal degree in co-relation 2688. Up to 129 conditions per place. [2024-10-31 22:10:49,815 INFO L140 encePairwiseOnDemand]: 196/202 looper letters, 18 selfloop transitions, 6 changer transitions 10/305 dead transitions. [2024-10-31 22:10:49,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 305 transitions, 1643 flow [2024-10-31 22:10:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:10:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:10:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2024-10-31 22:10:49,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207920792079208 [2024-10-31 22:10:49,818 INFO L175 Difference]: Start difference. First operand has 254 places, 349 transitions, 1964 flow. Second operand 4 states and 744 transitions. [2024-10-31 22:10:49,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 305 transitions, 1643 flow [2024-10-31 22:10:49,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 305 transitions, 1580 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-10-31 22:10:49,841 INFO L231 Difference]: Finished difference. Result has 242 places, 292 transitions, 1466 flow [2024-10-31 22:10:49,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1466, PETRI_PLACES=242, PETRI_TRANSITIONS=292} [2024-10-31 22:10:49,842 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 55 predicate places. [2024-10-31 22:10:49,842 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 292 transitions, 1466 flow [2024-10-31 22:10:49,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:49,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:49,843 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:49,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:10:49,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:49,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash 366268536, now seen corresponding path program 1 times [2024-10-31 22:10:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:49,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517346489] [2024-10-31 22:10:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:10:50,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:50,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517346489] [2024-10-31 22:10:50,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517346489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:50,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:50,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057376694] [2024-10-31 22:10:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:50,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:50,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:50,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-31 22:10:50,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 292 transitions, 1466 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:50,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:50,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-31 22:10:50,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:50,655 INFO L124 PetriNetUnfolderBase]: 417/1968 cut-off events. [2024-10-31 22:10:50,656 INFO L125 PetriNetUnfolderBase]: For 2212/2289 co-relation queries the response was YES. [2024-10-31 22:10:50,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 1968 events. 417/1968 cut-off events. For 2212/2289 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12976 event pairs, 2 based on Foata normal form. 1/1863 useless extension candidates. Maximal degree in co-relation 3902. Up to 252 conditions per place. [2024-10-31 22:10:50,678 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 48 selfloop transitions, 12 changer transitions 0/317 dead transitions. [2024-10-31 22:10:50,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 317 transitions, 1726 flow [2024-10-31 22:10:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2024-10-31 22:10:50,683 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2024-10-31 22:10:50,683 INFO L175 Difference]: Start difference. First operand has 242 places, 292 transitions, 1466 flow. Second operand 6 states and 1086 transitions. [2024-10-31 22:10:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 317 transitions, 1726 flow [2024-10-31 22:10:50,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 317 transitions, 1707 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-10-31 22:10:50,710 INFO L231 Difference]: Finished difference. Result has 246 places, 302 transitions, 1579 flow [2024-10-31 22:10:50,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1579, PETRI_PLACES=246, PETRI_TRANSITIONS=302} [2024-10-31 22:10:50,712 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 59 predicate places. [2024-10-31 22:10:50,712 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 302 transitions, 1579 flow [2024-10-31 22:10:50,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:50,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:50,714 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:10:50,714 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:50,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash -930778122, now seen corresponding path program 1 times [2024-10-31 22:10:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890920651] [2024-10-31 22:10:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:50,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-31 22:10:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890920651] [2024-10-31 22:10:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890920651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127302485] [2024-10-31 22:10:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:50,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:51,076 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-31 22:10:51,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 302 transitions, 1579 flow. Second operand has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:51,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:51,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-31 22:10:51,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:10:51,860 INFO L124 PetriNetUnfolderBase]: 697/3022 cut-off events. [2024-10-31 22:10:51,860 INFO L125 PetriNetUnfolderBase]: For 3951/4098 co-relation queries the response was YES. [2024-10-31 22:10:51,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7806 conditions, 3022 events. 697/3022 cut-off events. For 3951/4098 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 22739 event pairs, 5 based on Foata normal form. 1/2861 useless extension candidates. Maximal degree in co-relation 7501. Up to 427 conditions per place. [2024-10-31 22:10:51,926 INFO L140 encePairwiseOnDemand]: 193/202 looper letters, 62 selfloop transitions, 16 changer transitions 0/335 dead transitions. [2024-10-31 22:10:51,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 335 transitions, 1957 flow [2024-10-31 22:10:51,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:10:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:10:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1086 transitions. [2024-10-31 22:10:51,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2024-10-31 22:10:51,931 INFO L175 Difference]: Start difference. First operand has 246 places, 302 transitions, 1579 flow. Second operand 6 states and 1086 transitions. [2024-10-31 22:10:51,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 335 transitions, 1957 flow [2024-10-31 22:10:51,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 335 transitions, 1957 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:10:51,967 INFO L231 Difference]: Finished difference. Result has 255 places, 316 transitions, 1763 flow [2024-10-31 22:10:51,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1763, PETRI_PLACES=255, PETRI_TRANSITIONS=316} [2024-10-31 22:10:51,968 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 68 predicate places. [2024-10-31 22:10:51,968 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 316 transitions, 1763 flow [2024-10-31 22:10:51,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:51,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:10:51,971 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:10:51,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:10:51,972 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:10:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:10:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -428079819, now seen corresponding path program 1 times [2024-10-31 22:10:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:10:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876895125] [2024-10-31 22:10:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:10:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:10:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:10:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-31 22:10:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:10:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876895125] [2024-10-31 22:10:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876895125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:10:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:10:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:10:52,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968336653] [2024-10-31 22:10:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:10:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:10:52,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:10:52,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:10:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:10:52,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-31 22:10:52,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 316 transitions, 1763 flow. Second operand has 5 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:10:52,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:10:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-31 22:10:52,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand